A Logic of Sequentiality
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.
KeywordsGame semantics sequentiality full completeness
Unable to display preview. Download preview PDF.
- 1.Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: LICS 1998: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, p. 334. IEEE Computer Society, Washington (1998)Google Scholar
- 2.Abramsky, S.: Axioms for definability and full completeness. In: Proof, language, and interaction: essays in honour of Robin Milner, pp. 55–75 (2000)Google Scholar
- 4.Abramsky, S., McCusker, G.: Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions: Extended Abstract. Electronic Notes in Theoretical Computer Science 3, 2–14 (1996); Linear Logic 1996 Tokyo MeetingGoogle Scholar
- 6.Curien, P.-L.: On the symmetry of sequentiality. In: Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics, pp. 29–71. Springer, London (1994)Google Scholar
- 10.Hyland, M., Schalk, A.: Games on graphs and sequentially realizable functionals (extended abstract). In: Symposium on Logic in Computer Science, p. 257 (2002)Google Scholar
- 11.Janelidze, G., Kelly, G.M.: A note on actions of a monoidal category (2001)Google Scholar
- 13.Laird, J.: A categorical semantics of higher order store. In: Proceedings, 9th Conference on Category Theory and Computer Science, CTCS 2002. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2002)Google Scholar
- 14.Laird, J.: Locally Boolean domains. Theoretical Computer Science 342(1), 132–148 (2005); Applied Semantics: Selected TopicsGoogle Scholar
- 15.Laird, J.: Functional programs as coroutines: A semantic analysis. Logical Methods in Computer Science (to appear)Google Scholar
- 16.Lamarche, F.: Sequentiality, games and linear logic. In: Proceedings, CLICS workshop, Aarhus University. DAIMI-397–II (1992)Google Scholar
- 17.Lamarche, F.: Games semantics for full propositional linear logic. In: LICS, pp. 464–473 (1995)Google Scholar
- 18.Laurent, O.: Polarized games. In: Proceedings of 17th Annual IEEE Symposium on Logic in Computer Science, pp. 265–274 (2002)Google Scholar
- 19.Longley, J., Wolverson, N.: Eriskay: a programming language based on game semantics. In: Games for Logic and Programming Languages III Workshop (2008)Google Scholar
- 21.McCusker, G.: Games and full abstraction for FPC. In: Proceedings of Eleventh Annual IEEE Symposium on Logic in Computer Science, LICS 1996, July 1996, pp. 174–183 (1996)Google Scholar
- 22.Melliès, P.-A., Tabareau, N.: Resource modalities in tensor logic. Annals of Pure and Applied Logic 161(5), 632–653 (2010); The Third workshop on Games for Logic and Programming Languages (GaLoP), Galop 2008Google Scholar
- 23.Wolverson, N.: Game Semantics for an object-orientated language. PhD thesis, University of Edinburgh (2008)Google Scholar