The call-by-value calculus: A semantic investigation

Mathematical Structures in Computer Science

Volumn 9, Issue 5, 1999, Pages 617-650

  Pravatc, Alberto ^a   Roversi, Luca ^b   della Rocca, Simona Ronchi ^c  

^a UNIVERSITY OF TURIN   (Italy)

^b AIX MARSEILLE UNIVERSITÉ   (France)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84962842068     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0960129598002722     Document Type: Article

References (18)

1. Asperti, A. and Longo, G. (1991) Categories, Types and Structures, Foundations of Computing, The MIT Press.
2. Benton, N., Bierman, G., de Paiva, V. and Hyland, M. (1990) Term assignment for intuitionistic linear logic. Technical Report 262, Computer Laboratory, University of Cambridge.
3. Benton, N. and Wadler, P. (1996) Linear logic, monads and the lambda calculus. In: Proceedings of Symposium on Logic in Computer Science (LICS’96).
4. Benton, P. (1995) A mixed linear and non-linear logic: Proofs, terms and models. In: Proceedings of Computer Science Logic 1994 (CSL’94), Kazimierz, Poland. Springer-Verlag Lecture Notes in Computer Science 933 121–135.
5. Dezani-Ciancaglini, M., Honsell, F. and Ronchi della Rocca, S. (1986) Models for theories for functions strictly depending on all their arguments (abstract). The Journal of Symbolic Logic 51 (3) 845–846.
6. Egidi, L., Honsell, F. and Ronchi della Rocca, S. (1992) Operational, denotational and logical descriptions: a case study. Fundamenta Informaticae 16 (2) 149–169.
7. Girard, J. (1987) Linear logic. Theoretical Computer Science 50 1–102.
8. Gonthier, G., Abadi, M. and Levy, J. (1992) The geometry of optimal lambda reductions. In: Proceedings of the 19th Symposium on Principles of Programming Languages (POPL’92) 15–26.
9. Hindley, R. and Longo, G. (1980) Lambda-calculus models. In: Hindley, J. R. and Seldin, J.P. (eds.) To H.B. Curry: Essay on Combinatory Logic, Lambda Calculus and Formalisms, Academic press.
10. Honsell, F. and Lenisa, M. (1993) Some results on the full-abstraction problem for restricted 2,-calculi. In: Proceedings of 18th Symposium on Mathematical Foundations of Computer Science, Poland (MFCS’93). Springer-Verlag Lecture Notes in Computer Science 711 84–104.
11. Koymans, C. (1982) Models of the lambda calculus. Information and Control 52 (3) 306–332.
12. Landin, P. (1964) The mechanical evaluation of expressions. Computer Journal 6 (4) 308–320.
13. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag.
14. Moggi, E. (1991) Notions of computations and monads. Information and Computation 93 (1) 55–92.
15. Plotkin, G. (1975) Call-by-name, call-by-value and the 2-calculus. Theoretical Computer Science 1 125–159.
16. Pravato, A., Ronchi della Rocca, S. and Roversi, L. (1995) Categorical semantics of the call-by-value lambda calculus. In: Typed Lambda Calculi and Applications, Edinburgh (TLCA’95). Springer-Verlag Lecture Notes in Computer Science 902 381–396.
17. Ronchi della Rocca, S. and Roversi, L. (1997) Lambda calculus and intuitionistic linear logic. Studia Logica 57 417–448.
18. Scott, D. (1975) Some philosophical issues concerning theories of combinators. Springer-Verlag Lecture Notes in Computer Science 37 346–366.