AbstractWe consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin's language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking
Game semantics is a denotational semantics presenting compositionally the computational behaviour of...
AbstractWe study the algebraic structure of a programming language with higher-order store, in the s...
AbstractComputational effects which provide access to the flow of control (such as first-class conti...
AbstractWe consider a simple and well-known category of alternating games (also known as sequential ...
AbstractA new category of games is developed which improves over existing such categories in that it...
AbstractA games semantics is described for a typed functional language which includes primitives for...
Game semantics has proven to be a robust method to give compositional semantics for a variety of hig...
This thesis examines the use of denotational semantics to reason about control flow in sequential, b...
Game semantics has emerged as a paradigm for giving semantics to a wide range of programming languag...
This is the final version of the article. Available from ICE via the DOI in this record.Game semanti...
AbstractWe present a semantic analysis of the “linearly used continuation-passing interpretation” of...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
Game semantics is a denotational semantics presenting compositionally the computational behaviour of...
AbstractWe study the algebraic structure of a programming language with higher-order store, in the s...
AbstractComputational effects which provide access to the flow of control (such as first-class conti...
AbstractWe consider a simple and well-known category of alternating games (also known as sequential ...
AbstractA new category of games is developed which improves over existing such categories in that it...
AbstractA games semantics is described for a typed functional language which includes primitives for...
Game semantics has proven to be a robust method to give compositional semantics for a variety of hig...
This thesis examines the use of denotational semantics to reason about control flow in sequential, b...
Game semantics has emerged as a paradigm for giving semantics to a wide range of programming languag...
This is the final version of the article. Available from ICE via the DOI in this record.Game semanti...
AbstractWe present a semantic analysis of the “linearly used continuation-passing interpretation” of...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
International audienceGame semantics is a valuable source of fully abstract models of programming la...
Game semantics is a denotational semantics presenting compositionally the computational behaviour of...
AbstractWe study the algebraic structure of a programming language with higher-order store, in the s...
AbstractComputational effects which provide access to the flow of control (such as first-class conti...