Results 1 
5 of
5
On full abstraction for PCF: I. Models, observables and the full abstraction problem II. Dialogue games and innocent strategies III. A fully abstract and universal game model
 Information and Computation
, 2000
"... version) A categorical model for PCF is a map J : ( of cfix categories. ..."
Abstract

Cited by 31 (9 self)
 Add to MetaCart
version) A categorical model for PCF is a map J : ( of cfix categories.
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
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
Innocent Game Models of Untyped λCalculus
, 2000
"... We present a new denotation model for the untyped λcalculus, using the techniques of game semantics. The strategies used are innocent in the sense of Hyland and Ong [HO94] and Nickau [Nic96], but the traditional distinction between "question" and "answer" moves is removed. We ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We present a new denotation model for the untyped λcalculus, using the techniques of game semantics. The strategies used are innocent in the sense of Hyland and Ong [HO94] and Nickau [Nic96], but the traditional distinction between "question" and "answer" moves is removed. We first construct models D and DREC as global sections of a reflexive object in the categories A and A REC of arenas and innocent and recursive innocent strategies respectively. We show that these are sensible algebras but are neither extensional nor universal. We then introduce a new representation of innocent strategies in an economical form. We show a stong connexion between the economical form of the denotation of a term in the game models and a variablefree form of the Nakajima tree of the term. Using this we show that the denable elements of DREC are precisely what we call effectively almosteverywhere copycat (EAC) strategies. The category A EAC with these strategies as morphisms gives rise to a ...
Innocent Game Models of Untyped λCalculus
 Theoretical Computer Science
, 2000
"... We present a new denotational model for the untyped calculus, using the techniques of game semantics. The strategies used are innocent in the sense of Hyland and Ong [9] and Nickau [17], but the traditional distinction between \question" and \answer" moves is removed. We rst construct mod ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a new denotational model for the untyped calculus, using the techniques of game semantics. The strategies used are innocent in the sense of Hyland and Ong [9] and Nickau [17], but the traditional distinction between \question" and \answer" moves is removed. We rst construct models D and DREC as global sections of a reexive object in the categories A and A REC of arenas and innocent and recursive innocent strategies respectively. We show that these are sensible algebras but are neither extensional nor universal. We then introduce a new representation of innocent strategies in an economical form. We show a strong connexion between the economical form of the denotation of a term in the game models and a variablefree form of the Nakajima tree of the term. Using this we show that the denable elements of DREC are precisely what we call eectively almosteverywhere copycat (EAC) strategies. The category A EAC with these strategies as morphisms gives rise to a model D...
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.