License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2017.10
URN: urn:nbn:de:0030-drops-80407
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8040/
Go to the corresponding LIPIcs Volume Portal

Eberhart, Clovis ; Hirschowitz, Tom

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

pdf-format:
LIPIcs-CALCO-2017-10.pdf (0.6 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{eberhart_et_al:LIPIcs:2017:8040,
  author =	{Clovis Eberhart and Tom Hirschowitz},
  title =	{{Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics}},
  booktitle =	{7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
  pages =	{10:1--10:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-033-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{72},
  editor =	{Filippo Bonchi and Barbara K{\"o}nig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8040},
  URN =		{urn:nbn:de:0030-drops-80407},
  doi =		{10.4230/LIPIcs.CALCO.2017.10},
  annote =	{Keywords: Concurrency, Sheaves, Presheaf models, Game Semantics}
}

Keywords: Concurrency, Sheaves, Presheaf models, Game Semantics
Collection: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
Issue Date: 2017
Date of publication: 17.11.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI