(Enter summary)
Abstract: Traditional logic programming languages,
such as Prolog, have their origins in classical
logic. Recently it has been shown how logic
programming languages can be based on linear
logic, a logic designed with bounded resources
in mind. In this paper we discuss the
implementation issues for the linear logic programming
language Lygon, and describe some
of the novel features of the language. These
include global variables, a notion of state, mutual
exclusion operators and constructs for the... (Update)
Context of citations to this paper: More
...programming languages include modal and temporal [14] relevant [4] and linear logics. This paper is concerned with the language Lygon [7, 15, 22]. Lygon is a logic programming language which is based on linear logic. By design the class of formulae used is as large as...
.... have been various proposals for linear logic programming languages, including LO [2] Lolli [8] ACL [10] Forum [12] and Lygon [6, 7, 19, 20]. In this paper we describe some novel and interesting applications of Lygon, with particular reference to graph problems, and...
Cited by: More
Working with Linear Logic in Coq - Power, Webster
(Correct)
Programming in Lygon: An Overview - Harland, Pym, Winikoff (1996)
(Correct)
Programming in Lygon: an overview - Harland, Pym, Winikoff (1995)
(Correct)
Active bibliography (related documents): More All
0.0: Uniformity in Ludics, Why and How... - Hyvernat (2002)
(Correct)
0.0: Linear Logic Programming for AI Planning - Küngas (2002)
(Correct)
0.0: On the Expressiveness of Coordination via Shared Dataspaces - Brogi, Jacquet (2000)
(Correct)
Similar documents based on text: More All
0.2: Hitch Hiker's Guide to Lygon 0.7 - Winikoff (1996)
(Correct)
0.2: The Event Calculus as a Linear Logic Program - Alexiev (1995)
(Correct)
0.2: Resource-distribution via Boolean constraints - James Harland Rmit (1997)
(Correct)
Related documents from co-citation: More All
7: A uniform proof-theoretic investigation of linear logic programming
- Harland, Pym - 1994
6: Logic programming in a fragment of intuitionistic linear logic
- Hodas, Miller - 1994
6: Logic programming with focusing proofs in linear logic
- Andreoli - 1992
BibTeX entry: (Update)
J.A. Harland, D.J. Pym. A Note on the Implementation and Applications of Linear Logic Programming Languages. Proceedings of the Seventeenth Annual Computer Science Conference, pages 647-658, Christchurch, January, 1994. http://citeseer.ist.psu.edu/harland94note.html More
@inproceedings{ harland94note,
author = "James Harland and David Pym",
title = "A Note on the Implementation and Applications of Linear Logic Programming Languages",
booktitle = "Proceedings of the Seventeenth Annual Computer Science Conference, Christchurch",
editor = "G. Gupta",
pages = "647--658",
year = "1994",
url = "citeseer.ist.psu.edu/harland94note.html" }
Citations (may not include all citations):
242
Linear Logic (context) - Girard ACM DBLP
47
Untersuchungen uber das logische Schliessen (context) - Gentzen - 1934
13
Linear Objects: Logical Processes with Builtin Inheritance (context) - Andreoli, Pareschi - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/~iliano/linearbib/llb.html): More
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994)
(Correct)
The Undecidability Of Second Order Linear Logic Without.. - Lafont (1995)
(Correct)
The Finite Model Property For Various Fragments Of Linear Logic - Lafont (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC