The Minimal Graph Model of Lambda Calculus

  title={The Minimal Graph Model of Lambda Calculus},
  author={Antonio Bucciarelli and Antonino Salibra},
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. 
Minimal lambda-theories by ultraproducts
A general tool is given to answer positively to whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lb or the least sensible lambda- theory H (generated by equating all the unsolvable terms).
Lambda calculus: models and theories
In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the
A graph-easy class of mute lambda-terms
An infinite set S of mute terms is defined, and it is shown that it is graph-easy: for any closed term t of the lambda calculus there exists a graph model equating all the terms of S to t.
Graph lambda theories†
This paper builds two graph models whose theories are the set of equations satisfied in, respectively, any graph model and any sensible graph model, and conjecture that the least sensible graph theory is equal to ℋ.
Models and theories of lambda calculus
The main research achievements include: a general construction of lambda-models from reflexive objects in (possibly non-well-pointed) categories; a Stone-style representation theorem for combinatory algebras; and a proof that no effective lambda-model can have lambda-beta or lambda- Beta as its equational theory.
The sensible graph theories of lambda calculus
  • A. Bucciarelli, A. Salibra
  • Mathematics, Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
A positive answer is given for the semantics of lambda calculus given in terms of graph models that the least sensible graph theory, where "graph theory" means "/spl lambda/-theory of a graph model", is equal to H, while in the main result of the paper, the greatest sensiblegraph theory is characterized as the lambda.
Lambda Theories of Effective Lambda Models
This paper investigates the class of graph models and proves that no order theory of a graph model can be r.e. recursively enumerable, and that there exists an effective graph model whose equational/ order theory is the minimum one.
The Visser topology of Lambda-calculus
This paper makes use of the Visser topology for investigating the more general question of whether the equational theory of a non syntactical model M, say Eq(M) (resp.
Effective λ-models versus recursively enumerable λ-theories
It is proved that no effective model living in the stable or strongly stable semantics has an r.e. equational theory, and that there exists an effective graph model whose equational/order theory is the minimum among the theories of graph models.


Topological incompleteness and order incompleteness of the lambda calculus
A new technique is introduced to prove in a uniform way the incompleteness of all denotational semantics of lambda calculus that have been proposed so far, including the strongly stable one, whose incompletteness had been conjectured by Bastonero, Gouy and Berline.
The lambda calculus - its syntax and semantics
  • H. Barendregt
  • Mathematics
    Studies in logic and the foundations of mathematics
  • 1985
Uncountable Limits and the lambda Calculus
It is shown that among the reflexive domain models in the category of cpo's and ω0-continuous functions there is one which has a minimal theory, whose theory is precisely the λβη theory.
Stable Models of Typed lambda-Calculi
It is shown that Milner's fully abstract model of Plotkin's PCP language only contains stable functions, and new model constructions from a notion of stable function are presented.
On the construction of stable models of untyped lambda-calculus
  • R. Kerth
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2001
Set-Theoretical and Other Elementary Models of the lambda-Calculus
Strong Stability and the Incompleteness of Stable Models for lambda-Calculus
Set-theoretical models of λ-calculus: theories, expansions, isomorphisms
  • G. Longo
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1983
Toposes, Algebraic Geometry and Logic
Sheaf theory and the continuum hypothesis.- Classifying topos.- Deductive systems and categories III. Cartesian closed categories, intuitionist propositional calculus, and combinatory logic.- The