Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Axioms for definability and full completeness
Proof, language, and interaction
On full abstraction for PCF: I, II, and III
Information and Computation
Games on Graphs and Sequentially Realizable Functionals
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On the Symmetry of Sequentiality
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Games Semantics for Full Propositional Linear Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Theoretical Computer Science - Applied semantics: Selected topics
Some Programming Languages Suggested by Game Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
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 |
Game semantics has been used to interpret both proofs and functional programs: an important further development on the programming side has been to model higher-order programs with state by allowing strategies with "history-sensitive" behaviour. In this paper, we develop a detailed analysis of the structure of these strategies from a logical perspective by showing that they correspond to proofs in a new kind of affine logic. We describe the semantics of our logic formally by giving a notion of categorical model and an instance based on a simple category of games. Using further categorical properties of this model, we prove a full completeness result: each total strategy is the semantics of a unique cut-free core proof in the system. We then use this result to derive an explicit cut-elimination procedure.