Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Extensional embedding of a strongly stable model of PCF

  • Functional Programming (Session 2)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

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

Included in the following conference series:

Abstract

This work takes place in denotational semantics of simply typed functional programming languages (like PCF, see [8]). We describe a general method for performing simultaneously an extensional and a “stable” semantics in such a way that only maps existing in both semantics subsist in our model. The construction is carried out in the framework of strongly stable functions that we have recently defined and which is a refinement of stable semantics such that, at first order, all functions are sequential. However we do not use any peculiar feature of this semantics and constructions presented here could just as well be carried out in the more usual stable framework.

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 des lambda-calculs typés Thèse de Doctorat, Université Paris 7, 1979.

    Google Scholar 

  2. G. Berry Stable models of typed lambda calculi LNCS 62.

    Google Scholar 

  3. A. Bucciarelli, T. Ehrhard Sequentiality and strong stability LICS 91.

    Google Scholar 

  4. P.L. Curien Categorical combinators, Sequential Algorithms and Functional Programming Pitman, 1986.

    Google Scholar 

  5. P.L. Curien Algorithmes séquentiels et extensionalité Rapport LITP 82-67, Uiversité Paris 6–7, 1982.

    Google Scholar 

  6. J.Y. Girard The system F of variable types fifteen years later Theoretical Computer Science, vol. 45, 1986.

    Google Scholar 

  7. R. Milner Fully abstract models of typed lambda-calculi TCS 4, 1977.

    Google Scholar 

  8. G. Plotkin LCF considered as a programming language TCS 5, 1977.

    Google Scholar 

  9. G. Winskel An introduction to Event Structures LNCS 354, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Italy

    Antonio Bucciarelli

  2. Ecole Normale Supérieure, L.I.E.N.S., France

    Antonio Bucciarelli

  3. L.I.T.P., Institut Blaise Pascal, Université Paris VII, France

    Thomas Ehrhard

Authors
  1. Antonio Bucciarelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Ehrhard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bucciarelli, A., Ehrhard, T. (1991). Extensional embedding of a strongly stable model of PCF. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_123

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_123

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation