Cubical coherent confluence, cubical $ω$-groupoids and the cube equation
By: Philippe Malbos, Tanguy Massacrier, Georg Struth
Potential Business Impact:
Proves math rules using a new shape system.
We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical polygraphic resolutions of convergent rewriting systems. Within this categorical framework, we establish cubical proofs of fundamental rewriting results -- Newman's lemma, the Church-Rosser theorem, and Squier's coherence theorem -- via the pasting of cubical coherence cells. We moreover derive, in purely categorical terms, the cube law known from the $λ$-calculus and Garside theory. As a consequence, we show that every convergent abstract rewriting system freely generates an acyclic cubical groupoid, in which higher-dimensional generators can be replaced by degenerate cells beyond dimension two.
Similar Papers
Cubical coherent confluence, $ω$-groupoids and the cube equation
Logic in Computer Science
Makes math rules work like building blocks.
Computational Paths Form a Weak ω-Groupoid
Logic in Computer Science
Makes computer math proofs have clear, step-by-step answers.
Confluence of Conditional Rewriting Modulo
Logic in Computer Science
Makes computer math rules work better for tricky problems.