Hostname: page-component-6bf8c574d5-8gtf8 Total loading time: 0 Render date: 2025-02-21T04:30:58.447Z Has data issue: false hasContentIssue false
  • English
  • Français

Properties of co-operations: diagrammatic proofs

Published online by Cambridge University Press:  30 October 2012

PIERRE RANNOU
PIERRE RANNOU*
Affiliation:
Institut de Mathématiques de Luminy, UMR 6206 du CNRS, Université de la Méditerranée (Aix-Marseille 2), France Email: rannou@iml.univ-mrs.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We propose an alternative approach, based on diagram rewriting, for computations in bialgebras. We illustrate this graphical syntax by proving some properties of co-operations, including coassociativity and cocommutativity. This amounts to checking the confluence of some rewriting systems.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 22 , Issue 6: CAMCAD '09 Commutativity of Algebraic Diagrams , December 2012 , pp. 970 - 986
Copyright
Copyright © Cambridge University Press 2012

References

Références

Ehrhard, T. and Regnier, L. (2006) Differential interaction nets. Theorical Computer Science 364 166–195.CrossRefGoogle Scholar
Lafont, Y. (1997) Interaction combinators. Information and Computation 137 69–101.CrossRefGoogle Scholar
Lafont, Y. (2003) Towards an algebraic theory of boolean circuits. Journal of Pure and Applied Algebra 184 257–310.CrossRefGoogle Scholar
Lafont, Y. (2010) Diagram rewriting and operads. In: Loday, J. L. and Vallette, B. (ed.) Operads 2009. Séminaires et Congrès 26, SMF 163–179.Google Scholar
Loday, J. L. (2008) Generalized bialgebras and triples of operads. Astérisque 320.Google Scholar