Confluence of algebraic rewriting systems
From MaRDI portal
Publication:5879266
DOI10.1017/S0960129521000426OpenAlexW4206102136MaRDI QIDQ5879266
Philippe Malbos, Benjamin Dupont, Cyrille Chenavier
Publication date: 28 February 2023
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14361
Related Items
Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories ⋮ Coherent confluence modulo relations and double groupoids ⋮ Algebraic coherent confluence and higher globular Kleene algebras ⋮ Shuffle polygraphic resolutions for operads
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Higher-dimensional normalisation strategies for acyclicity
- The Knuth-Bendix algorithm and the conjugacy problem in monoids.
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- Complete rewriting systems and homology of monoid algebras
- Gröbner bases for operads
- A catalogue of complete group presentations
- Word problems and a homological finiteness condition for monoids
- The diamond lemma for ring theory
- Completion for rewriting modulo a congruence
- A finiteness condition for rewriting systems
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Convergent presentations and polygraphic resolutions of associative algebras
- Normalized rewriting: An alternative to rewriting modulo a set of equations
- Maurice Janet's algorithms on systems of linear partial differential equations
- Cyclic rewriting and conjugacy problems
- Polygraphs of finite derivation type
- Rewriting Systems and Embedding of Monoids in Groups
- Higher-dimensional categories with finite derivation type
- On the Homology of Associative Algebras
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Complete Sets of Reductions for Some Equational Theories
- Coherence in monoidal track categories
- Coherent presentations of Artin monoids
- Coherent Presentations of Monoidal Categories
- Computing Critical Pairs in 2-Dimensional Rewriting Systems
- A Machine-Oriented Logic Based on the Resolution Principle
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Geodesic rewriting systems and pregroups
