Skip to main content
SpringerLink
Log in

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

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

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

Included in the following conference series:

Abstract

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.

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. 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. 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. P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science. Pitman/Wiley, 1986.

    Google Scholar 

  4. A. Jung and J. Tiuryn. A new characterization of lambda definability. In this proceedings, 1993.

    Google Scholar 

  5. R. Milner. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4:1–22, 1977.

    Google Scholar 

  6. K. Mulmuley. Full Abstraction and Semantic Equivalence. MIT Press, 1987.

    Google Scholar 

  7. G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223–256, 1977.

    Google Scholar 

  8. 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. 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. R. Statman. Completeness, invariance and λ-definability. Journal of Symbolic Logic, 47:17–26, 1982.

    Google Scholar 

  11. A. Stoughton. Fully Abstract Models of Programming Languages. Research Notes in Theoretical Computer Science. Pitman/Wiley, 1988.

    Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Technische Hochschule Darmstadt, Fachbereich Mathematik, Schloßgartenstraße 7, D-6100, Darmstadt, Germany

    Achim Jung

  2. School of Cognitive and Computing Sciences, University of Sussex, BN1 9QH, Falmer, Brighton, UK

    Allen Stoughton

Authors
  1. Achim Jung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Allen Stoughton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marc Bezem Jan Friso Groote

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jung, A., Stoughton, A. (1993). Studying the fully abstract model of PCF within its continuous function model. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037109

Download citation

  • DOI: https://doi.org/10.1007/BFb0037109

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56517-8

  • Online ISBN: 978-3-540-47586-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation