Computing left Kan extensions

  • Bush M
  • Leeming M
  • Walters R
  • 2


    Mendeley users who have this article in their library.
  • 3


    Citations of this article.


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. © 2003 Elsevier Science Ltd. All rights reserved.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • M. R. Bush

  • M. Leeming

  • R. F.C. Walters

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free