The Structure of First-Order Causality

Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order propositional logic. One of the main difficulties that has to be faced during the elaboration of this kind of semantics is to characterize definable strategies, that is strategies which actually behave like a proof. This is usually done by restricting the model to strategies satisfying subtle combinatorial conditions, whose preservation under composition is often difficult to show. Here, we present an original methodology to achieve this task, which requires to combine advanced tools from game semantics, rewriting theory and categorical algebra. We introduce a diagrammatic presentation of the monoidal category of definable strategies of our model, by the means of generators and relations: those strategies can be generated from a finite set of atomic strategies and the equality between strategies admits a finite axiomatization, this equational structure corresponding to a polarized variation of the notion of bialgebra. This work thus bridges algebra and denotational semantics in order to reveal the structure of dependencies induced by first-order quantifiers, and lays the foundations for a mechanized analysis of causality in programming languages.

[1]  S. Maclane,et al.  Categorical Algebra , 2007 .

[2]  A. Joyal,et al.  The geometry of tensor calculus, I , 1991 .

[3]  Teimuraz Pirashvili.  On the PROP corresponding to bialgebras , 2001 .

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

[5]  Dan R. Ghica,et al.  Geometry of synthesis: a structured approach to VLSI design , 2007, POPL '07.

[6]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[7]  S. Mimram.  Computing Critical Pairs in Polygraphs , 2009 .

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

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

[10]  Ross Street,et al.  The free adjunction , 1986 .

[11]  Yves Lafont.  Equational Reasoning with Two-Dimensional Diagrams , 1993, Term Rewriting.

[12]  F. W. Lawvere,et al.  Some algebraic problems in the context of functorial semantics of algebraic theories , 1968 .

[13]  Martin Hyland,et al.  Games on Graphs and Sequentially Realizable Functionals , 2002, LICS 2002.

[14]  Jaakko Hintikka,et al.  Game-Theoretical Semantics , 1997, Handbook of Logic and Language.

[15]  A. Massol.  Minimality of the System of Seven Equations for the Category of Finite Sets , 1997, Theor. Comput. Sci..

[16]  John Power,et al.  Symmetric monoidal sketches , 2000, PPDP '00.

[17]  Law Fw.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[18]  Samuel Mimram,et al.  Computing Critical Pairs in 2-Dimensional Rewriting Systems , 2010, RTA.

[19]  Yves Lafont,et al.  Towards an algebraic theory of Boolean circuits , 2003 .

[20]  Albert Burroni,et al.  Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..

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

[22]  Ross Street,et al.  Limits indexed by category-valued 2-functors , 1976 .

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

[24]  J. Hintikka,et al.  Game-Theoretical Semantics , 1997 .

[25]  John C. Baez,et al.  Higher-dimensional algebra IV: 2-tangles , 1998 .