Using rewriting systems to compute left Kan extensions and induced actions of categories

DOI10.1006/JSCO.1999.0294zbMATH Open0941.18005arXivmath/9903032OpenAlexW2106329988MaRDI QIDQ1971490FDOQ1971490

Anne Heyworth, Ronald Brown

Publication date: 3 August 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: The basic method of rewriting for words in a free monoid given a monoid presentation is extended to rewriting for paths in a free category given a `Kan extension presentation'. This is related to work of Carmody-Walters on the Todd-Coxeter procedure for Kan extensions, but allows for the output data to be infinite, described by a language. The result also allows rewrite methods to be applied in a greater range of situations and examples, in terms of induced actions of monoids, categories, groups or groupoids.

Full work available at URL: https://arxiv.org/abs/math/9903032

zbMATH Keywords

left Kan extensionsstring-rewritinginduced actionsTodd-Coxeter procedure

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Software, source code, etc. for problems pertaining to category theory (18-04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rings with several objects
• Computing automatic coset systems and subgroup presentations
• Computing left Kan extensions.

Cited In (3)

• String rewriting for double coset systems.
• Automatic semigroups and categories.
• Computing over \(K\)-modules

Recommendations

• Title not available (Why is that?) 👍 👎
• Generalising canonical extension to the categorical setting 👍 👎
• Categorification, term rewriting and the Knuth-Bendix procedure 👍 👎
• A Rewriting System for Categorical Combinators with Multiple Arguments 👍 👎
• Categorical rewriting of term-like structures 👍 👎
• Classifying spaces of categories and term rewriting 👍 👎
• Retraction map categories and their applications to the construction of lambda calculus models 👍 👎
• Presenting a Category Modulo a Rewriting System 👍 👎
• Computational category-theoretic rewriting 👍 👎
• Computational Category-Theoretic Rewriting 👍 👎

This page was built for publication: Using rewriting systems to compute left Kan extensions and induced actions of categories

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