Results 1 -
2 of
2
A universal innocent game model for the Bohm tree lambda theory
- In Computer Science Logic: Proceedings of the 8th Annual Conference on the EACSL
, 1999
"... 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 us ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
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. 1
