Homological computations for term rewriting systems

DOI10.4230/LIPICS.FSCD.2016.27MaRDI QIDQ5369492zbMATH OpenFDO

Authors Philippe Malbos, Samuel Mimram

Publication date 17 October 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2016.27

zbMATH Keywords

coherent presentationconvergent presentationhomologyLawvere theoryresolutionterm rewriting systemTietze equivalence

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Theories (e.g., algebraic theories), structure, and semantics (18C10) Grammars and rewriting systems (68Q42)

Recommendations

• A lower bound of the number of rewrite rules obtained by homological methods
• Presenting a Category Modulo a Rewriting System
• Algebra and geometry of rewriting
• Rewriting systems and Hochschild-Mitchell homology
• scientific article; zbMATH DE number 6679826

Cited in

(11)

• Computing minimal projection modules for \(\mathcal{ELH}^r\)-terminologies
• Algebra and geometry of rewriting
• Noncommutative Gröbner bases: applications and generalizations
• A lower bound of the number of rewrite rules obtained by homological methods
• A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods
• Quotients, inductive types, and quotient inductive types
• Confluence of algebraic rewriting systems
• Free precategories as presheaf categories
• Rewriting techniques for relative coherence
• Cohomology of small Cartesian closed categories
• Complete rewriting systems and homology of monoid algebras

This page was built for publication: Homological computations for term rewriting systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369492)