Studying the fully abstract model of PCF within its continuous function model

  • Achim Jung
  • Allen Stoughton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 664)


We give a concrete presentation of the inequationally fully abstract model of PCF as a continuous projection of the inductively reachable subalgebra of PCF's continuous function model.


Abstract Model Logical Relation Continuous Homomorphism Extended Language Lambda Calculus 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Abr90]
    S. Abramsky. The lazy lambda calculus. In D. L. Turner, editor, Research Topics in Functional Programming, pages 65–116. Addison-Wesley, 1990.Google Scholar
  2. [BCL85]
    G. Berry, P.-L. Curien and J.-J. Lévy. Full abstraction for sequential languages: the state of the art. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, pages 89–132. Cambridge University Press, 1985.Google Scholar
  3. [Cur86]
    P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science. Pitman/Wiley, 1986.Google Scholar
  4. [JT93]
    A. Jung and J. Tiuryn. A new characterization of lambda definability. In this proceedings, 1993.Google Scholar
  5. [Mil77]
    R. Milner. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4:1–22, 1977.Google Scholar
  6. [Mul87]
    K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.Google Scholar
  7. [Plo77]
    G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223–256, 1977.Google Scholar
  8. [Plo80]
    G.D. Plotkin. Lambda-definability in the full type hierarchy. In J. Seldin and J. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363–374. Academic Press, 1980.Google Scholar
  9. [Sie92]
    K. Sieber. Reasoning about sequential functions via logical relations. In M. P. Fourman, P. T. Johnstone and A. M. Pitts, editors, Applications of Categories in Computer Science, volume 177 of LMS Lecture Note Series, pages 258–269. Cambridge University Press, 1992.Google Scholar
  10. [Sta82]
    R. Statman. Completeness, invariance and λ-definability. Journal of Symbolic Logic, 47:17–26, 1982.Google Scholar
  11. [Sto88]
    A. Stoughton. Fully Abstract Models of Programming Languages. Research Notes in Theoretical Computer Science. Pitman/Wiley, 1988.Google Scholar
  12. [Sto90]
    A. Stoughton. Equationally fully abstract models of PCF. In M. Main, A. Melton, M. Mislove and D. Schmidt, editors, Fifth International Conference on the Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science, pages 271–283. Springer-Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Achim Jung
    • 1
  • Allen Stoughton
    • 2
  1. 1.Technische Hochschule DarmstadtFachbereich MathematikDarmstadtGermany
  2. 2.School of Cognitive and Computing SciencesUniversity of SussexFalmerUK

Personalised recommendations