Results 1 
4 of
4
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 4 (3 self)
 Add to MetaCart
(Show Context)
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 syntaxindependent universal models of the untyped λcalculus. 1
Games characterizing LévyLongo trees
 Theoretical Computer Science
, 2002
"... We present a simple strongly universal innocent game model for LevyLongo trees i.e. every point in the model is the denotation of a unique LevyLongo tree. The observational quotient of the model then gives a universal, and hence fully abstract, model of the pure Lazy Lambda Calculus. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a simple strongly universal innocent game model for LevyLongo trees i.e. every point in the model is the denotation of a unique LevyLongo tree. The observational quotient of the model then gives a universal, and hence fully abstract, model of the pure Lazy Lambda Calculus.