AbstractA new category of games is developed which improves over existing such categories in that it interprets sums as well as products, function spaces, and recursive types. A model of FPC, a sequential functional language with just this type structure, is described and shown to be fully abstract
This paper considers the consequences of relaxing the bracketing condition on ‘dialoguegames’, showi...
AbstractAn intensional model for the programming language PCF is described in which the types of PCF...
AbstractGame Semantics has successfully provided fully abstract models for a variety of programming ...
AbstractWe consider a simple and well-known category of alternating games (also known as sequential ...
ion for PCF Motivated by the full completeness results, it became of compelling interest to re-exam...
AbstractGame semantics has renewed denotational semantics. It offers among other things an attractiv...
AbstractWe consider a simple and well-known category of alternating games (also known as sequential ...
Game semantics has proven to be a robust method to give compositional semantics for a variety of hig...
AbstractA games semantics is described for a typed functional language which includes primitives for...
This thesis examines the use of denotational semantics to reason about control flow in sequential, b...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
Game semantics is an unusual denotational semantics in that it captures the intentional (or algorith...
This paper considers the consequences of relaxing the bracketing condition on ‘dialoguegames’, showi...
AbstractAn intensional model for the programming language PCF is described in which the types of PCF...
AbstractGame Semantics has successfully provided fully abstract models for a variety of programming ...
AbstractWe consider a simple and well-known category of alternating games (also known as sequential ...
ion for PCF Motivated by the full completeness results, it became of compelling interest to re-exam...
AbstractGame semantics has renewed denotational semantics. It offers among other things an attractiv...
AbstractWe consider a simple and well-known category of alternating games (also known as sequential ...
Game semantics has proven to be a robust method to give compositional semantics for a variety of hig...
AbstractA games semantics is described for a typed functional language which includes primitives for...
This thesis examines the use of denotational semantics to reason about control flow in sequential, b...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
We construct a universal and even logically fully abstract realizability model for the sequential fu...
Game semantics is an unusual denotational semantics in that it captures the intentional (or algorith...
This paper considers the consequences of relaxing the bracketing condition on ‘dialoguegames’, showi...
AbstractAn intensional model for the programming language PCF is described in which the types of PCF...
AbstractGame Semantics has successfully provided fully abstract models for a variety of programming ...
DOI
Add to ORKG