Computing left Kan extensions.
From MaRDI portal
Recommendations
Cites work
- 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?)
- A practical method for enumerating cosets of a finite abstract group
- Categories and Computer Science
Cited in
(8)- scientific article; zbMATH DE number 784870 (Why is no real title available?)
- Fast left Kan extensions using the chase
- Automatic semigroups and categories.
- Computing over \(K\)-modules
- The Todd-Coxeter procedure and left Kan extensions
- Algebraic data integration
- GADTs, functoriality, parametricity: pick two
- Using rewriting systems to compute left Kan extensions and induced actions of categories
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)