A classical linear λ-calculus

Theoretical Computer Science

Volumn 227, Issue 1-2, 1999, Pages 43-78

  Bierman, G M ^a  

^a GONVILLE AND CAIUS COLLEGE   (United Kingdom)

Author keywords

Linear logic; Proof theory; Type systems; calculus

Indexed keywords

EID: 0011976746     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00048-1     Document Type: Article

References (40)

1. S. Abramsky, Computational interpretations of linear logic, Theoret. Comput. Sci. 111(1-2) (1993) 3-57. Previously Available as Department of Computing, Imperial College Technical Report 90/20, 1990.
2. S. Abramsky, Computational interpretations of linear logic, Theoret. Comput. Sci. 111(1-2) (1993) 3-57. Previously Available as Department of Computing, Imperial College Technical Report 90/20, 1990.
3. S. Abramsky, R. Jagadeesan, P. Malacaria, Full abstraction for PCF (Extended Abstract), Proc. Conf. on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, vol. 789, 1994, pp. 1-5.
4. D. Albrecht, J.N. Crossley, J.S. Jeavons, New Curry-Howard terms for full linear logic, unpublished Manuscript, May 1996.
5. M. Barr, (Black star)-autonomous categories and linear logic, Math. Struct. Comput. Sci. 1 (1991) 159-178.
6. P.N. Benton, A mixed linear and non-linear logic: proofs, terms and models, Technical Report 352, Computer Laboratory, University of Cambridge, 1994.
7. P.N. Benton, Strong normalisation for the linear term calculus, J. Funct. Programming 5(1) (1995) 65-80.
8. P.N. Benton, G.M. Bierman, V.C.V. de Paiva, J.M.E. Hyland, Term assignment for intuitionistic linear logic, Technical Report 262, Computer Laboratory, University of Cambridge, August 1992.
9. P.N. Benton, G.M. Bierman, V.C.V. de Paiva, J.M.E. Hyland, A term calculus for intuitionistic linear logic, in: M. Bezem, J.F. Groote (Eds.), Proc. Ist Int. Conf. on Typed λ-calculi and applications, Lecture Notes in Computer Science, vol. 664, 1993, pp. 75-90.
10. P.N. Benton, P. Wadler, Linear logic, monads and the lambda calculus, Proc. Symp. on Logic in Computer Science, 1996, pp. 420-431.
11. G.M. Bierman, On intuitionistic linear logic, Ph.D. Thesis, Computer Laboratory, University of Cambridge, December 1993. Published as Computer Laboratory Technical Report 346, August 1994.
12. G.M. Bierman, On intuitionistic linear logic, Ph.D. Thesis, Computer Laboratory, University of Cambridge, December 1993. Published as Computer Laboratory Technical Report 346, August 1994.
13. G.M. Bierman, What is a categorical model of intuitionistic linear logic?, Proc. 2nd Int. Conf. on Typed λ-calculi and applications, vol. 902 of Lecture Notes in Computer Science, April 1995, pp. 78-93. Previously available as Technical Report 333, University of Cambridge Computer Laboratory, March 1994.
14. G.M. Bierman, What is a categorical model of intuitionistic linear logic?, Proc. 2nd Int. Conf. on Typed λ-calculi and applications, vol. 902 of Lecture Notes in Computer Science, April 1995, pp. 78-93. Previously available as Technical Report 333, University of Cambridge Computer Laboratory, March 1994.
15. G.M. Bierman, A classical linear λ-calculus, Technical Report 401, Computer Laboratory, University of Cambridge, July 1996.
16. G.M. Bierman, Towards a classical linear λ-calculus, Proc. Tokyo Conf. on Linear Logic, Electronic Notes in Computer Science, vol. 3, Elsevier, Amsterdam, 1996.
17. G.M. Bierman, Observations on a linear PCF, Technical Report 412, Computer Laboratory, University of Cambridge, January 1997.
18. G.M. Bierman, A computational interpretation of the λμ-calculus, in: L. Brim, J. Gruska, J. Zlatuška (Eds.), Proc. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 1450, August 1998, pp. 336-345.
19. G.M. Bierman, V.C.V. de Paiva, Intuitionistic necessity revisited, Technical Report CSR-96-10, School of Computer Science, University of Birmingham, June 1996.
20. A. Blass, A game semantics for linear logic, Ann. Pure Appl. Logic 56 (1992) 183-220.
21. B.R. Boričić, On sequence-conclusion natural deduction systems, J. Philos. Logic 14 (1985) 359-377.
22. C. Cellucci, Existential instantiation and normalization in sequent natural deduction, Ann. Pure Appl. Logic 58(2) (1992) 111-148.
23. Th. Coquand, A semantics of evidence of classical arithmetic, J. Symbolic Logic 60 (1995) 325-337.
24. G. Gentzen, Investigations into logical deduction, in: M.E. Szabo (Eds.), The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, 1969, pp. 68-131. English Translation of 1935 German original.
25. J.-Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987) 1-101.
26. J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, Cambridge, 1989.
27. T.G. Griffin, A formulae-as-types notion of control, Proc. Symp. on Principles of Programming Languages, 1990, pp. 47-58.
28. W.A. Howard, The formulae-as-types notion of construction, in: J.R. Hindley, J.P. Seldin (Eds.), To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and formalism, Academic Press, New York, 1980.
29. J.M.E. Hyland, C.-H.L. Ong, Pi-calculus, dialogue games and PCF, Proc. Conf. on Functional Programming Languages and Computer Architecture, 1995, pp. 96-107.
30. P. Lincoln, Linear logic, ACM SIGACT News 23(2) (1992) 29-37.
31. S. Martini, A. Masini, Experiments in linear natural deduction, unpublished Manuscript, March 1995.
32. C.-H.L. Ong, A semantic view of classical proofs: type-theoretic, categorical and denotational characterizations, Proc. Symp. on Logic in Computer Science, 1996, pp. 230-241.
33. M. Parigot, λμ-calculus: an algorithmic interpretation of classical natural deduction, Proc. Conf. on Logic Programming and Automated Reasoning, Lecture Notes in Computer Science, vol. 624, 1992, pp. 190-201.
34. M. Parigot, Strong normalisation for second order classical natural deduction, Proc. Symp. on Logic in Computer Science, 1993, pp. 39-46.
35. D. Prawitz, Natural Deduction, volume 3 of Stockholm Studies in Philosophy, Almqvist and Wiksell, Stockholm, 1965.
36. D. Prawitz, Ideas and results in proof theory, in: J.E. Fenstad (Ed.), Proc. 2nd Scandinavian Logic Symp., 1971, 235-307.
37. H. Schellinx, The noble art of linear decorating, Ph.D. Thesis, University of Amsterdam, February 1994.
38. D.J. Shoesmith, T.J. Smiley, Multiple-conclusion logic, Cambridge University Press, Cambridge, 1978.
39. A.S. Troelstra, Lectures on Linear Logic, Lecture Notes, vol. 29, CSLI, 1992.
40. C. Urban, Ph.D. Thesis, 199x.