Polarized games

We generalize the intuitionistic Hyland-Ong games to a notion of polarized games allowing games with plays starting by proponent moves. The usual constructions on games are adjusted to fit this setting yielding a game model for polarized linear logic with a definability result. As a consequence this gives a complete game model for various classical systems: LC, /spl lambda//spl mu/-calculus,... for both call-by-name and call-by-value evaluations.

[1]  Paul Blain Levy,et al.  Call-by-push-value , 2022, ACM SIGLOG News.

[2]  Vincent Danos,et al.  A new deconstructive logic: linear logic , 1997, Journal of Symbolic Logic.

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

[4]  Jean-Yves Girard.  Locus Solum: From the Rules of Logic to the Logic of Rules , 2001, CSL.

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

[6]  Vincent Danos,et al.  The Anatomy of Innocence , 2001, CSL.

[7]  AbramskySamson,et al.  Games and full completeness for multiplicative linear logic , 1994 .

[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]  Martin Hyland,et al.  Designs, Disputes and Strategies , 2002, CSL.

[10]  Olivier Laurent,et al.  Étude de la polarisation en logique , 2001 .

[11]  Hugo Herbelin,et al.  The duality of computation , 2000, ICFP '00.

[12]  Olivier Laurent.  Polarized Proof-Nets and Lambda µ-Calculus , 1999 .

[13]  Edmund Robinson,et al.  Premonoidal categories and notions of computation , 1997, Mathematical Structures in Computer Science.

[14]  Nobuko Yoshida,et al.  Game-Theoretic Analysis of Call-by-Value Computation , 1999, Theor. Comput. Sci..

[15]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[16]  Peter W. O'Hearn,et al.  Linear Continuation-Passing , 2002, High. Order Symb. Comput..

[17]  Thomas Ehrhard,et al.  Believe it or not, AJM's games model is a model of classical linear logic , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[18]  C.-H. Luke Ong,et al.  A Curry-Howard foundation for functional computation with control , 1997, POPL '97.

[19]  Vincent Danos.  La Logique Linéaire appliquée à l'étude de divers processus de normalisation (principalement du Lambda-calcul) , 1990 .

[20]  Vincent Danos,et al.  LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication , 1995 .

[21]  Michel Parigot,et al.  Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

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

[23]  Radha Jagadeesan,et al.  Games and full completeness for multiplicative linear logic , 1992, Journal of Symbolic Logic.

[24]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[25]  Samson Abramsky,et al.  Concurrent games and full completeness , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[26]  Guy McCusker.  Games and Full Abstraction for a Functional Metalanguage with Recursive Types , 1998, Distinguished Dissertations.

[27]  Paul Blain Levy,et al.  Call-by-Push-Value: A Subsuming Paradigm , 1999, TLCA.

[28]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[29]  Samson Abramsky,et al.  Call-by-Value Games , 1997, CSL.

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

[31]  James Laird.  A Game Semantics of Linearly Used Continuations , 2003, FoSSaCS.

[32]  Peter Selinger,et al.  Control categories and duality: on the categorical semantics of the lambda-mu calculus , 2001, Mathematical Structures in Computer Science.

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

[34]  Russell Harmer.  Games and full abstraction for non-deterministic languages , 1999 .

[35]  Samson Abramsky,et al.  Full Abstraction for Idealized Algol with Passive Expressions , 1999, Theor. Comput. Sci..

[36]  Samson Abramsky.  Semantics of Interaction (Abstract) , 1996, CAAP.