Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2012: Mathematical Foundations of Computer Science 2012 pp 31–45Cite as

Scott Is Always Simple

  • Conference paper

  • 1380 Accesses

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

Abstract

In this paper we give an outline of recent algebraic results concerning theories and models of the untyped lambda calculus.

This is a preview of subscription content, 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   89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  2. Bastonero, O., Gouy, X.: Strong stability and the incompleteness of stable models of λ-calculus. Annals of Pure and Applied Logic 100, 247–277 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Berline, C., Manzonetto, G., Salibra, A.: Effective λ-models versus recursively enumerable λ-theories. Math. Struct. Comp. Science 19, 897–942 (2009)

    MathSciNet  MATH  Google Scholar 

  5. 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 

  6. Bigelow, D., Burris, S.: Boolean algebras of factor congruences. Acta Sci. Math. 54, 11–20 (1990)

    MathSciNet  MATH  Google Scholar 

  7. Bucciarelli, A., Ehrhard, T.: Sequentiality and strong stability. In: LICS 1991. IEEE Computer Society Press (1991)

    Google Scholar 

  8. Bucciarelli, A., Salibra, A.: Graph lambda theories. Math. Struct. Math. Struct. in Comp. Science Science 18, 975–1004 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Burris, S., Sankappanavar, H.P.: A course in universal algebra. Springer, Berlin (1981)

    Book  MATH  Google Scholar 

  10. Carraro, A., Salibra, A.: Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. In: LICS 2009. IEEE Computer Society Press (2009)

    Google Scholar 

  11. Carraro, A., Salibra, A.: On the equational consistency of order-theoretic models of the λ-calculus (forthcoming 2012)

    Google Scholar 

  12. Church, A.: A set of postulates for the foundation of logic. Annals of Math. 2, 346–366 (1933)

    Google Scholar 

  13. Church, A.: The calculi of lambda conversion. Princeton University Press (1941)

    Google Scholar 

  14. Comer, S.: Representations by algebras of sections over Boolean spaces. Pacific Journal of Mathematics 38, 29–38 (1971)

    MathSciNet  MATH  Google Scholar 

  15. Curry, H.B., Feys, R.: Combinatory Logic, vol. I. North-Holland Publishing Co. (1958)

    Google Scholar 

  16. 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)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kerth, R.: Isomorphisme et équivalence équationnelle entre modèles du λ-calcul. Thèse, Université de Paris 7 (1995)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. Lusin, S., Salibra, A.: The lattice of lambda theories. Journal of Logic and Computation 14, 373–394 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  20. Manzonetto, G., Salibra, A.: From λ-Calculus to Universal Algebra and Back. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 479–490. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  21. Manzonetto, G., Salibra, A.: Applying universal algebra to lambda calculus. Journal of Logic and Computation 20(4), 877–915 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  22. Pierce, R.S.: Modules over Commutative Regular Rings. Memoirs of AMS (1967)

    Google Scholar 

  23. Pigozzi, D., Salibra, A.: Lambda abstraction algebras: representation theorems. Theoretical Computer Science 140, 5–52 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  24. Plotkin, G.D.: On a question of H. Friedman. Information and Computation 126, 74–77 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  25. Salibra, A.: On the algebraic models of lambda calculus. Theoretical Computer Science 249, 197–240 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  26. Salibra, A.: Topological incompleteness and order incompleteness of the lambda calculus. ACM TOCL 4(3) (2003)

    Google Scholar 

  27. Salibra, A., Ledda, A., Paoli, F., Kowalski, T.: Boolean-like algebras. Algebra Universalis (to appear)

    Google Scholar 

  28. Scott, D.S.: Models for the λ-calculus. In: Toposes, Algebraic Geometry and Logic. LNM, vol. 274, Springer (1972)

    Google Scholar 

  29. Scott, D.S.: Lambda calculus: some models, some philosophy. In: The Kleene Symposium. North-Holland (1980)

    Google Scholar 

  30. Selinger, P.: Order-incompleteness and finite lambda reduction models. Theoretical Computer Science 309, 43–63 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  31. Vaggione, D.: Varieties in which the Pierce stalks are directly indecomposable. Journal of Algebra 184, 424–434 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DAIS, Università Ca’Foscari Venezia, Via Torino 155, 30172, Venezia, Italy

    Antonino Salibra

Authors
  1. Antonino Salibra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynska Dolina, 84248, Bratislava, Slovakia

    Branislav Rovan

  2. Department of Electronics and Computer Science, University of Southampton, SO17 1BJ, Southampton, UK

    Vladimiro Sassone

  3. Institute of Theoretical Computer Science, ETH Zürich, CAB H 39.2, Universitätstrasse 6, 8092, Zürich, Switzerland

    Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salibra, A. (2012). Scott Is Always Simple. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32589-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32588-5

  • Online ISBN: 978-3-642-32589-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation