(Enter summary)
Abstract: We reexamine the foundations of linear logic, developing a system of natural
deduction following Martin-Lof's separation of judgments from propositions. Our
construction yields a clean and elegant formulation that accounts for a rich set of multiplicative,
additive, and exponential connectives, extending dual intuitionistic linear logic
but di#ering from both classical linear logic and Hyland and de Paiva's full intuitionistic
linear logic. We also provide a corresponding sequent calculus... (Update)
Cited by: More
Consumable Credentials in Logic-Based Access Control - Bauer, Bowers, Pfenning.. (2006)
(Correct)
Using Constrained Intuitionistic Linear Logic for Hybrid.. - Planning Problems Uluc
(Correct)
The Inverse Method for Intuitionistic Linear Logic (The.. - Chaudhuri (2003)
(Correct)
Similar documents (at the sentence level):
38.7%: A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003)
(Correct)
38.7%: A judgmental analysis of linear logic - Bor-Yuh Evan Chang
(Correct)
Active bibliography (related documents): More All
0.2: A Parigot-style Linear lambda-Calculus for Full.. - de Paiva, Ritter (2003)
(Correct)
0.1: Proof Search Issues In Some Non-Classical Logics - Howe (1998)
(Correct)
0.1: Unknown - Linear Calculus In
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
7: Theoretical Computer Science (context) - Girard - 1987
6: Resource distribution via boolean constraints
- Harland, Pym - 1997
6: Resolution calculus for the first order linear logic (context) - Mints - 1993
BibTeX entry: (Update)
Bor-Yuh Evan Chang, Kaustuv Chaudhuri, and Frank Pfenning. A judgmental analysis of linear logic. Technical Report CMU-CS-03-131, Carnegie Mellon University, 2003. http://citeseer.ist.psu.edu/article/chang03judgmental.html More
@misc{ chang03judgmental,
author = "B. Chang and K. Chaudhuri and F. Pfenning",
title = "A judgmental analysis of linear logic",
text = "Bor-Yuh Evan Chang, Kaustuv Chaudhuri, and Frank Pfenning. A judgmental
analysis of linear logic. Technical Report CMU-CS-03-131, Carnegie Mellon
University, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/chang03judgmental.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard, logic - 1987
257
Logic programming in a fragment of intuitionistic linear log..
- Hodas, Miller - 1994
233
Computational interpretations of linear logic
- Abramsky - 1993
134
calculus: An algorithmic interpretation of classical natural.. (context) - Parigot - 1992
133
Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
104
Annals of Pure and Applied Logic (context) - on, linear - 1996
104
Annals of Pure and Applied Logic (context) - unity, logic - 1993
90
A linear logical framework
- Cervesato, Pfenning - 2002
84
Mathematical Structures in Computer Science (context) - Pfenning, Davies et al. - 2001
77
Dual Intuitionistic Linear Logic (context) - Barber - 1996
73
Untersuchungen uber das logische Schlieen (context) - Gentzen - 1969
70
the meanings of the logical constants and the justifications.. (context) - of - 1983
58
Linear types and non-size increasing polynomial time computa..
- Hofmann - 2000
57
Logic programming with focusing proofs in linear logic (context) - Andreoli - 1992
47
Lilac --- a functional programming language based on linear .. (context) - Mackie - 1993
46
On intuitionistic linear logic (context) - Bierman - 1994
46
Resource logics: proof-theoretical investigations (context) - Roorda - 1991
35
Linear logic and lazy computation (context) - Girard, Lafont - 1987
34
Classically and intuitionistically provably recursive functi.. (context) - Friedman - 1978
33
Relating natural deduction and sequent calculus for intuitio..
- Polakow, Pfenning - 1999
33
The noble art of linear decorating (context) - Schellinx - 1994
30
Games semantics for full propositional linear logic (context) - Lamarche - 1995
29
A syntax for linear logic
- Wadler - 1993
29
Structural cut elimination in linear logic
- Pfenning - 1994
25
Full intuitionistic linear logic (context) - Hyland, de Paiva - 1993
24
the intuitionistic force of classical search
- Ritter, Pym et al. - 2000
21
A syntactical analysis of non-sizeincreasing polynomial time..
- Aehlig, Schwichtenberg - 2001
18
Proof theory for full intuitionistic linear logic
- Robin, Cockett et al. - 1997
18
Proof search issues in some non-classical logics
- Howe - 1998
12
Higher-Order and Symbolic Computation (context) - Berdine, O'Hearn et al. - 2002
12
Center for the Study of Language and Information (context) - Troelstra, linear et al. - 1992
10
Information and Computation (context) - elimination, intuitionistic et al. - 2000
8
Department of Computer Science (context) - Polakow, logic et al. - 2001
8
A formulation of linear logic based on dependency-relations
- uner, de Paiva - 1997
8
Normal natural deduction proofs (context) - Sieg, Byrnes - 1998
7
Modal translations in substructural logics (context) - sen - 1992
6
Personal communication (context) - de Paiva - 2003
6
Journal of Philosophical Logic (context) - linear - 2002
6
A normalizing system of natural deduction for intuitionistic.. (context) - Negri - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004)
(Correct)
Compiler Verification in LF - Hannan, Pfenning (1992)
(Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002)
(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