Skip to main content Accessibility help
×
×
Home

The structure of first-order causality

  • SAMUEL MIMRAM (a1)
Abstract

Game semantics describe the interactive behaviour 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 characterise definable strategies, that is, strategies that 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. In this paper we present an original methodology to achieve this task, which requires a combination of 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 using generators and relations: these strategies can be generated from a finite set of atomic strategies, and the equality between strategies admits a finite axiomatisation, and this equational structure corresponds to a polarised variation of the bialgebra notion. The work described in this paper thus forms a bridge between algebra and denotational semantics in order to reveal the structure of dependencies induced by first-order quantifiers, and lays the foundations for a mechanised analysis of causality in programming languages.

Copyright
References
Hide All
Baez, J. and Langford, L. (2003) Higher-dimensional algebra IV: 2-tangles. Advances in Mathematics 180 (2)705764.
Burroni, A. (1993) Higher-dimensional word problems with applications to equational logic. Theoretical Computer Science 115 (1)4362.
Ghica, D. (2007) Geometry of synthesis: a structured approach to VLSI design. In: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, ACM 375.
Hintikka, J. and Sandu, G. (1997) Game-theoretical semantics. In: ter Meulen, A. and van Benthem, J. (eds.) Handbook of Logic and Language, Elsevier 361410.
Hyland, M. and Ong, L. (2000) On Full Abstraction for PCF: I, II, III. Information and Computation 163 (2)285408.
Hyland, M. and Power, J. (2000) Symmetric Monoidal Sketches. In: Proceedings of PPDP'00 280–288.
Hyland, M. and Schalk, A. (2002) Games on Graphs and Sequentially Realizable Functionals. Proceedings of the 17th IEEE Symposium on Logic in Computer Science 257–264.
Joyal, A. and Street, R. (1991) The Geometry of Tensor Calculus, I. Advances in Mathematics 88 55113.
Lack, S. (2004) Composing PROPs. Theory and Applications of Categories 13 (9)147163.
Lafont, Y. (1995) Equational Reasoning with 2-Dimensional Diagrams. Term Rewriting 170–195.
Lafont, Y. (2003) Towards an Algebraic Theory of Boolean Circuits. J. Pure Appl. Algebra 184 (2-3)257310.
Lawvere, F. W. (1963) Functorial Semantics of Algebraic Theories and Some Algebraic Problems in the context of Functorial Semantics of Algebraic Theories, Ph.D. thesis, Columbia University.
Mac Lane, S. (1965) Categorical Algebra. Bulletin of the American Mathematical Society 71 40106.
Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics, Springer-Verlag.
Massol, A. (1997) Minimality of the system of seven equations for the category of finite sets. Theoretical Computer Science 176 (1-2)347353.
Melliès, P.-A. and Mimram, S. (2007) Asynchronous Games: Innocence without Alternation. In: Proceedings of CONCUR'05. Springer-Verlag Lecture Notes in Computer Science 4703 395411.
Mimram, S. (2008) Sémantique des jeux asynchrones et réécriture 2-dimensionnelle, Ph.D. thesis, Université Paris Diderot.
Mimram, S. (2010) Computing critical pairs in 2-dimensional rewriting systems. In: Lynch, C. (ed.) Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 10, 11-13 July 2010, Edinburgh. Leibniz International Proceedings in Informatics (LIPIcs) 6, Schloss Dagstuhl – Leibniz-Center for Informatics gGmbH, Dagstuhl Publishing 227–242.
Pirashvili, T. (2002) On the PROP Corresponding to Bialgebras. Cah. Top. Géom. Diff. Cat. 43 (3)221239.
Schanuel, S. and Street, R. (1986) The Free Adjunction. Cahiers de Topologie et Géométrie Différentielle Catégoriques 27 (1)8183.
Street, R. (1976) Limits indexed by category-valued 2-functors. J. Pure Appl. Algebra 8 (2)149181.
Winskel, G. (1987) Event Structures. Advances in Petri Nets 255 325392.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed