Rewriting Procedures Generalise to Kan Extensions of Actions of Categories
From MaRDI portal
Publication:6501403
arXivmath/9907083MaRDI QIDQ6501403FDOQ6501403
Authors: Anne Heyworth 
Abstract: Kan extensions provide a natural general framework for a variety of combinatorial problems. We have developed rewriting procedures for Kan extensions (over the category of sets) and this enables one program to address a wide range of problems. Thus it is possible to use the same framework (and therefore program) to enumerate monoid or group (or category of groupoid) elements, to enumerate cosets or congruence classes on monoids, calculate equivariant equivalence relations, induced actions of groups, monoids or categories and even more. This extended abstract is an outline of "Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories" by R. Brown and A. Heyworth.
Grammars and rewriting systems (68Q42) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40)
This page was built for publication: Rewriting Procedures Generalise to Kan Extensions of Actions of Categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6501403)
