Abstract
The denotational semantics of the call-by-value λ-calculus in a categorical setting is given. Furthermore, a particular model based on coherence domains is studied.
Work partially supported by the HCM project CHRX-CT92-0046 “Typed λ-calculus”
Preview
Unable to display preview. Download preview PDF.
References
A. Asperti and G. Longo. Categories, Types and Structures. Foundations of Computing. The MIT Press, 1991.
N. Benton, G. Bierman, V. de Paiva, and M. Hyland. Term assignment for intuitionistic linear logic. Technical Report 262, Computer Laboratory, University of Cambridge, August 1990.
M. Dezani-Ciancaglini, F. Honsell, and S. Ronchi della Rocca. Models for theories for functions strictly depending on all their arguments (abstract). The Journal of Symbolic Logic, 51(3):845–846, 1986.
L. Egidi, F. Honsell, and S. Ronchi della Rocca. Operational, denotational and logical descriptions: a case study. Fundamenta Informaticae, 16 (2): 149–169, February 1992.
J.Y. Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45:159–192, 1986.
J.Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
G. Gonthier, M. Abadi, and J.J. Lévy. The geometry of optimal lambda reductions. In Proc. 19th Symp. on Principles of Programming Languages (POPL 92), 1992.
R. Hindley and G. Longo. To H.B. Curry: Essay on Combinatory Logic, Lambda Calculus and Formalisms, chapter Lambda-calculus models. J.R. Hindley, J.P. Seldin editors, Academic Press, 1980.
F. Honsell and M. Lenisa. Some results on the full-abstraction problem for restricted λ-calculi. In LNCS 711: Proceedings of 18th. Symposium on MFCS'93 (Poland), pages 84–104. Springer-Verlag, 1993.
F. Honsell and S. Ronchi della Rocca. Reasoning about interpretations in qualitative lambda models, pages 505–522. M. Broy and C.B. Jones editors, North-Holland, 1990.
C.P.J. Koymans. Models of the lambda calculus. Information and Control, 52(3):306–332, 1982.
Y. Lafont. Introduction to linear logic. Lecture notes for the Summer School on Constructive logic and Category theory (Isle of Thorns), August 1988.
P.J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4), 1964.
G. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125–159, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pravato, A., della Rocca, S.R., Roversi, L. (1995). Categorical semantics of the call-by-value λ-calculus. In: Dezani-Ciancaglini, M., Plotkin, G. (eds) Typed Lambda Calculi and Applications. TLCA 1995. Lecture Notes in Computer Science, vol 902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014066
Download citation
DOI: https://doi.org/10.1007/BFb0014066
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59048-4
Online ISBN: 978-3-540-49178-1
eBook Packages: Springer Book Archive