Categorical combinatorics of scheduling and synchronization in game semantics
Open Access
- 2 January 2019
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 3 (POPL) , 1-30
Abstract
Game semantics is the art of interpreting types as games and programs as strategies interacting in space and time with their environment. In order to reflect the interactive behavior of programs, strategies are required to follow specific scheduling policies. Typically, in the case of a purely sequential programming language, the program (Player) and its environment (Opponent) will play one after the other, in a strictly alternating way. On the other hand, in the case of a concurrent language, Player and Opponent will be allowed to play several moves in a row, in a non-alternating way. In both cases, the scheduling policy is designed very carefully in order to ensure that the strategies synchronize properly and compose well when plugged together. A longstanding conceptual problem has been to understand when and why a given scheduling policy works and is compositional in that sense. In this paper, we exhibit a number of simple and fundamental combinatorial structures 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. To that purpose, we choose to work at a very general level, and illustrate our method by constructing two template game models of linear logic with different flavors (alternating and non-alternating) using the same categorical combinatorics, performed in the category of small categories. As a whole, the paper may be seen as a hymn in praise of synchronization, building on the notion of synchronization algebra in process calculi and adapting it smoothly to programming language semantics, using a combination of ideas at the converging point of game semantics and of categorical algebra.Keywords
Funding Information
- European Research Council (670624)
This publication has 13 references indexed in Scilit:
- An Asynchronous Soundness Theorem for Concurrent Separation Logic2018
- The cartesian closed bicategory of generalised species of structuresJournal of the London Mathematical Society, 2007
- Categorical Combinatorics for Innocent Strategies2007
- Asynchronous games 2: The true concurrency of innocenceTheoretical Computer Science, 2006
- Glueing and orthogonality for models of linear logicTheoretical Computer Science, 2003
- Full Abstraction for PCFInformation and Computation, 2000
- On Full Abstraction for PCF: I, II, and IIIInformation and Computation, 2000
- Categorical Structure of AsynchronyElectronic Notes in Theoretical Computer Science, 1999
- Linear logicTheoretical Computer Science, 1987
- Fibered categories and the foundations of naive category theoryThe Journal of Symbolic Logic, 1985