Justified sequences in string diagrams - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Justified sequences in string diagrams

Résumé

We compare two approaches to concurrent game semantics, one by Tsukada and Ong for a simply-typed λ-calculus and the other by the authors and collaborators for CCS and the π-calculus. The two approaches are obviously related, as they both define strategies as sheaves for the Grothendieck topology induced by embedding ‘views’ into ‘plays’. However, despite this superficial similarity, the notions of views and plays differ significantly: the former is based on standard justified sequences, the latter uses string diagrams. In this paper, we relate both approaches at the level of plays. Specifically, we design a notion of play (resp. view) for the simply-typed λ-calculus, based on string diagrams as in our previous work, into which we fully embed Tsukada and Ong's plays (resp. views). We further provide a categorical explanation of why both notions yield essentially the same model, thus demonstrating that the difference is a matter of presentation. In passing, we introduce an abstract framework for producing sheaf models based on string diagrams, which unifies our present and previous models.
Fichier principal
Vignette du fichier
article2.pdf (778.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01372582 , version 1 (27-09-2016)

Identifiants

  • HAL Id : hal-01372582 , version 1

Citer

Clovis Eberhart, Tom Hirschowitz. Justified sequences in string diagrams: A comparison between two approaches to concurrent game semantics. 2016. ⟨hal-01372582⟩
118 Consultations
115 Téléchargements

Partager

Gmail Facebook X LinkedIn More