Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1991: Mathematical Foundations of Computer Science 1991 pp 161–169Cite as

The lazy call-by-value λ-calculus

  • Contributions
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky S. The lazy lambda calculus, in: D. Turner (ed.) Declarative programming, Addison-Wesley, 1988.

    Google Scholar 

  2. Barendregt H., Coppo M., Dezani M. A filter lambda model and the completeness of type assignment, The J. of Symbolic Logic, 48, no. 4, 1983, 931–940.

    Google Scholar 

  3. Honsell F., Ronchi Della Rocca S. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus, J. of Computer and System Sciences, to appear.

    Google Scholar 

  4. Hyland M. A syntactic characterization of the equality in some models for the lambda calculus, J. of the London Mathematical Society (2), 12, 1976, 361–370.

    Google Scholar 

  5. Landin P.J. The mechanical evaluation of expressions, Computer J. 6, no. 4, 1964, p. 308–320.

    Google Scholar 

  6. Mulmuley K. Fully abstract submodels of typed lambda calculus, J. of Computer and System Sciences, 33, 1986, 2–46.

    Google Scholar 

  7. Ong C.-H. L. The lazy lambda calculus: an investigation into the foundations of functional programming, Ph.D. thesis, Imperial College of Science and Technology, University of London, 1988.

    Google Scholar 

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

    Google Scholar 

  9. Plotkin G.D. LCF, considered as a Programming Language, Theoretical Computer Science, 5, 1977, 223–255.

    Google Scholar 

  10. Plotkin G.D. Personal communication.

    Google Scholar 

  11. Wadsworth C.P. The relation between computational and denotational properties for Scott's D ∞-models of the λ-calculus, SIAM J. of Computing, 5, no.3, 1976, 488.

    Google Scholar 

  12. Boudol G. Lambda-Calculi for (strict) Parallel Functions, INRIA preprint 1991.

    Google Scholar 

  13. Pino-Perez R. A Strict partial combinatory algebra which modelizes Partial Lambda Calculus, preprint 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Torino, Italy

    Lavinia Egidi & Simona Ronchi della Rocca

  2. Dipartimento di Matematica e Informatica, Università degli Studi di Udine, Italy

    Furio Honsell

Authors
  1. Lavinia Egidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Furio Honsell
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Simona Ronchi della Rocca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Egidi, L., Honsell, F., Ronchi della Rocca, S. (1991). The lazy call-by-value λ-calculus. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation