TY - GEN
T1 - Categorical Coherence from Term Rewriting Systems
AU - Mimram, Samuel
N1 - Publisher Copyright:
© Samuel Mimram.
PY - 2023/6/1
Y1 - 2023/6/1
N2 - The celebrated Squier theorem allows to prove coherence properties of algebraic structures, such as MacLane’s coherence theorem for monoidal categories, based on rewriting techniques. We are interested here in extending the theory and associated tools simultaneously in two directions. Firstly, we want to take in account situations where coherence is partial, in the sense that it only applies for a subset of structural morphisms (for instance, in the case of the coherence theorem for symmetric monoidal categories, we do not want to strictify the symmetry). Secondly, we are interested in structures where variables can be duplicated or erased. We develop theorems and rewriting techniques in order to achieve this, first in the setting of abstract rewriting systems, and then extend them to term rewriting systems, suitably generalized in order to take coherence in account. As an illustration of our results, we explain how to recover the coherence theorems for monoidal and symmetric monoidal categories.
AB - The celebrated Squier theorem allows to prove coherence properties of algebraic structures, such as MacLane’s coherence theorem for monoidal categories, based on rewriting techniques. We are interested here in extending the theory and associated tools simultaneously in two directions. Firstly, we want to take in account situations where coherence is partial, in the sense that it only applies for a subset of structural morphisms (for instance, in the case of the coherence theorem for symmetric monoidal categories, we do not want to strictify the symmetry). Secondly, we are interested in structures where variables can be duplicated or erased. We develop theorems and rewriting techniques in order to achieve this, first in the setting of abstract rewriting systems, and then extend them to term rewriting systems, suitably generalized in order to take coherence in account. As an illustration of our results, we explain how to recover the coherence theorems for monoidal and symmetric monoidal categories.
KW - Lawvere theory
KW - coherence
KW - rewriting system
U2 - 10.4230/LIPIcs.FSCD.2023.16
DO - 10.4230/LIPIcs.FSCD.2023.16
M3 - Conference contribution
AN - SCOPUS:85165946898
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023
A2 - Gaboardi, Marco
A2 - van Raamsdonk, Femke
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023
Y2 - 3 July 2023 through 6 July 2023
ER -