Skip to main content
Springer Nature Link
Log in

Equationally fully abstract models of PCF

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1989)

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

  • 138 Accesses

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. G. Berry. Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d'Etat, Université Paris VII, 1979.

    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. Reynolds (editors), Algebraic Methods in Semantics, 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. Meyer and S. Cosmadakis. Semantical paradigms: notes for an invited lecture. Proc. 3rd LICS, 1988.

    Google Scholar 

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

    Google Scholar 

  6. G. Plotkin. LCF considered as a programming language. Theoretical Computer Science 5, 1977.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Artificial Intelligence School of Cognitive and Computing Sciences, University of Sussex, BN1 9QH, Falmer, Brighton, England

    Allen Stoughton

Authors
  1. Allen Stoughton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Main A. Melton M. Mislove D. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stoughton, A. (1990). Equationally fully abstract models of PCF. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1989. Lecture Notes in Computer Science, vol 442. Springer, New York, NY. https://doi.org/10.1007/BFb0040262

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97375-3

  • Online ISBN: 978-0-387-34808-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics