University of Birmingham > Talks@bham > Theoretical computer science seminar > From finitary monads to Lawvere theories: Cauchy completions

## From finitary monads to Lawvere theories: Cauchy completionsAdd to your list(s) Download to your calendar using vCal - John Power (University of Bath)
- Friday 20 October 2017, 11:00-12:00
- 217, School of Computer Science.
If you have a question about this talk, please contact Paul Taylor. NB 217 not Sloman Lounge The two main category theoretic formulations of universal algebra are Lawvere theories and finitary (= filtered-colimit preserving) monads on Set. The usual way in which to construct a Lawvere theory from a finitary monad T is by considering the opposite of the restriction of the Kleisli category Kl(T) to finite sets or equivalently natural numbers. Richard Garner recently found a different formulation of this, using the notion of Cauchy completion of a finitary monad qua monoid, i.e., qua one-object V-category, in V, where V is the monoidal category [Set_f,Set], equivalently the monoidal category of filtered- colimit preserving functors from Set to Set. Both finitary monads (easily) and Lawvere theories (with more effort) extend from Set to arbitrary locally finitely presentable categories. So last year in Sydney, Richard and I explored the extension of his construction via Cauchy completions. That can only be done in a unified way, i.e., not for one locally finitely presentable category at a time, but for all simultaneously, using the notion of W-category for a bicategory W. I shall talk about as much of this as we can reasonably handle: it is work in progress, so I have not fully grasped it myself yet, and there is much to absorb, e.g, the concepts of Cauchy completion and categories enriched in bicategories. The emphasis will very likely be on Richard’s work rather than the work we did jointly. (joint with Richard Garner) This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- 217, School of Computer Science
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsPostgraduate Algebra Seminar Featured talks Human Computer Interaction seminars## Other talksUltrafast, all-optical, and highly efficient imaging of molecular chirality Extending the Lax type operator for finite W-algebras TBC Modelling uncertainty in image analysis. Quantum simulations using ultra cold ytterbium Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems |