Innocent Strategies are Sheaves over Plays - Deterministic, Non-deterministic and Probabilistic Innocence

Although the HO/N games are fully abstract for PCF, the traditional notion of innocence (which underpins these games) is not satisfactory for such language features as non-determinism and probabilistic branching, in that there are stateless terms that are not innocent. Based on a category of P-visible plays with a notion of embedding as morphisms, we propose a natural generalisation by viewing innocent strategies as sheaves over (a site of) plays, echoing a slogan of Hirschowitz and Pous. Our approach gives rise to fully complete game models in each of the three cases of deterministic, nondeterministic and probabilistic branching. To our knowledge, in the second and third cases, ours are the first such factorisation-free constructions.

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

[2]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[3]  Hanno Nickau.  Hereditarily Sequential Functionals , 1994, LFCS.

[4]  Steven J. Vickers,et al.  Presenting Dcpos and Dcpo Algebras , 2008, MFPS.

[5]  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..

[6]  Glynn Winskel,et al.  Concurrent Strategies , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[7]  A. Beilinson.  p-adic periods and derived de Rham cohomology , 2011, 1102.1294.

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

[9]  Tom Hirschowitz,et al.  Innocent Strategies as Presheaves and Interactive Equivalences for CCS , 2011, Sci. Ann. Comput. Sci..

[10]  Russell Harmer,et al.  A fully abstract game semantics for finite nondeterminism , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

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

[12]  J. Verdier.  Fonctorialite des categories de faisceaux , 1972 .

[13]  Vincent Danos,et al.  Probabilistic game semantics , 2002, TOCL.

[14]  C.-H. Luke Ong,et al.  Compositional higher-order model checking via ω-regular games over Böhm trees , 2014, CSL-LICS.

[15]  Tom Hirschowitz,et al.  Fully-abstract concurrent games for pi , 2013, ArXiv.

[16]  Glynn Winskel,et al.  On the Expressivity of Symmetry in Event Structures , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[17]  S. Lane,et al.  Sheaves In Geometry And Logic , 1992 .