Computing left Kan extensions.

DOI10.1016/S0747-7171(02)00102-5zbMath1038.18003OpenAlexW2021500173MaRDI QIDQ1426132

M. Leeming, Robert F. C. Walters, Michael R. Bush

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(02)00102-5

zbMATH Keywords

cosetTodd-Coxeter algorithmleft Kan extension

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Special properties of functors (faithful, full, etc.) (18A22)

Related Items (5)

Automatic semigroups and categories. ⋮ Algebraic data integration ⋮ Using rewriting systems to compute left Kan extensions and induced actions of categories ⋮ Computing over K-modules ⋮ Fast left Kan extensions using the chase

Uses Software

• UNITY

Cites Work

• Categories and Computer Science
• A practical method for enumerating cosets of a finite abstract group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing left Kan extensions.