Rewriting modulo symmetric monoidal structure

• Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 710 - 719
• Main Authors: Bonchi, Filippo, Gadducci, Fabio, Kissinger, Aleks, Sobociński, Paweł, Zanasi, Fabio
• Format: Conference Proceeding
• Language: English
• Published: New York, NY, USA ACM 05.07.2016
• Series: ACM Conferences
• Subjects: Theory of computation > Design and analysis of algorithms
• ISBN: 9781450343916; 1450343910
• DOI: 10.1145/2933575.2935316

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and control theory. An important role in many such approaches is played by equational theories of diagrams, typically oriented and applied as rewrite rules. This paper lays a comprehensive foundation for this form of rewriting. We interpret diagrams combinatorially as typed hypergraphs and establish the precise correspondence between diagram rewriting modulo the laws of SMCs on the one hand and double pushout (DPO) rewriting of hypergraphs, subject to a soundness condition called convexity, on the other. This result rests on a more general characterisation theorem in which we show that typed hypergraph DPO rewriting amounts to diagram rewriting modulo the laws of SMCs with a chosen special Frobenius structure. We illustrate our approach with a proof of termination for the theory of non-commutative bimonoids.