Abstract. We study extensional models of the untyped lambda calculus in the setting of the game semantics introduced by Abramsky, Hyland et alii. In particular we show that, somewhat unexpectedly and contrary to what happens in ordinary categories of domains, all reflexive objects in a standard category of games, induce the same λ-theory. This is H∗, the maximal theory induced already by the classical C.P.O. model D∞, introduced by Scott in 1969. This results indicates that the current notion of game carries a very specific bias towards head reduction
AbstractThe characterization of second-order type isomorphisms is a purely syntactical problem that ...
We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes...
<p>Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynam...
We present a game model of the untyped λ-calculus, with equational theory equal to the Bohm tree λ-t...
AbstractWe present a new denotational model for the untyped λ-calculus, using the techniques of game...
This paper is a detailed description of the application of games to the construction of models of pu...
Starting with the idea of reflexive objects in Selinger’s control categories, we define three differ...
We present a new denotational model for the untyped -calculus, using the techniques of game semanti...
AbstractWe present a game model of the untyped λ-calculus, with equational theory equal to the Böhm ...
We present a new denotational model for the untyped #-calUdW6: using the techniques of game semant...
AbstractWe present a type assignment system that provides a finitary interpretation of lambda terms ...
We present a type assignment system that provides a finitary interpretation of lambda terms in a gam...
Rapport interne.Given any cartesian closed category (standard model of the lambda calculus), we cons...
textabstractGame Logic (GL), introduced in (Parikh, 1985), is examined from a game-theoretic perspec...
Game semantics is a class of models of programming languages in which types are interpreted as games...
AbstractThe characterization of second-order type isomorphisms is a purely syntactical problem that ...
We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes...
<p>Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynam...
We present a game model of the untyped λ-calculus, with equational theory equal to the Bohm tree λ-t...
AbstractWe present a new denotational model for the untyped λ-calculus, using the techniques of game...
This paper is a detailed description of the application of games to the construction of models of pu...
Starting with the idea of reflexive objects in Selinger’s control categories, we define three differ...
We present a new denotational model for the untyped -calculus, using the techniques of game semanti...
AbstractWe present a game model of the untyped λ-calculus, with equational theory equal to the Böhm ...
We present a new denotational model for the untyped #-calUdW6: using the techniques of game semant...
AbstractWe present a type assignment system that provides a finitary interpretation of lambda terms ...
We present a type assignment system that provides a finitary interpretation of lambda terms in a gam...
Rapport interne.Given any cartesian closed category (standard model of the lambda calculus), we cons...
textabstractGame Logic (GL), introduced in (Parikh, 1985), is examined from a game-theoretic perspec...
Game semantics is a class of models of programming languages in which types are interpreted as games...
AbstractThe characterization of second-order type isomorphisms is a purely syntactical problem that ...
We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes...
<p>Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynam...