Advertisement

The Minimal Graph Model of Lambda Calculus

  • Antonio Bucciarelli
  • Antonino Salibra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2747)

Abstract

A longstanding open problem in lambda-calculus, raised by G.Plotkin, is whether there exists a continuous model of the untyped lambda-calculus whose theory is exactly the beta-theory or the beta-eta-theory. A related question, raised recently by C.Berline, is whether, given a class of lambda-models, there is a minimal equational theory represented by it.

In this paper, we give a positive answer to this latter question for the class of graph models à la Plotkin-Scott-Engeler. In particular, we build a graph model the equational theory of which is exactly the set of equations satisfied in any graph model.

Keywords

Graph Model Equational Theory Apply Logic Congruence Relation Lambda Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abramsky, S.: Domain theory in logical form. Annals of Pure and Applied Logic 51, 1–77 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alessi, F., Dezani, M., Honsell, F.: Filter models and easy terms. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 17–37. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Baeten, J., Boerboom, B.: Omega can be anything it should not be. Indag. Mathematicae 41, 111–120 (1979)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Barendregt, H.P.: The lambda calculus: Its syntax and semantics. In: Studies in Logic and the Foundations of Mathematics, Revised edn., vol. 103, North-Holland Publishing Co., Amsterdam (1984)Google Scholar
  5. 5.
    Barendregt, H.P., Coppo, M., Dezani, M.: A filter lambda model and the completeness of type assignment. J. Symbolic Logic 48, 931–940 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bastonero, O., Gouy, X.: Strong stability and the incompleteness of stable models of λ-calculus. Annals of Pure and Applied Logic 100, 247–277 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Berline, C.: From computation to foundations via functions and application: The λ-calculus and its webbed models. Theoretical Computer Science 249, 81–161 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Berry, G.: Stable models of typed lambda-calculi. In: Ausiello, G., Böhm, C. (eds.) ICALP 1978. LNCS, vol. 62. Springer, Heidelberg (1978)Google Scholar
  9. 9.
    Bucciarelli, A., Ehrhard, T.: Sequentiality and strong stability. In: Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 138–145 (1991)Google Scholar
  10. 10.
    Coppo, M., Dezani, M.: An extension of the basic functionality theory for the λ-calculus. Notre Dame J. Formal Logic 21, 685–693 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Di Gianantonio, P., Honsell, F.: An abstract notion of application. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 124–138. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  12. 12.
    Di Gianantonio, P., Honsell, F., Plotkin, G.D.: Uncountable limits and the lambda calculus. Nordic J. Comput. 2, 126–145 (1995)zbMATHMathSciNetGoogle Scholar
  13. 13.
    Honsell, F., Ronchi della Rocca, S.: An approximation theorem for topological λ-models and the topological incompleteness of λ-calculus. Journal Computer and System Science 45, 49–75 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Kerth, R.: Isomorphism and equational equivalence of continuous lambda models. Studia Logica 61, 403–415 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Kerth, R.: On the construction of stable models of λ-calculus. Theoretical Computer Science 269 (2001)Google Scholar
  16. 16.
    Longo, G.: Set-theoretical models of λ-calculus: theories, expansions and isomorphisms. Ann. Pure Applied Logic 24, 153–188 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Plotkin, G.D.: Set-theoretical and other elementary models of the λ-calculus. Theoretical Computer Science 121, 351–409 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Salibra, A.: Topological incompleteness and order incompleteness of the lambda calculus. ACM Transactions on Computational Logic (2003) Google Scholar
  19. 19.
    Scott, D.S.: Continuous lattices. In: Lawvere, F.W. (ed.) Toposes, Algebraic geometry and Logic. LNM, vol. 274, pp. 97–136. Springer, Heidelberg (1972)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Antonio Bucciarelli
    • 1
  • Antonino Salibra
    • 2
  1. 1.Université Paris 7ParisFrance
  2. 2.Dipartimento di InformaticaUniversità Ca’Foscari di VeneziaVeneziaItalia

Personalised recommendations