Skip to main content
SpringerLink
Log in

Intensionally stable functions

  • Conference paper
  • First Online:
Logical Foundations of Computer Science — Tver '92 (LFCS 1992)

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

Included in the following conference series:

  • 147 Accesses

Abstract

Our principal concern in this paper is to pave further the way towards a semantical version of Milner's fully abstract model of typed λ-calculi. Relying on Milner's results that show that the function-based model of PCF is unique (up to isomorphism) and is Scottordered, and taking into account the fact that the underlying domains of the model cannot be distributive, we introduce SK-domains and define SI-functions which generalize, by departing from the distributivity requirement, the stable functions already introduced by Berry. We then show that SK-domains and SI-functions constitute a cartesian closed category which can be order enrich with Scott's ordering ie: can be used to provide order extensional models for λ-calculus based languages.

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.

Bibliographie

  1. G. Berry: Modèles complètement adéquats et stables des lambda-calculs typés Thèse de doctorat d'état, U. Paris VII

    Google Scholar 

  2. P.L. Curien: Categorical combinators, sequential algorithms and functional programming Research Notes in Theoretical Computer Science

    Google Scholar 

  3. G. Kahn & G. Plotkin: Structures de données concrètes Rapport IRIA-LABORIA 336

    Google Scholar 

  4. B. Gamatie: On sequential functions Rapport INRIA 1138

    Google Scholar 

  5. R. Milner: Fully abstract models of typed lambda-calculi TCS 4(1), 1–23

    Google Scholar 

  6. M. Nielsen, G. Plotkin, G. Winskel: Petri nets, event structures and domains TCS 13 85–108

    Google Scholar 

  7. G. Plotkin: LCF considered as a programming language TCS 5(3), 223–256

    Google Scholar 

  8. J. Vuillemin: Proof techniques for recursive programs Thesis Stanford U.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Campus Universitaire de Beaulieu, IRISA, F-35042, Rennes Cedex, France

    B. Gamate

Authors
  1. B. Gamate
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anil Nerode Mikhail Taitslin

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gamate, B. (1992). Intensionally stable functions. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023871

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55707-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation