Results 1 
4 of
4
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 models D and ..."
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...
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 first construct mod ..."
Abstract

Cited by 3 (1 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
, 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 rst construct models ..."
Abstract

Cited by 1 (0 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 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 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 eectively almosteverywhere copycat (EAC) strategies. The category A EAC with these strategies as morphisms gives rise to a ...
A lambda calculus for D∞
, 2002
"... We define an extension of lambda calculus which is fully abstract for Scott's D_infinitymodels. We do so by constructing an infinitary lambda calculus which not only has the confluence property, but also is normalising: every term has its infinity etaBöhm tree as unique normal form. The extension ..."
Abstract
 Add to MetaCart
We define an extension of lambda calculus which is fully abstract for Scott's D_infinitymodels. We do so by constructing an infinitary lambda calculus which not only has the confluence property, but also is normalising: every term has its infinity etaBöhm tree as unique normal form. The extension incorporates...