(Enter summary)
Abstract: The theory of cut-free sequent proofs has been used to motivate and justify
the design of a number of logic programming languages. Two such languages,
Prolog and its linear logic refinement, Lolli [15], provide for various forms of
abstraction (modules, abstract data types, and higher-order programming) but
lack primitives for concurrency. The logic programming language, LO (Linear
Objects) [2] provides some primitives for concurrency but lacks abstraction
mechanisms. In this paper we present... (Update)
Context of citations to this paper: More
...a term. Several logic programming languages based on linear logic have been proposed: Lygon [7] LO [2] LinLog [1] Lolli [9] Forum [14], etc. In particular, Forum is complete for classical linear logic and its execution can be viewed as a goal directed proof search called...
...reasoning. If we adopt Miller s characterization of uniform proof for sequent calculi with multiple conclusions [Miller, 1994, Miller, 1996] then any modal theorem has a uniform proof in a lifted, explicitly scoped inference system. Put another way, explicitly scoped...
Cited by: More
Monadic Concurrent Linear Logic Programming - Lopez, Pfenning, Polakow, Watkins (2005)
(Correct)
September 2003 Invited tutorial at ICLP '03 - Atutorial On Proof
(Correct)
A Tutorial on Proof Theoretic Foundations of Logic Programming - Bruscoli, Guglielmi (2003)
(Correct)
Similar documents (at the sentence level):
18.8%: A Multiple-Conclusion Meta-Logic - Miller (1994)
(Correct)
8.5%: Sequent Calculus and the Specification of Computation - Lecture.. - Miller (1998)
(Correct)
Active bibliography (related documents): More All
0.2: The Pi-Calculus as a Theory in Linear Logic - Miller (1992)
(Correct)
0.2: Encoding Transition Systems in Sequent Calculus - Raymond Mcdowell (1997)
(Correct)
0.2: A Survey of Linear Logic Programming - Dale Miller (1995)
(Correct)
Similar documents based on text: More All
0.2: Lolli: An Extension of Lambda-Prolog with Linear Logic Context.. - Hodas (1992)
(Correct)
0.2: A Compiler System of a Linear Logic Programming Language - Tamura, Kaneda (1997)
(Correct)
0.1: An Introduction to Natural Language Generation - Dale (1995)
(Correct)
Related documents from co-citation: More All
30: Logic programming with focusing proofs in linear logic
- Andreoli - 1992
27: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
26: Logic programming in a fragment of intuitionistic linear logic
- Hodas, Miller - 1994
BibTeX entry: (Update)
Miller, D.: "Forum: a multiple-conclusion specification logic", to appear in Theoretical Computer Science. http://citeseer.ist.psu.edu/miller96forum.html More
@article{ miller96forum,
author = "Dale Miller",
title = "Forum: {A} multiple-conclusion specification logic",
journal = "Theoretical Computer Science",
volume = "165",
number = "1",
pages = "201--232",
year = "1996",
url = "citeseer.ist.psu.edu/miller96forum.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
854
Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
447
Prentice-Hall International (context) - Milner, Concurrency - 1989
434
A framework for defining logics
- Harper, Honsell et al. - 1993 ACM DBLP
419
A formulation of the simple theory of types (context) - Church - 1940 DBLP
344
concurrent constraint programming (context) - Lincoln, Saraswat et al. - 1993 ACM DBLP
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
257
Logic programming in a fragment of intuitionistic linear log..
- Hodas, Miller - 1994 ACM DBLP
257
Logic programming in a fragment of intuitionistic linear log..
- Hodas, Miller - 1991
223
Linear objects: Logical processes with built-in inheritance
- Andreoli, Pareschi - 1991 ACM
215
Theoretical Computer Science (context) - Girard - 1987 ACM
159
CML: A higher-order concurrent language (context) - Reppy - 1991 DBLP
149
A logical analysis of modules in logic programming (context) - Miller - 1989 ACM DBLP
129
The foundation of a generic theorem prover
- Paulson - 1989 ACM DBLP
81
A multiple-conclusion meta-logic
- Miller - 1994 DBLP
75
Using typed lambda calculus to implement formal systems on a..
- Avron, Honsell et al. - 1992 ACM DBLP
71
Elf: A language for logic definition and verified metaprogra..
- Pfenning - 1989 ACM DBLP
53
Lexical scoping as universal quantification
- Miller - 1989 DBLP
53
Implementing tactics and tacticals in a higher-order logic p..
- Felty - 1993 DBLP
49
ACL - a concurrent linear logic programming paradigm
- Kobayashi, Yonezawa - 1993 DBLP
38
Proof Theoretic Approach to Specification Languages
- Chirimar - 1995 ACM
33
Type-theoretic foundations for concurrent object-oriented pr.. (context) - Kobayashi, Yonezawa - 1994 DBLP
27
Abstractions in logic programming (context) - Miller - 1990
20
Logic programming with focusing proofs in linear logic (context) - Andreoli - 1992 DBLP
20
Annals of Pure and Applied Logic (context) - Girard, unity - 1993
18
Extended natural semantics (context) - Hannan - 1993 DBLP
9
Program transformations and WAM-support for the compilation .. (context) - Tarau - 1992 ACM DBLP
7
On goal-directed provability in classical logic
- Harland, Pym - 1992 ACM DBLP
7
A brief introduction to linear concurrent constraint program.. (context) - Saraswat - 1993
6
A natural deduction treatment of operational semantics (context) - Burstall, Honsell - 1988
4
Permutabilities of inferences in Gentzen's calculi LK and LJ (context) - Kleene - 1952
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.disi.unige.it/person/MillerD/):
Sequent Calculus and the Specification of Computation - Lecture.. - Miller (1997)
(Correct)
Logic Programming in a Fragment of Intuitionistic Linear Logic - Hodas, Miller (1994)
(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