Asynchronous Games: Innocence Without Alternation

@article{Mellis2007AsynchronousGI,
  title={Asynchronous Games: Innocence Without Alternation},
  author={Paul-Andr{\'e} Melli{\`e}s and Samuel Mimram},
  journal={ArXiv},
  year={2007},
  volume={abs/0706.1118}
}
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of ?-terms and PCF programs. An innocent strategy is defined as an alternating strategy with partial memory, in which the strategy plays according to its view. Extending the definition to nonalternating strategies is problematic, because the traditional definition of views is based on the hypothesis that Opponent and Proponent alternate during the interaction. Here, we take advantage… 
Categorical combinatorics of scheduling and synchronization in game semantics
TLDR
A number of simple and fundamental combinatorial structures are exhibited which ensure that a given scheduling policy encoded as synchronization template defines a symmetric monoidal closed (and in fact star-autonomous) bicategory of games, strategies and simulations.
Concurrent Hyland-Ong games
TLDR
A cartesian closed category, called CHO, based on event structures, that allows an interpretation of higher-order stateful concurrent programs that is refined and precise and much more expressive.
A Tale of Additives and Concurrency in Game Semantics
TLDR
The story of models of MALL in game semantics, in the modern clothes of concurrent games on event structures, from Blass games to Melliès’ approach to fully complete models of Linear Logic is told.
The Parallel Intensionally Fully Abstract Games Model of PCF
TLDR
This work describes a framework for truly concurrent game semantics of programming languages, based on Rideau and Winskel's concurrent games on event structures, and gives an alternative interpretation of Plot kin's PCF that takes advantage of the concurrent nature of strategies and formalizes the idea that although PCF is a sequential language, certain sub-computations are independent and can be computed in a parallel fashion.
Deterministic concurrent strategies
  • G. Winskel
  • Computer Science
    Formal Aspects of Computing
  • 2012
TLDR
It is shown that deterministic strategies in a game can be identified with certain subgames, with the benefit that the bicategory of deterministic games becomes equivalent to a technically-simpler order-enriched category.
Making Concurrency Functional
The article bridges between two major paradigms in computation, the functional, at basis computation from input to output, and the interactive, where computation reacts to its environment while
The Winning Ways of Concurrent Games
TLDR
A positive answer to the question of whether concurrent games with winning conditions are determined is given when the games are well-founded and satisfy a structural property, race-freedom, which prevents one player from interfering with the moves available to the other.
Bicategories of Concurrent Games - (Invited Paper)
TLDR
A bicategory of deterministic "linear" strategies, a recently discovered model of MALL (multiplicative-additive linear logic), is described, and all the bicategories become equivalent to simpler order-enriched categories when restricted to deterministic strategies.
Token Machines for Multiport Interaction Combinators
TLDR
The authors are currently engaged in defining and studying a Geometry of Interaction model for multiport interaction combinators, a concurrent extensions of Lafont’s interaction combinator, and the talk will be about this ongoing work.
Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information
  • G. Winskel
  • Computer Science
    Logic and Program Semantics
  • 2012
TLDR
The consequences of extending concurrent games with (1) winning, losing and, implicitly, neutral configurations, and (2) access levels, to address situations where Player or Opponent have imperfect information as to what has occurred in the game are explored.
...
...

References

SHOWING 1-10 OF 45 REFERENCES
A Game Semantics of the Asynchronous π-Calculus
TLDR
A simple game semantics of the typed asynchronous π-calculus is described, placing it within a rich hierarchy of games models for programming languages, and it is shown that the denotations of processes are equivalent, via this correspondence, to their sets of traces.
Timeless Games
TLDR
A bridge is constructed that goes from a dynamic model to a static model of evaluation, giving a closer link with the games model for the interpretation of syntax.
Games and full completeness for multiplicative linear logic
TLDR
It is shown that this semantics yields a categorical model of Linear Logic and proves full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net.
Angelic semantics of fine-grained concurrency
Concurrent games and full completeness
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an
Stability and Sequentiality in Dataflow Networks
TLDR
The class of monotone input/output automata has been shown to be a useful operational model for a dataflow-style networks of communicating processes, and classes of determinate automata that compute stable and sequential functions are characterized.
Typed Event Structures and the p-Calculus
Sequentiality vs. concurrency in games and logic
  • S. Abramsky
  • Computer Science, Philosophy
    Mathematical Structures in Computer Science
  • 2003
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.
Representation of Computations in Concurrent Automata by Dependence Orders
...
...