Skip to main content
SpringerLink
Log in

Not Enough Points Is Enough

  • Conference paper
Computer Science Logic (CSL 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4646))

Included in the following conference series:

Abstract

Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first-order axioms (λ-models), or as reflexive objects in cartesian closed categories (categorical models). In this paper we show that any categorical model of λ-calculus can be presented as a λ-model, even when the underlying category does not have enough points. We provide an example of an extensional model of λ-calculus in a category of sets and relations which has not enough points. Finally, we present some of its algebraic properties which make it suitable for dealing with non-deterministic extensions of λ-calculus.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation 163(2), 409–470 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Amadio, R.M., Curien, P.-L.: Domains and lambda-calculi. Cambridge University Press, New York (1998)

    MATH  Google Scholar 

  3. Asperti, A., Longo, G.: Categories, types and structures. In: Categories, types and structures, MIT Press, Cambridge (1991)

    Google Scholar 

  4. Barendregt, H.P.: The lambda calculus: Its syntax and semantics. North-Holland Publishing Co., Amsterdam (1984)

    MATH  Google Scholar 

  5. Berline, C.: From computation to foundations via functions and application: The λ-calculus and its webbed models. Theoretical Computer Science 249, 81–161 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theoretical Computer Science 20, 265–321 (1985)

    Article  MathSciNet  Google Scholar 

  7. Bucciarelli, A., Ehrhard, T.: On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Logic 109(3), 205–241 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Curry, H.B., Feys, R.: Combinatory Logic, vol. I. North-Holland, Amsterdam (1958)

    MATH  Google Scholar 

  9. Dezani Ciancaglini, M., de’Liguoro, U., Piperno, A.: A filter model for concurrent λ-calculus. SIAM Journal of Computing 27(5), 1376–1419 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. de’Liguoro, U., Piperno, A.: Non deterministic extensions of untyped λ-calculus. Information and Computation 109, 149–177 (1955)

    MathSciNet  Google Scholar 

  11. Di Gianantonio, P., Franco, G., Honsell, F.: Game semantics for untyped lambda calculus. In: Duke, D.J., Marshall, M.S., Herman, I. (eds.) PREMO: A Framework for Multimedia Middleware. LNCS, vol. 1591, pp. 114–128. Springer, Heidelberg (1999)

    Google Scholar 

  12. Girard, J.-Y.: Normal functors, power series and the λ-calculus. Annals of pure and applied logic 37, 129–177 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hindley, J.R., Longo, G.: Lambda calculus models and extensionality. Z. Math. Logik Grundlag. Math. 26, 289–310 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hyland, M.: A syntactic characterization of the equality in some models for the lambda calculus. J. London Math. Soc. 12(3), 361–370 (1975)

    Article  MathSciNet  Google Scholar 

  15. Hyland, M., Nagayama, M., Power, J., Rosolini, G.: A category theoretic formulation for Engeler-style models of the untyped λ-calculus. Electronic notes in theoretical computer science 161, 43–57 (2006)

    Article  Google Scholar 

  16. Hyland, M., Ong, C.-H.L.: On full abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Inf. and Comp. 163, 285–408 (2000)

    MATH  MathSciNet  Google Scholar 

  17. Ker, A.D., Nickau, H., Ong, C.-H.L.: A universal innocent game model for the Boehm tree lambda theory. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 405–419. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Kerth, R.: On the construction of stable models of λ-calculus. Theoretical Computer Science 269, 23–46 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  19. Koymans, C.P.J.: Models of the lambda calculus. Information and Control 52(3), 306–332 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lambek, J.: From lambda calculus to Cartesian closed categories. In: Seldin, J.P., Hindley, J. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London (1980)

    Google Scholar 

  21. Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. The Journal of Symbolic Logic 54(3) (1989)

    Google Scholar 

  22. Plotkin, G.D.: The λ-calculus is ω-incomplete. J. Symb. Log. 39(2), 313–317 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  23. Plotkin, G.D.: T ω as a Universal Domain. J. Comput. System Sci. 17, 209–236 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  24. Scott, D.S.: Continuous lattices. In: Toposes, Algebraic geometry and Logic. LNM, vol. 274, Springer, Heidelberg (1972)

    Chapter  Google Scholar 

  25. Selinger, P.: The lambda calculus is algebraic. J. Funct. Program. 12(6), 549–566 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire PPS, CNRS UMR 7126-Université Paris 7, 2, place Jussieu (case 7014), 75251 Paris Cedex 05, France

    Antonio Bucciarelli, Thomas Ehrhard & Giulio Manzonetto

  2. Institut de Mathématiques de Luminy CNRS UMR 6206, 163, avenue de Luminy, case 907 13288 Marseille, France

    Thomas Ehrhard

  3. Università Ca’Foscari di Venezia, Dipartimento di Informatica, Via Torino 155, 30172 Venezia, Italia

    Giulio Manzonetto

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

  3. Giulio Manzonetto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Duparc Thomas A. Henzinger

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bucciarelli, A., Ehrhard, T., Manzonetto, G. (2007). Not Enough Points Is Enough. In: Duparc, J., Henzinger, T.A. (eds) Computer Science Logic. CSL 2007. Lecture Notes in Computer Science, vol 4646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74915-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74915-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-74915-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation