The lazy call-by-value λ-calculus

  • Lavinia Egidi
  • Furio Honsell
  • Simona Ronchi della Rocca
Contributions
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 520)

Keywords

Abstract Model Operational Semantic Approximation Theorem Canonical Model Congruence Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abramsky S. The lazy lambda calculus, in: D. Turner (ed.) Declarative programming, Addison-Wesley, 1988.Google Scholar
  2. 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. 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. 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. 5.
    Landin P.J. The mechanical evaluation of expressions, Computer J. 6, no. 4, 1964, p. 308–320.Google Scholar
  6. 6.
    Mulmuley K. Fully abstract submodels of typed lambda calculus, J. of Computer and System Sciences, 33, 1986, 2–46.Google Scholar
  7. 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. 8.
    Plotkin G.D. Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science, 1, 1975, 125–159.Google Scholar
  9. 9.
    Plotkin G.D. LCF, considered as a Programming Language, Theoretical Computer Science, 5, 1977, 223–255.Google Scholar
  10. 10.
    Plotkin G.D. Personal communication.Google Scholar
  11. 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. 12.
    Boudol G. Lambda-Calculi for (strict) Parallel Functions, INRIA preprint 1991.Google Scholar
  13. 13.
    Pino-Perez R. A Strict partial combinatory algebra which modelizes Partial Lambda Calculus, preprint 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Lavinia Egidi
    • 1
  • Furio Honsell
    • 2
  • Simona Ronchi della Rocca
    • 1
  1. 1.Dipartimento di InformaticaUniversità degli Studi di TorinoItaly
  2. 2.Dipartimento di Matematica e InformaticaUniversità degli Studi di UdineItaly

Personalised recommendations