Some results on the full abstraction problem for restricted lambda calculi

  • Furio Honsell
  • Marina Lenisa
Invited Lectures

DOI: 10.1007/3-540-57182-5_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 711)
Cite this paper as:
Honsell F., Lenisa M. (1993) Some results on the full abstraction problem for restricted lambda calculi. In: Borzyszkowski A.M., Sokołowski S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg

Abstract

Issues in the mathematical semantics of two restrictions of the λ-calculus, i.e. λI-calculus and λv-calculus, are discussed. A fully abstract model for the natural evaluation of the former is defined using complete partial orders and strict Scott-continuous functions. A correct, albeit non-fully abstract, model for the SECD evaluation of the latter is denned using Girard's coherence spaces and stable functions. These results are used to illustrate the interest of the analysis of the fine structure of mathematical models of programming languages.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Furio Honsell
    • 1
  • Marina Lenisa
    • 1
  1. 1.Dipartimento di Matematica e InformaticaUniversità di UdineItaly

Personalised recommendations