Lambda calculus and intuitionistic linear logic

Studia Logica

Volumn 59, Issue 3, 1997, Pages 417-448

  Rocca, Simona Ronchi della ^a   Roversi, Luca ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Curry Howard isomorphism; Linear logic; Typed calculi

Indexed keywords

EID: 21744450077     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1005092630115     Document Type: Article

References (23)

1. S. Abramsky, 1990, Computational interpretation of linear logic, Technical Report 90/92, Department of Computing, Imperial College, London.
2. S. Abramsky and R. Jagadeesan, 1992, Games and full completeness for multiplicative linear logic, Technical Report 92/24, Department of Computing, Imperial College, London, September.
3. H.P. Barendregt, 1984, The Lambda Calculus, North-Holland, second edition.
4. N. Benton, G. Bierman, V. de Paiva, and M. Hyland, 1990, Term assignment for intuitionistic linear logic. Technical Report 262, Computer Laboratory, University of Cambridge, August.
5. V. Breazu-Tannen, D. Kesner, and L. Puel, 1993, A typed pattern calculus, In Proceedings of the 8th Symposium on Logic in Computer Science LICS'93 (Montreal), pages 262-274, June.
6. J. Gallier, 1990, Logic and Computer Science, chapter On Girard's \candidats de reductibilites", pages 123-203, P. Odifreddi editor, Academic Press.
7. J. Gallier, 1993, On the correspondence between proofs and lambda terms, Obtained by ftp, January.
8. J.Y. Girard, 1972, Interpretation Fonctionelle et Elimination des Coupures de l'Arithmetique d'Ordre Superieur, PhD thesis, Universite Paris VII.
9. J.Y. Girard, 1987, Linear logic Theoretical Computer Science, 50:1-102.
10. J.Y. Girard, Y. Lafont, and P. Taylor, 1989, Proofs and Types, Cambridge University Press.
11. G. Huet, 1980, Conuent reductions: abstract properties and applications to term rewriting systems, Journal of A.C.M., 27:797-821.
12. B. Jacobs, 1992, Semantics of weakening and contraction, In Typed Lambda Calculi and Applications TLCA'92, volume LNCS. Springer-Verlag.
13. Y. Lafont, 1988, The linear abstract machine, Theoretical Computer Science, 59:157 { 180.
14. P. Lincoln and J. Mitchell, 1992, Operational aspects of linear lambda calculus, In Proceedings of Symposium on Logic in Computer Science LICS'92, pages 235-246, June.
15. Simone Martini and Andrea Masini, 1993, On the structure of the exponential rule. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 197-210. Cambridge University Press, 1995. Proceedings of the Workshop on Linear Logic, Ithaca, New York, June.
16. G. Mints, Normal deductions in the intuitionistic linear logic. To appear in Archive for Mathematical Logic.
17. A. Pravato and L. Roversi, 1995, Considered both as a paradigmatic language and as a meta-language, In Theoretical Computer Science: Proceedings of the Fifth Italian Conference (Salerno), pages 146-161. World Scientific, November.
18. D. Prawitz, 1965, Natural Deduction, a Proof Theoretic Study, Almquist and Wiksell-Amsterdam.
19. J.A. Reynolds, 1974, Paris Colloquium on Programming, chapter Towards a Theory of Type Structures, pages 408-425. Springer-Verlag.
20. S. Ronchi della Rocca and L. Roversi 1994, Lambda calculus and intuitionistic linear logic, Invited talk at the Logic Colloquium'94 (Clermont-Ferrand), July.
21. L. Roversi, 1996, Curry-Howard isomorphism and intuitionistic linear logic, Technical Report 19/96, Universita degli Studi di Torino.
22. A.S. Troelstra, 1992, Lectures on Linear Logic, CSLI.
23. P. Wadler, 1993 A syntax for linear logic, Presented at the Mathematical Foundations of Programming Semantics, New Orleans, April.