The Parallel Intensionally Fully Abstract Games Model of PCF

Abstract : We describe a framework for truly concurrent game semantics of programming languages, based on Rideau and Winskel's concurrent games on event structures. The model supports a notion of innocent strategy that permits concurrent and non-deterministic behaviour, but which coincides with traditional Hyland-Ong innocent strategies if one restricts to the deterministic sequential case. In this framework we give an alternative interpretation of Plotkin's PCF, that takes advantage of the concurrent nature of strategies and formalizes the idea that although PCF is a sequential language, certain sub-computations are independent and can be computed in a parallel fashion. We show that just as Hyland and Ong's sequential interpretation of PCF, our parallel interpretation yields a model that is intensionally fully abstract for PCF.
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01286477
Contributor : Pierre Clairambault <>
Submitted on : Thursday, March 10, 2016 - 6:44:51 PM
Last modification on : Thursday, October 4, 2018 - 1:15:42 AM
Document(s) archivé(s) le : Sunday, November 13, 2016 - 3:20:13 PM

File

lics15.pdf
Files produced by the author(s)

Identifiers

Citation

Simon Castellan, Pierre Clairambault, Glynn Winskel. The Parallel Intensionally Fully Abstract Games Model of PCF. Thirtieth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS), Jul 2015, Kyoto, Japan. ⟨10.1109/LICS.2015.31⟩. ⟨hal-01286477⟩

Share

Metrics

Record views

190

Files downloads

105