Homological computations for term rewriting systems

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

Authors Philippe Malbos, Samuel Mimram

Publication date 17 October 2017

zbMATH Keywords

resolutionhomologyLawvere theoryterm rewriting systemcoherent presentationTietze equivalenceconvergent presentation

Mathematics Subject Classification ID

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

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)

• Complete rewriting systems and homology of monoid algebras
• 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
• Free precategories as presheaf categories
• Noncommutative Gröbner bases: applications and generalizations
• Quotients, inductive types, and quotient inductive types
• Cohomology of small Cartesian closed categories
• Algebra and geometry of rewriting
• Confluence of algebraic rewriting systems
• Computing minimal projection modules for \(\mathcal{ELH}^r\)-terminologies
• Rewriting techniques for relative coherence

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)