Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-19T11:04:28.740Z Has data issue: false hasContentIssue false
  • English
  • Français

The structure of first-order causality

Published online by Cambridge University Press:  24 January 2011

SAMUEL MIMRAM
SAMUEL MIMRAM*
Affiliation:
CEA LIST, Laboratory for the Modelling and Analysis of Interacting Systems, Point Courrier 94, 91191 Gif-sur-Yvette, France Email: samuel.mimram@cea.fr
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 21 , Issue 1 , February 2011 , pp. 65 - 110
Copyright
Copyright © Cambridge University Press 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Baez, J. and Langford, L. (2003) Higher-dimensional algebra IV: 2-tangles. Advances in Mathematics 180 (2)705–764.CrossRefGoogle Scholar
Burroni, A. (1993) Higher-dimensional word problems with applications to equational logic. Theoretical Computer Science 115 (1)43–62.CrossRefGoogle Scholar
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.Google Scholar
Hintikka, J. and Sandu, G. (1997) Game-theoretical semantics. In: ter Meulen, A. and van Benthem, J. (eds.) Handbook of Logic and Language, Elsevier 361–410.CrossRefGoogle Scholar
Hyland, M. and Ong, L. (2000) On Full Abstraction for PCF: I, II, III. Information and Computation 163 (2)285–408.CrossRefGoogle Scholar
Hyland, M. and Power, J. (2000) Symmetric Monoidal Sketches. In: Proceedings of PPDP'00 280–288.CrossRefGoogle Scholar
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.Google Scholar
Joyal, A. and Street, R. (1991) The Geometry of Tensor Calculus, I. Advances in Mathematics 88 55–113.CrossRefGoogle Scholar
Lack, S. (2004) Composing PROPs. Theory and Applications of Categories 13 (9)147–163.Google Scholar
Lafont, Y. (1995) Equational Reasoning with 2-Dimensional Diagrams. Term Rewriting 170–195.CrossRefGoogle Scholar
Lafont, Y. (2003) Towards an Algebraic Theory of Boolean Circuits. J. Pure Appl. Algebra 184 (2-3)257–310.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Mac Lane, S. (1965) Categorical Algebra. Bulletin of the American Mathematical Society 71 40–106.CrossRefGoogle Scholar
Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics, Springer-Verlag.CrossRefGoogle Scholar
Massol, A. (1997) Minimality of the system of seven equations for the category of finite sets. Theoretical Computer Science 176 (1-2)347–353.CrossRefGoogle Scholar
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 395–411.CrossRefGoogle Scholar
Mimram, S. (2008) Sémantique des jeux asynchrones et réécriture 2-dimensionnelle, Ph.D. thesis, Université Paris Diderot.Google Scholar
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.Google Scholar
Pirashvili, T. (2002) On the PROP Corresponding to Bialgebras. Cah. Top. Géom. Diff. Cat. 43 (3)221–239.Google Scholar
Schanuel, S. and Street, R. (1986) The Free Adjunction. Cahiers de Topologie et Géométrie Différentielle Catégoriques 27 (1)81–83.Google Scholar
Street, R. (1976) Limits indexed by category-valued 2-functors. J. Pure Appl. Algebra 8 (2)149–181.CrossRefGoogle Scholar
Winskel, G. (1987) Event Structures. Advances in Petri Nets 255 325–392.Google Scholar