Focusing in Asynchronous Games

Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically interested here in relating two such semantics of linear logic, of very different flavor, which both take in account concurrent features of the proofs: asynchronous games and concurrent games. Interestingly, we show that associating a concurrent strategy to an asynchronous strategy can be seen as a semantical counterpart of the focusing property of linear logic.

[1]  Jim Laird.  A Game Semantics of the Asynchronous π-Calculus , 2005 .

[2]  Andrzej S. Murawski,et al.  Angelic Semantics of Fine-Grained Concurrency , 2004, FoSSaCS.

[3]  Pierre-Louis Curien,et al.  A Semantic Characterization of Full Abstraction for Typed Lambda Calculi , 1984, FOCS.

[4]  Samuel Mimram.  Sémantique des jeux asynchrones et réécriture 2-dimensionnelle. (Asynchronous Game Semantics and 2-dimensional Rewriting Systems) , 2008 .

[5]  Paul-André Melliès,et al.  Asynchronous games 2: The true concurrency of innocence , 2006, Theor. Comput. Sci..

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

[7]  Andrzej S. Murawski,et al.  Applying Game Semantics to Compositional Software Modeling and Verification , 2004, TACAS.

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

[9]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[10]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

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

[12]  Samson Abramsky,et al.  Sequentiality vs. concurrency in games and logic , 2003, Mathematical Structures in Computer Science.

[13]  Dale Miller,et al.  Canonical Sequent Proofs via Multi-Focusing , 2008, IFIP TCS.

[14]  Samuel Mimram,et al.  Asynchronous Games: Innocence Without Alternation , 2007, CONCUR.

[15]  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).

[16]  Andreas Blass,et al.  Degrees of indeterminacy of games , 1972 .

[17]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

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

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