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

Abstract : 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.
Type de document :
Communication dans un congrès
Second International Conference on Formal Structures for Computation and Deduction, FSCD 2017, Sep 2017, Oxford, United Kingdom. 12, pp.1 - 12, 〈10.4230/LIPIcs.FSCD.2017.12〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01886926
Contributeur : Pierre Clairambault <>
Soumis le : mercredi 3 octobre 2018 - 13:32:43
Dernière modification le : vendredi 5 octobre 2018 - 01:16:32

Fichier

LIPIcs-FSCD-2017-12.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

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. 12, pp.1 - 12, 〈10.4230/LIPIcs.FSCD.2017.12〉. 〈hal-01886926〉

Partager

Métriques

Consultations de la notice

19

Téléchargements de fichiers

10