Abstract. The long-standing problem of giving fully abstract semantics to the nu-calculus has been solved only recently with game models a ̀ la Hyland-Ong in the universe of Fraenkel-Mostowski sets. However, these models are still quite complicated, mainly because they aim to ensure at once both the equivariance of strategies, and the possibility of having strategies generating new names. In this paper, we present an alternative, and somehow simpler, game semantics for the nu-calculus, endorsing the “object-oriented ” view of references. The idea is to deal first with equivariance, and then with name generation. More precisely, we define a game model where terms are interpreted by (equivariant) strategies parametrized by some oracle, which ...
Pitts and Stark's nu-calculus is a paradigmatic total language for studying the problem of contextua...
The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with state in the form of dy...
AbstractWe present a type assignment system that provides a finitary interpretation of lambda terms ...
AbstractWe describe a fully abstract semantics for a simple functional language with locally declare...
Game semantics has been used with considerable success in formulating fullyabstract semantics for la...
AbstractWe present a model of games based on nominal sequences, which generalise sequences with atom...
We examine the denotational semantics of a language extending the nu-calculus of Pitts and Stark by ...
Game Semantics arguably stands for one of the most successful techniques in denotational semantics, ...
We investigate the game semantics of general references through the fully abstract game model of Abr...
We present a new denotational model for the untyped #-calUdW6: using the techniques of game semant...
AbstractWe present a new denotational model for the untyped λ-calculus, using the techniques of game...
Abstract. Game semantics is concerned with providing game models to programming languages or proof t...
Abstract. We study extensional models of the untyped lambda calculus in the setting of the game sema...
We present a new denotational model for the untyped -calculus, using the techniques of game semanti...
This paper describes the construction of categorical models for the nu-calculus, a language that com...
Pitts and Stark's nu-calculus is a paradigmatic total language for studying the problem of contextua...
The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with state in the form of dy...
AbstractWe present a type assignment system that provides a finitary interpretation of lambda terms ...
AbstractWe describe a fully abstract semantics for a simple functional language with locally declare...
Game semantics has been used with considerable success in formulating fullyabstract semantics for la...
AbstractWe present a model of games based on nominal sequences, which generalise sequences with atom...
We examine the denotational semantics of a language extending the nu-calculus of Pitts and Stark by ...
Game Semantics arguably stands for one of the most successful techniques in denotational semantics, ...
We investigate the game semantics of general references through the fully abstract game model of Abr...
We present a new denotational model for the untyped #-calUdW6: using the techniques of game semant...
AbstractWe present a new denotational model for the untyped λ-calculus, using the techniques of game...
Abstract. Game semantics is concerned with providing game models to programming languages or proof t...
Abstract. We study extensional models of the untyped lambda calculus in the setting of the game sema...
We present a new denotational model for the untyped -calculus, using the techniques of game semanti...
This paper describes the construction of categorical models for the nu-calculus, a language that com...
Pitts and Stark's nu-calculus is a paradigmatic total language for studying the problem of contextua...
The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with state in the form of dy...
AbstractWe present a type assignment system that provides a finitary interpretation of lambda terms ...