Abstract / Description of output
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.
Original language | English |
---|---|
Pages (from-to) | 117-134 |
Number of pages | 18 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 249 |
DOIs | |
Publication status | Published - 2009 |
Keywords / Materials (for Non-textual outputs)
- FPC
- Game semantics
- sequential data structures