Skip to Main content Skip to Navigation
Conference papers

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
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Pierre Clairambault <>
Submitted on : Wednesday, October 3, 2018 - 1:32:43 PM
Last modification on : Friday, June 25, 2021 - 3:40:06 PM
Long-term archiving on: : Friday, January 4, 2019 - 2:30:59 PM


Publisher files allowed on an open archive



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⟩



Record views


Files downloads