Rewriting Procedures Generalise to Kan Extensions of Actions of Categories

Details Rewriting Procedures Generalise to Kan Extensions of Actions of Categories Rewriting Procedures Generalise to Kan Extensions of Actions of Categories

1999-07-13

arxiv.org/abs/math/9907083v2

Mathematics

Combinatorics

9 pages, LaTeX2e, (extended abstract FLoC/RTA'99). Replacement (v2) has correct LaTeX source file for submission (source for m

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Rewriting Procedures Generalise to Kan Extensions of Actions of Categories does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rewriting Procedures Generalise to Kan Extensions of Actions of Categories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rewriting Procedures Generalise to Kan Extensions of Actions of Categories will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446418