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 Plot kin'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.
Original language | English |
---|---|
Title of host publication | Proceedings - 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015 |
Pages | 232-243 |
Number of pages | 12 |
ISBN (Electronic) | 9781479988754 |
DOIs | |
Publication status | Published - 31 Jul 2015 |
Event | 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015 - Kyoto, Japan Duration: 6 Jul 2015 → 10 Jul 2015 |
Publication series
Name | Proceedings - Symposium on Logic in Computer Science |
---|---|
Volume | 2015-July |
ISSN (Print) | 1043-6871 |
Conference
Conference | 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015 |
---|---|
Country/Territory | Japan |
City | Kyoto |
Period | 6/07/15 → 10/07/15 |
Keywords
- games
- semantics
- computational modeling
- concurrent computing
- mathematical modelling
- programming language semantics
Fingerprint
Dive into the research topics of 'The parallel intensionally fully abstract games model of PCF'. Together they form a unique fingerprint.Profiles
-
Glynn Winskel
Person: Academic