University of Birmingham > Talks@bham > Theoretical computer science seminar > Colimits of monads on Set

## Colimits of monads on SetAdd to your list(s) Download to your calendar using vCal - Nathan Bowler, University of Hamburg
- Friday 16 May 2014, 16:00-17:00
- UG05 Learning Centre.
If you have a question about this talk, please contact Paul Levy. I will outline how taking colimits of monads corresponds to applying straightforward syntactic constructions to the underlying algebraic theories. I will explain a sense in which many kinds of colimit of monads on Set are badly behaved (called universe dependence). In contrast to this, I will show that coproducts of monads on Set are universe independent. I will explain in detail the structure of these coproducts, which is reminiscent of a formula due to Ghani and Uustalu. This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- UG05 Learning Centre
- computer sience
Note that ex-directory lists are not shown. |
## Other listsCold atoms Computer Science Departmental Series Dinner Table Terrorism - Achieving Food Security## Other talksGeometry of alternating projections in metric spaces with bounded curvature Sylow branching coefficients for symmetric groups Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Modelling uncertainty in image analysis. Quantum simulations using ultra cold ytterbium TBC |