• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A Judgmental Analysis of Linear Logic (2003)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www-2.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.lix.polytechnique.fr]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu.]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Bor-Yuh Evan Chang , Kaustuv Chaudhuri , Frank Pfenning
Citations:40 - 24 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Chang03ajudgmental,
    author = {Bor-Yuh Evan Chang and Kaustuv Chaudhuri and Frank Pfenning},
    title = {A Judgmental Analysis of Linear Logic},
    year = {2003}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-L of'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 differing from both classical linear logic and Hyland and de Paiva's full intuitionistic linear logic. We also provide a corresponding sequent calculus that admits a simple proof of the admissibility of cut by a single structural induction. Finally, we show how to interpret classical linear logic (with or without the MIX rule) in our system, employing a form of double-negation translation.

Citations

541 Linear Logic - Girard - 1987
493 Untersuchungen über das logische Schließen - Gentzen - 1935
290 Logic programming with focusing proofs in linear logic - Andreoli - 1992
283 Logic Programming in a Fragment of Intuitionistic Linear Logic - Hodas, Miller - 1994
272 Computational interpretations of linear logic - Abramsky - 1993
270 Λµ-calculus: an algorithmic interpretation of classical natural deduction - Parigot - 1992
203 A Linear Logical Framework - CERVESATO, PFENNING - 2002
143 R.: A Judgmental Reconstruction of Modal Logic - Pfenning, Davies
117 On the meanings of the logical constants and the justifications of the logical laws - Martin-Löf - 1996
79 Dual intuitionistic linear logic - Barber - 1996
75 A taste of linear logic - Wadler - 1993
56 Classically and intuitionistically provably recursive functions - Friedman - 1978
56 Resource Logics: Proof-theoretical Investigations - Roorda - 1991
47 Structural cut elimination I. Intuitionistic and classical logic - Pfenning
44 LiLac: a functional programming language based on Linear Logic - Mackie - 1993
39 On Intuitionistic Linear Logic - Bierman - 1993
36 Structural cut elimination in linear logic - Pfenning - 1994
35 Abramsky and Radha Jagadeesan. Games and full completeness for multiplicative linear logic - Samson - 1994
34 Linear logic,” Theoret - Girard - 1987
33 Ordered Linear Logic and Applications - Polakow - 2001
31 Proof Search Issues in Some Non-Classical Logics - Howe - 1998
27 The Noble Art of Linear Decorating - Schellinx - 1994
26 Games semantics for full propositional linear logic - Lamarche - 1995
25 Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic - Polakow, Pfenning - 1999
21 Proof theory for full intuitionistic linear logic, bilinear logic, and mix categories, Theory Appl. Categ. 3 - Cockett, Seely - 1997
19 On the intuitionistic force of classical search - Ritter, Pym, et al.
14 Normal natural deduction proofs (in classical logic - Sieg, Byrnes - 1998
13 Linear types and non-size increasing polynomial time computation - Hofmann - 2000
13 A note on full intuitionistic linear logic - Bierman - 1996
13 Full intuitionistic linear logic (extended abstract - Hyland, Paiva - 1993
12 Aehlig and Helmut Schwichtenberg. A syntactical analysis of non-size-increasing polynomial time computation. Submitted, 2001. A previous version presented at LICS’00 - Klaus
11 Abramsky. Computational interpretations of linear logic - Samson - 1993
7 Proofs and types, Cambridge Tracts in Theoretical - Girard, Lafont, et al. - 1989
7 Modal Translations in Substructural Logics - Dosen - 1992
6 and Valeria de Paiva. Full intuitionistic linear logic (extended abstract - Hyland - 1993
5 A normalizing system of natural deduction for intuitionistic linear logic - Negri - 2000
4 On the meanings of the logical constants and the justifications of the logical laws - of - 1982
3 Modal translations in substructural logics - Doˇsen - 1992
3 Sjerp Troelstra, Lectures on linear logic - Anne - 1992
2 Linear logic and lazy computation, Proceedings of the international joint conference on theory and practice of software development - Girard, Lafont - 1987
2 of linear calculi - Varieties
2 cut elimination I. intuitionistic and classical logic - Structural
2 A syntax for linear logic, Proceedings of the ninth conference on mathematical foundations of programming semantics - Wadler - 1993
2 Modal translations in substructural logics - sen - 1992
2 Hayo Thielecke. Linear continuation-passing - Berdine, O'Hearn, et al. - 2002
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University