Skip to main content
SpringerLink
Log in

Natural Deduction for Intuitionistic Non-commutative Linear Logic

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1581))

Included in the following conference series:

Abstract

We present a system of natural deduction and associated term calculus for intuitionistic non-commutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We prove subject reduction and the existence of canonical forms in the implicational fragment.

Partially supported by the National Science Foundation under grant CCR-9804014.

Partially supported by the National Science Foundation under grant CCR-9619584.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Michele Abrusci. Non-commutative intuitionistic linear propositional logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 36:297–318, 1990.

    Article  MATH  Google Scholar 

  2. Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3–57, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  3. Andrew Barber. Linear Type Theories, Semantics and Action Calculi. PhD thesis, Department of Computer Science, University of Edinburgh, 1997.

    Google Scholar 

  4. C. Brown and D. Gurr. Relations and non-commutative linear logic. Technical Report DAIMI PB-372, Computer Science Department, Aarhus University, November 1991.

    Google Scholar 

  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.

    Google Scholar 

  6. Olivier Danvy. Back to direct style. Science of Computer Programming, 22(3):183–195, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  9. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  13. Natasha Kurtonina and Michael Moortgat. Structural control. In P. Blackburn and M. de Rijke, editors, Specifying Syntactic Structures. CSLI Publications, 1996.

    Google Scholar 

  14. Joachim Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65:363–386, 1958.

    Article  Google Scholar 

  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.

    Article  MathSciNet  MATH  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  19. Paul Ruet. Non-Commutative Logic and Concurrent Constraint Programming. PhD thesis, Université Denis Diderot, Paris 7, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Jeff Polakow & Frank Pfenning

Authors
  1. Jeff Polakow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Pfenning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS - UPR9016, Institut de Mathématiques de Luminy, 163 Avenue de Luminy, case 907, F-13288, Marseille cedex 9, France

    Jean-Yves Girard

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polakow, J., Pfenning, F. (1999). Natural Deduction for Intuitionistic Non-commutative Linear Logic. In: Girard, JY. (eds) Typed Lambda Calculi and Applications. TLCA 1999. Lecture Notes in Computer Science, vol 1581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48959-2_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-48959-2_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65763-7

  • Online ISBN: 978-3-540-48959-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation