Computing left Kan extensions

  • Authors:

  • M. R. Bush;M. Leeming;R. F. C. Walters

  • Affiliations:

  • School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia;School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia;School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a new extension of the Todd-Coxeter algorithm adapted to computing left Kan extensions. The algorithm is a much simplified version of that introduced by Carmody and Walters (Category Theory, Proceedings of the International Conference Held in Como, Italy, 22-28 July 1990. Springer) in 1991. The simplification allows us to give a straightforward proof of its correctness and termination when the extension is finite.