Imperative Programs as Proofs via Game Semantics

Game semantics extends the Curry-Howard isomorphism to a three-way correspondence: proofs, programs, strategies. But the universe of strategies goes beyond intuitionistic logics and lambda calculus, to capture stateful programs. In this paper we describe a logical counterpart to this extension, in which proofs denote such strategies. We can embed intuitionistic first-order linear logic into this system, as well as an imperative total programming language. The logic makes explicit use of the fact that in the game semantics the exponential can be expressed as a final co algebra. We establish a full completeness theorem for our logic, showing that every bounded strategy is the denotation of a proof.

[1]  Nicolas Tabareau,et al.  An explicit formula for the free exponential modality of linear logic , 2009, Mathematical Structures in Computer Science.

[2]  Samson Abramsky.  Axioms for definability and full completeness , 2000, Proof, Language, and Interaction.

[3]  Samson Abramsky,et al.  A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[4]  James Laird.  A Categorical Semantics of Higher Order Store , 2002, CTCS.

[5]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 2000, Inf. Comput..

[6]  Jean-Yves Girard,et al.  Locus Solum: From the rules of logic to the logic of rules , 2001, Mathematical Structures in Computer Science.

[7]  Paul-André Melliès.  CATEGORICAL SEMANTICS OF LINEAR LOGIC , 2009 .

[8]  James Laird,et al.  Full abstraction for functional languages with control , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[9]  John Longley.  Some Programming Languages Suggested by Game Models (Extended Abstract) , 2009, MFPS.

[10]  Jack A. Laird.  A calculus of coroutines , 2006, Theor. Comput. Sci..

[11]  Giorgi Japaridze,et al.  Introduction to computability logic , 2003, Ann. Pure Appl. Log..

[12]  Nicholas Wolverson,et al.  Game semantics for an object-oriented language , 2009 .

[13]  Thierry Coquand,et al.  A semantics of evidence for classical arithmetic , 1995, Journal of Symbolic Logic.

[14]  Jean-Marc Andreoli.  Focussing and proof construction , 2001, Ann. Pure Appl. Log..

[15]  M. Hyland,et al.  Games on graphs and sequentially realizable functionals. Extended abstract , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[16]  G. M. Kelly,et al.  A note on actions of a monoidal category. , 2001 .

[17]  James Laird.  Locally Boolean domains , 2005, Theor. Comput. Sci..

[18]  Samson Abramsky,et al.  Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..

[19]  James Laird,et al.  A Logic of Sequentiality , 2010, CSL.

[20]  Olivier Laurent.  Classical isomorphisms of types , 2005, Math. Struct. Comput. Sci..

[21]  John C. Reynolds,et al.  The essence of ALGOL , 1997 .

[22]  Matthias Felleisen,et al.  Fully Abstract Semantics for Observably Sequential Languages , 1994, Inf. Comput..

[23]  Nicolas Tabareau,et al.  Resource modalities in tensor logic , 2010, Ann. Pure Appl. Log..

[24]  Pierre Clairambault,et al.  Least and Greatest Fixpoints in Game Semantics , 2009, FICS.

[25]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[26]  Martin Hyland.  Semantics and Logics of Computation: Game Semantics , 1997 .

[27]  François Lamarche.  Games semantics for full propositional linear logic , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[28]  Olivier Laurent.  Polarized games , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[29]  Pierre-Louis Curien.  On the Symmetry of Sequentiality , 1993, MFPS.

[30]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[31]  Paul-André Melliès.  Asynchronous games 4: a fully complete model of propositional linear logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[32]  Olivier Laurent.  Game semantics for first-order logic , 2010, Log. Methods Comput. Sci..

[33]  Paul-André Melliès,et al.  Game Semantics in String Diagrams , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[34]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..