Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Games and full abstraction for FPC
Information and Computation - Special issue: LICS 1996—Part 1
On the Symmetry of Sequentiality
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Comparing hierarchies of types in models of linear logic
Information and Computation
Theoretical Computer Science - Applied semantics: Selected topics
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Categorical Combinatorics for Innocent Strategies
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Infinite sets that admit fast exhaustive search
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
The Lambda Lambda-Bar calculus: a dual calculus for unconstrained strategies
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
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.