Computing left Kan extensions.
The paper by \textit{S.~Carmody} and \textit{R.~F.~C.~Walters} [in: Category theory, Proc. Int. Conf., Como/Italy 1990, Lect. Notes Math. 1488, 63--78 (1991; Zbl 0737.18001)] generalized the Todd-Coxeter algorithm for enumerating cosets of finite groups to a computation of left Kan extensions. This paper simplifies this version of algorithm and the proof of its correctness. This algorithm for finitely presented functors \(X:{\mathcal A}\to {\mathcal S}et\) and \(F:{\mathcal A}\to{\mathcal B}\) computes a finitely presented functor \(P:{\mathcal B}\to{\mathcal S}et\) and a natural transformation from \( X\) into \(P\circ F\).
- A practical method for enumerating cosets of a finite abstract group
- Categories and Computer Science
- scientific article; zbMATH DE number 3125737 (Why is no real title available?)
- scientific article; zbMATH DE number 19482 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 784870 (Why is no real title available?)
- scientific article; zbMATH DE number 3191321 (Why is no real title available?)
- The Todd-Coxeter procedure and left Kan extensions
- Using rewriting systems to compute left Kan extensions and induced actions of categories
- Fast left Kan extensions using the chase
- Automatic semigroups and categories.
- Computing over K-modules
- scientific article; zbMATH DE number 19482 (Why is no real title available?)
- Algebraic data integration
- scientific article; zbMATH DE number 784870 (Why is no real title available?)
- GADTs, functoriality, parametricity: pick two
- GADTs are not (even partial) functors
This page was built for publication: Computing left Kan extensions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426132)