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.
Supplemental Material
- Samson Abramsky, Radha Jagadeesan, and Pasquale Malacaria. 2000. Full Abstraction for PCF. Information and Computation 163, 2 (2000), 409–470. Google Scholar
Digital Library
- Jean Bénabou. 1967. Introduction to bicategories. Number 40 in Lecture Notes in Mathematics. Springer Verlag, 1–77.Google Scholar
- Jean Bénabou. 1985. Fibered Categories and the Foundations of Naive Category Theory. Journal of Symbolic Logic 50, 1 (1985), 10–37.Google Scholar
Cross Ref
- Simon Castellan and Nobuko Yoshida. 2019. The two sides of the same coin: Session Types and Game Semantics. In Accepted for publication at POPL’19. Google Scholar
Digital Library
- Marcelo Fiore, Nicola Gambino, Martin Hyland, and Glynn Winskel. 2008. The cartesian closed bicategory of generalised species of structures. Journal of the London Mathematical Society 77 (2008), 203–220.Google Scholar
Cross Ref
- Richard Garner. 2006. Polycategories. Ph.D. Dissertation. University of Cambridge.Google Scholar
- Dan R. Ghica and Mohamed N. Menaa. 2011. Synchronous Game Semantics via Round Abstraction. In Foundations of Software Science and Computational Structures, Martin Hofmann (Ed.). Springer Verlag, 350–364. Google Scholar
Digital Library
- Jean-Yves Girard. 1987. Linear Logic. Theoretical Computer Science 50 (1987), 1–101. Google Scholar
Digital Library
- Russell Harmer. 1999. Games and Full Abstraction for Nondeterministic Languages. Ph.D. Dissertation. Imperial College of Science, London.Google Scholar
- Russell Harmer, Martin Hyland, and Paul-André Melliès. 2007. Categorical Combinatorics for Innocent Strategies. In Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society, 379–388. Google Scholar
Digital Library
- André Hirschowitz, Michel Hirschowitz, and Tom Hirschowitz. 2007. A Theory for Game Theories. In Proceedings of the 27th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (LNCS), Vol. 4855. Springer Verlag, 192–203. Google Scholar
Digital Library
- Martin Hyland and Luke Ong. 2000. On Full Abstraction for PCF. Information and Computation 163, 2 (2000), 285–408. Google Scholar
Digital Library
- Martin Hyland and Andrea Schalk. 1999. Abstract Games for Linear Logic. In Proceedings of Category Theory in Computer Science (CTCS) (Electronic Notes in Theoretical Computer Science), Vol. 29.Google Scholar
- Martin Hyland and Andrea Schalk. 2003. Glueing and Orthogonality for Models of Linear Logic. Theoretical Computer Science 294, 1-2 (2003), 183–231. Google Scholar
Digital Library
- Paul-André Melliès. 2006. Asynchronous games 2: the true concurrency of innocence. Theoretical Computer Science 358, 2-3 (2006), 200–228. Google Scholar
Digital Library
- Paul-André Melliès and Samuel Mimram. 2007. Asynchronous Games: Innocence Without Alternation. In 18th International Conference on Concurrency Theory (CONCUR 2007). 395–411. Google Scholar
Digital Library
- Paul-André Melliès and Samuel Mimram. 2008. From Asynchronous Games to Concurrent Games. (2008). Unpublished manuscript. Available on the author’s webpage.Google Scholar
- Paul-André Melliès and Léo Stefanesco. 2018. An Asynchronous Soundness Theorem for Concurrent Separation Logic. In Proceedings of LICS 2018. Google Scholar
Digital Library
- Sylvain Rideau and Glynn Winskel. 2011. Asynchronous Strategies. In Proceedings of the 26th Annual Symposium on Logic in Computer Science (LICS). IEEE, 409–418.Google Scholar
- Peter Selinger. 1999. Categorical Structure of Asynchrony. In Proceedings of Mathematical Foundations of Programming Semantics (MFPS 15) (Electronic Notes in Theoretical Computer Science), Vol. 20. Elsevier, 158–181.Google Scholar
Cross Ref
- Glynn Winskel. 1986. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency (Lecture Notes in Computer Science), Vol. 255. Springer Verlag, 325–392. Google Scholar
Digital Library
Index Terms
Categorical combinatorics of scheduling and synchronization in game semantics
Recommendations
Categorical Combinatorics for Innocent Strategies
LICS '07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer ScienceWe show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former distributing over the latter. Innocent strategies are the maps in the induced ...
Imperative Programs as Proofs via Game Semantics
LICS '11: Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer ScienceGame semantics extends the Curry-Howard isomorphism to a three-way correspondence: proofs, programs, strategies. But the universe of strategies goes beyond intuitionistic logics and lambda calculus, to capture stateful programs. In this paper we ...
Refinement-Based Game Semantics for Certified Abstraction Layers
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer ScienceFormal methods have advanced to the point where the functional correctness of various large system components has been mechanically verified. However, the diversity of semantic models used across projects makes it difficult to connect these component to ...






Comments