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

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Colimits of monads on Set

Add to your list(s) Download to your calendar using vCal

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cold atoms Computer Science Departmental Series Dinner Table Terrorism - Achieving Food Security

Other talks

Geometry 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
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.