A term calculus for Intuitionistic Linear Logic
In this paper we consider the problem of deriving a term assignment system for Girard's Intuitionistic Linear Logic for both the sequent calculus and natural deduction proof systems. Our system differs from previous calculi (e.g. that of Abramsky ) and has two important properties which they lack. These are the substitution property (the set of valid deductions is closed under substitution) and subject reduction (reduction on terms is well-typed). We also consider term reduction arising from cut-elimination in the sequent calculus and normalisation in natural deduction. We explore the relationship between these and consider their computational content.
Unable to display preview. Download preview PDF.
- 1.Samson Abramsky. Computational interpretations of linear logic. Technical Report 90/20, Department of Computing, Imperial College, London, October 1990.Google Scholar
- 2.Nick Benton, Gavin Bierman, Valeria de Paiva, and Martin Hyland. Term assignment for intuitionistic linear logic. Technical Report 262, Computer Laboratory, University of Cambridge, August 1992.Google Scholar
- 3.Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–101, 1987.Google Scholar
- 4.Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.Google Scholar
- 5.Jean-Yves Girard, Andre Scedrov, and Philip Scott. Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science, 97:1–66, 1992.Google Scholar
- 6.Patrick Lincoln and John Mitchell. Operational aspects of linear lambda calculus. In Proceedings of Symposium on Logic in Computer Science, pages 235–246, June 1992.Google Scholar
- 7.Ian Mackie. Lilac: A functional programming language based on linear logic. Master's thesis, Department of Computing, Imperial College, London, September 1991.Google Scholar
- 8.P.W. O'Hearn. Linear logic and interference control (preliminary report). In Proceedings of Conference on Category Theory and Computer Science, volume 530 of Lecture Notes in Computer Science, pages 74–93, September 1991.Google Scholar
- 9.Dag Prawitz. Natural Deduction, volume 3 of Stockholm Studies in Philosophy. Almqvist and Wiksell, 1965.Google Scholar
- 10.Peter Schroeder-Heister. A natural extension of natural deduction. The Journal of Symbolic Logic, 49(4):1284–1300, December 1984.Google Scholar
- 11.M.E. Szabo, editor. The Collected Papers of Gerhard Gentzen. North-Holland, 1969.Google Scholar
- 12.Philip Wadler. There's no substitute for linear logic. Draft Paper, December 1991.Google Scholar