The Parallel Intensionally Fully Abstract Games Model of PCF - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
lics15.pdf (379.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01286477 , version 1 (10-03-2016)

Identifiers

Cite

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⟩
178 View
106 Download

Altmetric

Share

Gmail Facebook X LinkedIn More