Natural deduction for intuitionistic non-commutative linear logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1581, Issue , 1999, Pages 295-309

  Polakow, Jeff ^a   Pfenning, Frank ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; LINEAR ALGEBRA; PATHOLOGY;

CANONICAL FORM; CONSERVATIVE EXTENSIONS; INTUITIONISTIC LINEAR LOGIC; NATURAL DEDUCTION; NON-COMMUTATIVE LINEAR LOGIC; SUBJECT REDUCTION;

COMPUTER CIRCUITS;

EID: 84949213558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48959-2_21     Document Type: Conference Paper

References (19)

1. V. Michele Abrusci. Non-commutative intuitionistic linear propositional logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 36:297-318, 1990.
2. Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3-57, 1993.
3. Andrew Barber. Linear Type Theories, Semantics and Action Calculi. PhD thesis, Department of Computer Science, University of Edinburgh, 1997.
4. C. Brown and D. Gurr. Relations and non-commutative linear logic. Technical Report DAIMI PB-372, Computer Science Department, Aarhus University, November 1991.
5. Iliano Cervesato and Frank Pfenning. A linear logical framework. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science - LICS’96, pages 264-275, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press. This work also appeared as Preprint 1834 of the Department of Mathematics of Technical University of Darmstadt, Germany.
6. Olivier Danvy. Back to direct style. Science of Computer Programming, 22 (3):183-195, 1994.
7. Olivier Danvy and Frank Pfenning. The occurrence of continuation parameters in CPS terms. Technical Report CMU-CS-95-121, Department of Computer Science, Carnegie Mellon University, February 1995.
8. Neil Ghani. Eta-expansion in dependent type theory - the Calculus of Constructions. In Philippe de Groote and J. Roger Hindley, editors, Proceedings of the 3rd International Conference on Typed Lambda Calculi and Applications (TLCA '97), pages 164-180, Nancy, France, April 1997. Springer-Verlag LNCS 1210.
9. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
10. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40 (1):143-184, January 1993.
11. Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110 (2):327-365, 1994. Extended abstract in the Proceedings of the Sixth Annual Symposium on Logic in Computer Science, Amsterdam, July 15-18, 1991.
12. Joshua S. Hodas. Logic Programming in Intuitionistic Linear Logic: Theory, Design and Implementation. PhD thesis, University of Pennsylvania, Department of Computer and Information Science, 1994.
13. Natasha Kurtonina and Michael Moortgat. Structural control. In P. Blackburn and M. de Rijke, editors, Specifying Syntactic Structures. CSLI Publications, 1996.
14. Joachim Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65:363-386, 1958.
15. Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
16. Remo Pareschi. Type-Driven Natural Language Analysis. PhD thesis, University of Edinburgh, Edinburgh, Scotland, July 1989. Available as technical report MS-CIS-89-45, Department of Computer and Information Sciences, University of Pennsylvania.
17. Jeff Polakow and Frank Pfenning. Ordered linear logic programming. Technical Report CMU-CS-98-183, Department of Computer Science, Carnegie Mellon University, December 1998.
18. Jeff Polakow and Frank Pfenning. Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic. In Andre Scedrov and Achim Jung, editors, Proceedings of the 15th Conference on Mathematical Foundations of Programming Semantics, New Orleans, Louisiana, April 1999. To appear.
19. Paul Ruet. Non-Commutative Logic and Concurrent Constraint Programming. PhD thesis, Universite Denis Diderot, Paris 7, 1997.