Skip to main content

Relative Definability and Models of Unary PCF

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

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

Included in the following conference series:

Abstract

We show that the poset of degrees of relative definability in the Scott model of Unary PCF is non trivial, and that, nevertheless, the hierarchy of order extensional models of the language is reduced to a bottom element (the fully abstract model) and a top one (the Scott model itself).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Bucciarelli. Degrees of Parallelism in the Continuous Type Hierarchy. Theoretical Computer Science 177:59–71, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. T. Ehrhard. A Relative Definability Result for Strongly Stable Functions and Some Corollaries. Information and Computation, Academic Press, 152:111–137, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. Joly Encoding of the halting problem into the Monster type and applications. This volume.

    Google Scholar 

  4. A. Jung, A. Stoughton. Studying the Fully Abstract Model of PCF Within its Continuous Function Model. in Typed Lambda-Calculi and Applications, Eds. M. Bezem and J.F. Groote, LNCS 664, Springer, 1993.

    Google Scholar 

  5. J. Laird. A Fully Abstract Bidomain Model of Unary FPC. Unpublished notes, available at www.cogs.susx.ac.uk/users/jiml. 2002.

    Google Scholar 

  6. J. Laird. Personal communication. 2002.

    Google Scholar 

  7. R. Loader. The undecidability of lambda-definability. in Logic, Meaning and Computation, Essays in Memory of Alonzo Church, Kluwer Academic Publishers, 2001.

    Google Scholar 

  8. R. Loader. Unary PCF is decidable. Theoretical Computer Science 206, 1998.

    Google Scholar 

  9. R. Loader. Finitary PCF is not decidable. Theoretical Computer Science 266, 2001.

    Google Scholar 

  10. J. Longley. The sequentially realizable functionals. To appear in Annals of Pure and Applied Logic.

    Google Scholar 

  11. J. Longley. When is a functional program not a functional program? Proceedings of Fourth ACM SIGPLAN International Conference on Functional Programming, Paris, September 1999. ACM Press.

    Google Scholar 

  12. V. Padovani. Decidability of all minimal models. in M. Coppo and S. Berardi eds, Types for Proofs and Programs, LNCS 1158, Springer 1996.

    Google Scholar 

  13. G. Plotkin. LCF considerer as a programming language. Theoretical Computer Science 5, 1977.

    Google Scholar 

  14. K. Sieber. Reasoning about Sequential Functions via Logical Relations. Proc. LMS Symposium on Applications of Categories in Computer Science, M. Fourman, P. Johnstone, A. Pitts eds, LMS Lecture Note Series 177, Cambridge University Press, 1992.

    Google Scholar 

  15. M. Schmidt-Schauss. Decidability of Behavioral Equivalence in Unary PCF. Theoretical Computer Science 216:363–373, 1999.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bucciarelli, A., Leperchey, B., Padovani, V. (2003). Relative Definability and Models of Unary PCF. In: Hofmann, M. (eds) Typed Lambda Calculi and Applications. TLCA 2003. Lecture Notes in Computer Science, vol 2701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44904-3_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44904-3_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40332-6

  • Online ISBN: 978-3-540-44904-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics