Graph Lambda Theories

A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the λβ or the least sensible λ-theoryH(which is generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there are a minimal λ-theory and a minimal sensible λ-theory represented by it. In this paper, we give a positive answer to this question for the class of graph models `a la Plotkin, Scott and Engeler. In particular, we build two graph models whose theories are the set of equations satisfied in, respectively, any graph model and any sensible graph model. We conjecture that the least sensible graph theory, where ‘graph theory’ means ‘λ-theory of a graph model’, is equal toH, while in one of the main results of the paper we show the non-existence of a graph model whose equational theory is exactly the λβ theory. Another related question is whether, given a class of lambda models, there is a maximal sensible λ-theory represented by it. In the main result of the paper, we characterise the greatest sensible graph theory as the λ-theory B generated by equating λ-terms with the same B¨ohm tree. This result is a consequence of the main technical theorem of the paper, which says that all the equations between solvable λ-terms that have different B¨ohm trees fail in every sensible graph model. A further result of the paper is the existence of a continuum of different sensible graph theories strictly included in B.