2026-07-26T00:33:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8040 2024-03-06T10:39:38Z ddc:004 open_access

Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics Eberhart, Clovis Hirschowitz, Tom Concurrency Sheaves Presheaf models Game Semantics Recent 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 pi-calculus, and on the other hand, Tsukada and Ong have designed a games model for a non-deterministic lambda-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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Clovis Eberhart and Tom Hirschowitz 2017 Is Part Of LIPIcs, Volume 72, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CALCO.2017.10 urn:nbn:de:0030-drops-80407 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.10 eng https://creativecommons.org/licenses/by/3.0/legalcode