Abstract
We present a game model of the untyped λ-calculus, with equational theory equal to the Böhm tree λ-theory B , which is universal (i.e. every element of the model is definable by some term). This answers a question of Di Gianantonio, Franco and Honsell. We build on our earlier work, which uses the methods of innocent game semantics to develop a universal model inducing the maximal consistent sensible theory H ∗ . To our knowledge these are the first syntax-independent universal models of the untyped λ-calculus.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call