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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01886926
Contributor : Pierre Clairambault <>
Submitted on : Wednesday, October 3, 2018 - 1:32:43 PM
Last modification on : Monday, April 15, 2019 - 9:40:31 AM
Document(s) archivé(s) le : Friday, January 4, 2019 - 2:30:59 PM

File

LIPIcs-FSCD-2017-12.pdf
Publisher files allowed on an open archive

Identifiers

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

Share

Metrics

Record views

52

Files downloads

32