Results 1 
7 of
7
Fully Complete Models for ML Polymorphic Types
, 1999
"... We present an axiomatic characterization of models fullycomplete for MLpolymorphic types of system F. This axiomatization is given for hyperdoctrine models, which arise as adjoint models, i.e. coKleisli categories of suitable linear categories. Examples of adjoint models can be obtained from cate ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We present an axiomatic characterization of models fullycomplete for MLpolymorphic types of system F. This axiomatization is given for hyperdoctrine models, which arise as adjoint models, i.e. coKleisli categories of suitable linear categories. Examples of adjoint models can be obtained from categories of Partial Equivalence Relations over Linear Combinatory Algebras. We show that a special linear combinatory algebra of partial involutions induces an hyperdoctrine which satisfies our axiomatization, and hence it provides a fullycomplete model for MLtypes.
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 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 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 λ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...
More Universal Game Models of Untyped λCalculus: The Böhm Tree Strikes Back
 STRIKES BACK, CSL'99 CONF. PROC., LNCS
, 1999
"... We present a game model of the untyped λcalculus, with equational theory equal to the Bohm 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 met ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a game model of the untyped λcalculus, with equational theory equal to the Bohm 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.
A Fully Complete PER Model for ML Polymorphic Types
 Proceedings of CSL 2000, Springer LNCS Volume 1862
, 2000
"... . We present a linear realizability technique for building Partial Equivalence Relations (PER) categories over Linear Combinatory Algebras. These PER categories turn out to be linear categories and to form an adjoint model with their coKleisli categories. We show that a special linear combinato ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. We present a linear realizability technique for building Partial Equivalence Relations (PER) categories over Linear Combinatory Algebras. These PER categories turn out to be linear categories and to form an adjoint model with their coKleisli categories. We show that a special linear combinatory algebra of partial involutions, arising from Geometry of Interaction constructions, gives rise to a fully and faithfully complete model for ML polymorphic types of system F. Keywords: MLpolymorphic types, linear logic, PER models, Geometry of Interaction, full completeness. Introduction Recently, Game Semantics has been used to define fullycomplete models for various fragments of Linear Logic ([AJ94a,AM99]), and to give fullyabstract models for many programming languages, including PCF [AJM96,HO96,Nic94], richer functional languages [McC96], and languages with nonfunctional features such as reference types and nonlocal control constructs [AM97,Lai97]. All these results are cru...
Three Inadequate Models
"... this paper we interest ourselves in counterexamples in order to make a case that these natural avenues of research had a degree of necessity. To this end, we construct inadequate models and investigate whether one can do better than the standard model, but still stay in the category of complete part ..."
Abstract
 Add to MetaCart
this paper we interest ourselves in counterexamples in order to make a case that these natural avenues of research had a degree of necessity. To this end, we construct inadequate models and investigate whether one can do better than the standard model, but still stay in the category of complete partial orders. (In contrast, an inadequate standard model of PCF is given in [Sim99]but in a specially constructed category.) We consider just one example, an untyped callbyname #calculus