James Harland, David Pym  Home/Search
Context Related
| rmit.edu.au/~jah/publica...ilps91.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~iliano/linear...llb (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) James Harland Department of Computer Science University of Melbourne Parkville, 3052 Australia jah@cs.mu.oz.au David Pym Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ Scotland, U.K. dpym@lfcs.ed.ac.uk Abstract We present a proof-theoretic analysis of a natural notion of logic programming for Girard's linear logic. This analysis enables us to identify a suitable notion of uniform proof. This in turn enables us to identify choices of classes of definite... (Update)
Cited by: More
Efficient Resource Management for Linear Logic Proof Search - Cervesato, Hodas, Pfenning (1997) (Correct)
The Inverse Method for Intuitionistic Linear Logic (The.. - Chaudhuri (2003) (Correct)
A Focusing Inverse Method Theorem Prover for First-Order.. - Chaudhuri, Pfenning (2005) (Correct)
Similar documents (at the sentence level):
10.6%: A Uniform Proof-Theoretic Investigation Of Linear Logic.. - Harland, Pym (1994) (Correct)
7.9%: On Resolution in Fragments of Classical Linear Logic (Extended .. - Harland, Pym (Correct)
Active bibliography (related documents): More All
0.2: Proof-terms for classical and intuitionistic resolution (Extended .. - Ritter (1996) (Correct)
0.2: Proof-Terms for Classical and Intuitionistic Resolution - Eike Ritter (1996) (Correct)
0.1: A Proof-Theoretic Analysis of Goal-Directed Provability - Harland (1992) (Correct)
Similar documents based on text: More All
0.1: Programming in Lygon: An Overview - Harland, Pym, Winikoff (1996) (Correct)
0.1: Resource-distribution via Boolean constraints - Harland, Pym (2000) (Correct)
0.1: Forward and Backward Chaining in Linear Logic - Harland, Pym, Winikoff (Correct)
Related documents from co-citation: More All
24: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
23: Logic programming in a fragment of intuitionistic linear logic - Hodas, Miller - 1994
22: Linear Objects: Logical Processes with Built-in Inheritance - Pareschi
BibTeX entry: (Update)
James Harland and David Pym. The uniform proof-theoretic foundation of linear logic programming. In V. Saraswat and K. Ueda, editors, Proceedings of the International Logic Programming Symposium, pages 304--318, San Diego, California, October 1991. http://citeseer.ist.psu.edu/harland91uniform.html More
@inproceedings{ harland91uniform,
author = "J. Harland and D. Pym",
title = "The Uniform Proof-Theoretic Foundation of Linear Logic Programming (Extended Abstract)",
booktitle = "Intl.\ Symposium on Logic Programming ({ISLP}'91)",
address = "San Diego, California",
editor = "V. Saraswat and K. Ueda",
pages = "304-318",
year = "1991",
url = "citeseer.ist.psu.edu/harland91uniform.html" }
Citations (may not include all citations):340 Uniform Proofs as a Foundation for Logic Programming (context) - Miller, Nadathur et al.
257 Logic Programming in a Fragment of Intuitionistic Linear Log.. - Hodas, Miller - 1991
223 Linear Objects: Logical Processes with Built-in Inheritance - Andreoli - 1990
149 A Logical Analysis of Modules in Logic Programming (context) - Miller - 1989
97 Automated Deduction in Non-classical Logics (context) - Wallen - 1989
73 Theorem-proving via general matings (context) - Andrews - 1981
47 Untersuchungen uber das logische Schliessen (context) - Gentzen - 1934
38 The Uniform Proof-theoretic Foundation of Linear Logic Progr.. - Harland, Pym - 1990
22 Wiley and Sons (context) - Kleene - 1968
16 Proof-search in the \Pi-calculus (context) - Pym, Wallen - 1991
11 The permutability of rules in the classical inferential calc.. (context) - Curry - 1952
9 Categorical Topics in Computer Science (context) - Asperti - 1990
5 Computationally Improved Versions of Herbrand's Theorem (context) - Bibel - 1982
1 th Annual IEEE Symposium on Logic in Computer Science (context) - Gehlot, Gunter - 1990
1 Appendix A We present the two-sided linear sequent calculus (context) - Yetter, Quantales et al. - 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