Using rewriting systems to compute left Kan extensions and induced actions of categories
type: Item
instance of: scholarly article
title: Using rewriting systems to compute left Kan extensions and induced actions of categories
zbMATH Open document ID: 0941.18005
author: Ronald Brown
author: Anne Heyworth
published in: Journal of Symbolic Computation
publication date: 2000-08-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/9903032
Mathematics Subject Classification ID: 18A40
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 18-04
zbMATH DE Number: 1422745
zbMATH Keywords: string-rewriting
zbMATH Keywords: left Kan extensions
zbMATH Keywords: induced actions
zbMATH Keywords: Todd-Coxeter procedure
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2106329988
arXiv ID: math/9903032
cites work: Q4846257
cites work: Computing left Kan extensions.
cites work: Q4003861
cites work: Computing automatic coset systems and subgroup presentations
cites work: Q3862379
cites work: Q5639839
cites work: Rings with several objects
DOI: 10.1006/JSCO.1999.0294
Recommended article: Computational Category-Theoretic Rewriting
Recommended article: Computational category-theoretic rewriting
Recommended article: Categorification, term rewriting and the Knuth-Bendix procedure
Recommended article: Classifying spaces of categories and term rewriting
Recommended article: Q3031187
Recommended article: Presenting a Category Modulo a Rewriting System
Recommended article: Retraction map categories and their applications to the construction of lambda calculus models
Recommended article: Generalising canonical extension to the categorical setting
Recommended article: A Rewriting System for Categorical Combinators with Multiple Arguments
Recommended article: Categorical rewriting of term-like structures
description: scientific article