TY - JOUR
T1 - Some Programming Languages Suggested by Game Models (Extended Abstract)
AU - Longley, John
N1 - Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009)
PY - 2009
Y1 - 2009
N2 - We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin's language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking.
AB - We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin's language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking.
KW - FPC
KW - Game semantics
KW - sequential data structures
UR - http://www.scopus.com/inward/record.url?scp=68549135068&partnerID=8YFLogxK
U2 - 10.1016/j.entcs.2009.07.087
DO - 10.1016/j.entcs.2009.07.087
M3 - Article
VL - 249
SP - 117
EP - 134
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
SN - 1571-0661
ER -