Section: New Software and Platforms

Rewr

Rewriting methods in algebra

Keywords: Computer algebra system (CAS) - Rewriting systems - Algebra

Functional Description: Rewr is a prototype of computer algebra system, using rewriting methods to compute resolutions and homotopical invariants of monoids. The library implements various classical constructions of rewriting theory (such as completion), improved by experimental features coming from Garside theory, and allows homotopical algebra computations based on Squier theory. Specific functionalities have been developed for usual classes of monoids, such as Artin monoids and plactic monoids.

News Of The Year: Rewr has been extended with the experimental KGB completion algorithm, based on Knuth-Bendix completion procedure improved by techniques coming from Garside theory.

• Participants: Yves Guiraud and Samuel Mimram

• Contact: Yves Guiraud

• Publications: Higher-dimensional categories with finite derivation type - Higher-dimensional normalisation strategies for acyclicity - Coherent presentations of Artin monoids - A Homotopical Completion Procedure with Applications to Coherence of Monoids - Polygraphs of finite derivation type - Quadratic normalisation in monoids

• URL: http://www.lix.polytechnique.fr/Labo/Samuel.Mimram/rewr