Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or

Résumé

Although Plotkin's parallel-or is inherently deterministic, it has a non-deterministic interpretation in games based on (prime) event structures-in which an event has a unique causal history-because they do not directly support disjunctive causality. General event structures can express disjunctive causality and have a more permissive notion of determinism, but do not support hiding. We show that (structures equivalent to) deterministic general event structures do support hiding, and construct a new category of games based on them with a deterministic interpretation of aPCFpor, an affine variant of PCF extended with parallel-or. We then exploit this deterministic interpretation to give a relaxed notion of determinism (observable determinism) on the plain event structures model. Putting this together with our previously introduced concurrent notions of well-bracketing and innocence, we obtain an intensionally fully abstract model of aPCFpor.
Fichier principal
Vignette du fichier
LIPIcs-FSCD-2017-12.pdf (655.35 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01886926 , version 1 (03-10-2018)

Identifiants

Citer

Simon Castellan, Pierre Clairambault, Glynn Winskel. Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. Second International Conference on Formal Structures for Computation and Deduction, FSCD 2017, Sep 2017, Oxford, United Kingdom. pp.1 - 12, ⟨10.4230/LIPIcs.FSCD.2017.12⟩. ⟨hal-01886926⟩
129 Consultations
59 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More