Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics

Abstract

International audienceRecent developments of game semantics have given rise to new models of concurrent languages. On the one hand, an approach based on string diagrams has given models of CCS and the π-calculus, and on the other hand, Tsukada and Ong have designed a games model for a non-deterministic λ-calculus. There is an obvious, shallow relationship between the two approaches, as they both define innocent strategies as sheaves for a Grothendieck topology embedding " views " into " plays ". However, the notions of views and plays differ greatly between the approaches: Tsukada and Ong use notions from standard game semantics, while the authors of this paper use string diagrams. We here aim to bridge this gap by showing that even though the notions of plays, views, and innocent strategies differ, it is mostly a matter of presentation