Skip to main content
SpringerLink
Log in

Categorical semantics of the call-by-value λ-calculus

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 902))

Included in the following conference series:

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”

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Asperti and G. Longo. Categories, Types and Structures. Foundations of Computing. The MIT Press, 1991.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. J.Y. Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45:159–192, 1986.

    Article  Google Scholar 

  6. J.Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. 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.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. C.P.J. Koymans. Models of the lambda calculus. Information and Control, 52(3):306–332, 1982.

    Article  Google Scholar 

  12. Y. Lafont. Introduction to linear logic. Lecture notes for the Summer School on Constructive logic and Category theory (Isle of Thorns), August 1988.

    Google Scholar 

  13. P.J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4), 1964.

    Google Scholar 

  14. G. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125–159, 1975.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli studi di Torino, C.so Svizzera 185, 10149, Torino

    A. Pravato & S. Ronchi della Rocca

  2. Dipartimento di Informatica, Università degli studi di Pisa, C.so Italia 40, 56125, Pisa

    L. Roversi

Authors
  1. A. Pravato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Ronchi della Rocca
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Roversi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mariangiola Dezani-Ciancaglini Gordon Plotkin

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation