Models and theories of lambda calculus

In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotational semantics and equational/order theories of the pure untyped lambda-calculus. The main research achievements include: (i) a general construction of lambda-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stone-style representation theorem for combinatory algebras; (iii) a proof that no effective lambda-model can have lambda-beta or lambda-beta-eta as its equational theory (this can be seen as a partial answer to an open problem introduced by Honsell-Ronchi Della Rocca in 1984).

[1]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[2]  Erwin Emgeler.  Algebras and combinators , 1979 .

[3]  Antonio Bucciarelli,et al.  Not Enough Points Is Enough , 2007, CSL.

[4]  P. Daniel Hestand,et al.  Mathematical theory of domains , 2002, SIGA.

[5]  Jean-Louis Krivine,et al.  Lambda-calculus, types and models , 1993, Ellis Horwood series in computers and their applications.

[6]  S. Lane.  Categories for the Working Mathematician , 1971 .

[7]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[8]  R. Kerth.  Isomorphisme et equivalence equationnelle entre modeles du λ-calcul , 1995 .

[9]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[10]  Martín Hötzel Escardó,et al.  PCF Extended with Real Numbers , 1996, Theor. Comput. Sci..

[11]  Giuseppe Rosolini,et al.  A Category Theoretic Formulation for Engeler-style Models of the Untyped λ-Calculus , 2006 .

[12]  Stefano Berardi,et al.  BetaEta-Complete Models for System F , 2002, Math. Struct. Comput. Sci..

[13]  Christiaan Peter Jozef Koymans,et al.  Models of the Lambda Calculus , 1982, Inf. Control..

[14]  Olivier Bastonero,et al.  Strong Stability and the Incompleteness of Stable Models for lambda-Calculus , 1999, Ann. Pure Appl. Log..

[15]  Chantal Berline,et al.  From computation to foundations via functions and application: The -calculus and its webbed models , 2000, Theor. Comput. Sci..

[16]  Mariangiola Dezani-Ciancaglini,et al.  A Filter Model for Concurrent lambda-Calculus , 1998, SIAM J. Comput..

[17]  Giulio Manzonetto,et al.  Lambda Theories of Effective Lambda Models , 2007, CSL.

[18]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[19]  Peter Selinger.  Order-incompleteness and finite lambda models , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[20]  C.-H. Luke Ong,et al.  A Universal Innocent Game Model for the Böhm Tree Lambda Theory , 1999, CSL.

[21]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[22]  Jean-Jacques Lévy,et al.  Full abstraction for sequential languages : The states of the art , 1983 .

[23]  Antonino Salibra,et al.  Topological incompleteness and order incompleteness of the lambda calculus , 2003, TOCL.

[24]  Antonio Bucciarelli,et al.  Graph lambda theories , 2008, Math. Struct. Comput. Sci..

[25]  R. Pierce.  Modules over Commutative Regular Rings , 1967 .

[26]  M. Coppo.  Type theories, normal forms, and D?-lambda-models*1 , 1987 .

[27]  Peter Selinger,et al.  Functionality, polymorphism, and concurrency: a mathematical investigation of programming paradigms , 1998 .

[28]  Dana S. Scott,et al.  Lambda Calculus: Some Models, Some Philosophy , 1980 .

[29]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[30]  Gordon D. Plotkin,et al.  Set-Theoretical and Other Elementary Models of the lambda-Calculus , 1993, Theor. Comput. Sci..

[31]  Antonino Salibra,et al.  Easiness in graph models , 2006, Theor. Comput. Sci..

[32]  Giulio Manzonetto,et al.  Effective lambda-models versus recursively enumerable lambda-theories , 2009, Math. Struct. Comput. Sci..

[33]  Rainer Kerth,et al.  The interpretation of unsolvable λ-terms in models of untyped λ-calculus , 1998, Journal of Symbolic Logic.

[34]  E. Engeler.  Algebras and combinators , 1981 .

[35]  Rainer Kerth.  On the construction of stable models of untyped lambda-calculus , 2001, Theor. Comput. Sci..

[36]  Giuseppe Longo,et al.  Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..

[37]  René David.  Computing with Böhm Trees , 2001, Fundam. Informaticae.

[38]  Albert R. Meyer,et al.  What is a Model of the Lambda Calculus? , 1982, Inf. Control..

[39]  Antonino Salibra,et al.  The Lattice of Lambda Theories , 2004, J. Log. Comput..

[40]  A. Church.  The calculi of lambda-conversion , 1941 .

[41]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[42]  Mariangiola Dezani-Ciancaglini,et al.  Type Theories, Normal Forms and D_\infty-Lambda-Models , 1987, Inf. Comput..

[43]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[44]  Gordon Plotkin,et al.  A Set-Theoretical Definition of Application , 2003 .

[45]  R. McKenzie,et al.  Algebras, Lattices, Varieties , 1988 .

[46]  Paola Giannini,et al.  Effectively Given Domains and Lambda-Calculus Models , 1984, Inf. Control..

[47]  Peter Selinger.  The lambda calculus is algebraic , 2002, J. Funct. Program..

[48]  Ugo de'Liguoro,et al.  Non Deterministic Extensions of Untyped Lambda-Calculus , 1995, Inf. Comput..

[49]  Antonino Salibra,et al.  Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus , 1997, Fundam. Informaticae.

[50]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[51]  Viggo Stoltenberg-Hansen,et al.  Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.

[52]  Mariangiola Dezani-Ciancaglini,et al.  A Characterization of F-Complete Type Assignments , 1986, Theor. Comput. Sci..

[53]  Matthew Hennessy,et al.  A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus , 1980, Theor. Comput. Sci..

[54]  Giulio Manzonetto,et al.  Boolean Algebras for Lambda Calculus , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[55]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[56]  Furio Honsell,et al.  An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus , 1992, J. Comput. Syst. Sci..

[57]  Samson Abramsky,et al.  On Semantic Foundations for Applicative Multiprogramming , 1983, ICALP.

[58]  Gérard Berry,et al.  On the Definition of Lamda-Calculus Models , 1981, ICFPC.

[59]  Giulio Manzonetto,et al.  Applying Universal Algebra to Lambda Calculus , 2010, J. Log. Comput..

[60]  M. Dezani-Ciancaglini,et al.  Extended Type Structures and Filter Lambda Models , 1984 .

[61]  D. Vaggione.  Varieties in Which the Pierce Stalks Are Directly Indecomposable , 1996 .

[62]  Antonio Bucciarelli,et al.  On phase semantics and denotational semantics: the exponentials , 2001, Ann. Pure Appl. Log..

[63]  S. D. Comer,et al.  Representations by algebras of sections over Boolean spaces. , 1971 .

[64]  Furio Honsell,et al.  Uncountable Limits and the lambda Calculus , 1995, Nord. J. Comput..

[65]  R. Kerth.  20 MODELES DE GRAPHES NON EQUATIONNELLEMENT EQUIVALENTS , 1994 .

[66]  C.-H. Luke Ong,et al.  Non-determinism in a functional setting , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[67]  Antonio Bucciarelli,et al.  The Minimal Graph Model of Lambda Calculus , 2003, MFCS.

[68]  G. Longo,et al.  Lambda-Calculus Models and Extensionality , 1980, Math. Log. Q..

[69]  H. Barendregt.  The type free lambda calculus , 1977 .

[70]  Antonino Salibra,et al.  A continuum of theories of lambda calculus without semantics , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[71]  Antonio Bucciarelli,et al.  The sensible graph theories of lambda calculus , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[72]  Antonino Salibra.  On the algebraic models of lambda calculus , 2000, Theor. Comput. Sci..

[73]  Jean-Yves Girard,et al.  Normal functors, power series and λ-calculus , 1988, Ann. Pure Appl. Log..

[74]  A. Church.  A Set of Postulates for the Foundation of Logic , 1932 .

[75]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[76]  Andreas Gruchalski.  Computability on dI-Domains , 1996, Inf. Comput..

[77]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[78]  Antonio Bucciarelli,et al.  Sequentiality and strong stability , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[79]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.

[80]  J. Baeten,et al.  Omega can be anything it should not be , 1979 .

[81]  M. Hyland.  A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus , 1976 .

[82]  Christopher P. Wadsworth,et al.  The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..

[83]  Peter Selinger.  Order-incompleteness and finite lambda reduction models , 2003, Theor. Comput. Sci..

[84]  Martín Abadi.  A Semantics for Static Type Inference in a Nondeterministic Language , 1994, Inf. Comput..

[85]  M. Schönfinkel.  Über die Bausteine der mathematischen Logik , 1924 .

[86]  P. Odifreddi.  Classical recursion theory , 1989 .

[87]  G. Plotkin.  Tω as a Universal Domain , 1978 .

[88]  S. Burris,et al.  Sheaf constructions and their elementary properties , 1979 .

[89]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[90]  Pietro Di Gianantonio,et al.  Game Semantics for Untyped λβη-Calculus , 1999 .

[91]  Alan M. Turing.  The p-Function in λ-K-Conversion , 1937, J. Symb. Log..

[92]  Gordon D. Plotkin.  The lambda-Calculus is omega-Incomplete , 1974, J. Symb. Log..