Skip to main content

Full Abstraction for PCF (extended abstract)

  • Invited Talk 1
  • Conference paper
  • First Online:
Theoretical Aspects of Computer Software (TACS 1994)

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

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. Proofs as processes. Unpublished Lecture, 1991.

    Google Scholar 

  2. S. Abramsky and R. Jagadeesan, Games and Full Completeness for Multiplicative Linear Logic, 1992. To appear in Journal of Symbolic Logic.

    Google Scholar 

  3. S. Abramsky and R. Jagadeesan, Game semantics for Exponentials, 1993. Announcement on the types mailing list.

    Google Scholar 

  4. M. Abadi and G. Plotkin, A PER model of polymorphism and recursive types, Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.

    Google Scholar 

  5. G. Berry, Modeles completement adequats et stable de lambda-calculs types. These de Doctorat d'Etat, Universite Paris VII, 1979.

    Google Scholar 

  6. G. Berry and P.-L. Curien, Sequential algorithms on concrete data structures. Theoretical Computer Science 1982.

    Google Scholar 

  7. G Berry, P.-L. Curien and J.-J. Levy, Full Abstraction for Sequential Languages: the State of the Art, in M. Nivat and J. Reynolds, eds., Algebraic Methods in Semantics, Cambridge University Press 1985.

    Google Scholar 

  8. A. Bucciarelli and T. Ehrhard, Extensional embedding of a strongly stable model of PCF, Proc. ICALP 1991, Springer LNCS 510 1991.

    Google Scholar 

  9. R. Cartwright and M. Felleisen, Observable Sequentiality and Full Abstraction, Proc. POPL 1992.

    Google Scholar 

  10. P.-L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman 1986.

    Google Scholar 

  11. P.L. Curien, Sequentiality and Full Abstraction, in M. Fourman, P. T. Johnstone and A. M. Pitts, eds., Applications of Categories in Computer Science, Cambridge University Press 1992.

    Google Scholar 

  12. P.-L. Curien, Observable sequential algorithms on concrete data structures, Proc. LICS 1992.

    Google Scholar 

  13. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.

    Google Scholar 

  14. T. Ehrhard, Projecting sequential algorithms on the strongly stable functions, Annals of Pure and Applied Logic, 1993.

    Google Scholar 

  15. J.-Y. Girard. Towards a geometry of interaction. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics, pages 69–108. American Mathematical Society, 1989.

    Google Scholar 

  16. J.-Y. Girard. Geometry of interaction 1: Interpretation of System F. In R. Ferro et al., editor, Logic Colloquium 88. North Holland, 1989.

    Google Scholar 

  17. J.-Y. Girard. Geometry of interaction 2: Deadlock-free algorithms. In P. Martin-Löf and G. Mints, editors, International Conference on Computer Logic, COLOG 88, pages 76–93. Springer-Verlag, 1988. Lecture Notes in Computer Science 417.

    Google Scholar 

  18. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  19. A. Jung and A. Stoughton, Studying the Fully Abstract Model of PCF within its Continuous Function Model, Proc. Typed Lambda Calculus, 1993.

    Google Scholar 

  20. R. Milner, Fully Abstract Models for Typed Lambda Calculi, Theoretical Computer Science 1977.

    Google Scholar 

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

    Google Scholar 

  22. W. Phoa, Effective domains and intrinsic structure, Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.

    Google Scholar 

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

    Google Scholar 

  24. A. Stoughton, Fully Abstract Models of Programming Languages, Pitman 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Masami Hagiya John C. Mitchell

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abramsky, S., Malacaria, P., Jagadeesan, R. (1994). Full Abstraction for PCF (extended abstract). In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-57887-0_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57887-1

  • Online ISBN: 978-3-540-48383-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics