Rewriting in Gray categories with applications to coherence

DOI10.1017/S0960129522000299OpenAlexW3200330456MaRDI QIDQ5877242

Simon Forest, Samuel Mimram

Publication date: 10 February 2023

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.05369

zbMATH Keywords

coherencerewritingpolygraphGray category

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• Globular

Cites Work

• Higher-dimensional word problems with applications to equational logic
• Word problems and a homological finiteness condition for monoids
• Limits indexed by category-valued 2-functors
• A finiteness condition for rewriting systems
• Towards an algebraic theory of Boolean circuits.
• Formal category theory: Adjointness for 2-categories
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• Cofibrant objects among higher-dimensional categories
• Free Products of Higher Operad Algebras
• Higher-dimensional categories with finite derivation type
• Coherence in monoidal track categories
• Term Rewriting and All That
• Frobenius monads and pseudomonoids
• Coherence for tricategories
• Coherence in Three-Dimensional Category Theory
• Data structures for quasistrict higher categories
• Towards 3-Dimensional Rewriting Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item