Operational interpretations of linear logic

Theoretical Computer Science

Volumn 227, Issue 1-2, 1999, Pages 231-248

  Turner, David N ^a   Wadler, Philip ^b  

^a An Teallach Limited   (United Kingdom)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Call by value lambda calculus; Linear logic; Memory management; Operational semantics

Indexed keywords

EID: 0011918338     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00054-7     Document Type: Article

References (22)

1. S. Abramsky, Computational interpretations of linear logic, Theoret. Comput. Sci. 1992.
2. P. Achten, R. Plasmeijer, The ins and outs of clean i/o, J. Functional Programming 5(1) (1995) 81-110.
3. L. Augustsson, Compiling lazy functional languagess, Part II, Ph.D. thesis, Chalmers University of Technology, 1987.
4. H.G. Baker, Lively linear Lisp-'Look Ma, no garbage!', ACM Sigplan Notices 27(8) (1992) 89-98.
5. H.G. Baker, A 'linear logic' quicksort. ACM Sigplan Notices 29(2) (1994) 13-18.
6. N. Benton, G. Bierman, V. de Paiva, M. Hyland, A term calculus for intuitionstic linear logic, in: Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993.
7. N. Benton, A mixed linear and non-linear logic: Proofs, terms and models, in: Proc. Computer Science Logic '94, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995.
8. E. Barendsen, S. Smetsers, Conventional and uniqueness typing in graph rewrite systems, in: Proc. 13th Conf. on the Foundations of Software Techology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 761, Springer, Berlin, 1993. (Technical report version.)
9. N. Benton, P. Wadler, Linear logic, monads, and the lambda calculus, in: Symp. on Logic in Computer Science, IEEE Computer Society, 1996.
10. J. Chirimar, C.A. Gunter, J.G. Riecke, Proving memory management invariants for a language based on linear logic, in: ACM Conf. on Lisp and Functional Programming, ACM, New York, 1992.
11. J. Chirimar, C.A. Gunter, J.G. Riecke, Reference counting as a computational interpretation of linear logic, J. Functional Programming 6(2) (1995) 195-244.
12. T. Johnsson, Compiling lazy functional languages, Ph.D. thesis, Chalmers University of Technology, 1987.
13. Y. Lafont, The linear abstract machine, Theoret. Comput. Sci. 59 (1988).
14. J. Launchbury, A natural semantics for lazy evaluation, in: ACM Symp. on Principles of Programming Languages, 1993.
15. P. Lincoln, J. Mitchell, Operational aspects of linear lambda calculus, in: IEEE Symp. on Logic in Computer Science, IEEE Computer Society, 1992.
16. G. Morrisett, M. Felleisen, R. Harper, Abstract models of memory management, in: Functional Programming Languages and Computer Architecture, 1995.
17. J. Maraist, M. Odersky, D.N. Turner, P. Wadler, Call-by-name, call-by-value, call-by-need, and the linear lambda-calculus, in: 11th Conf. on the Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, vol. 1, Elsevier, Amsterdam, 1995.
18. G. Plotkin, Type theory and recursion (abstract), in: Logic in Computer Science, IEEE Press, New York, 1993.
19. P. Wadler, Linear types can change the world!, in: M. Broy, C.B. Jones (Eds.), Programming Concepts and Methods, North-Holland, Amsterdam, 1990.
20. P. Wadler, Is there a use for linear logic? in: ACM/IFIP Symp. on Partial Evaluation and Semantics Based Program Manipulation, June 1991.
21. P. Wadler, A taste of linear logic, in: Mathematic Foundations of Computing Science, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, August 1993.
22. D. Wakeling, C. Runciman, Linearity and laziness, in: Functional Programming Languages and Computer Architecture, 1991.