University of Birmingham > Talks@bham > Theoretical computer science seminar > Relative pseudomonads

## Relative pseudomonadsAdd to your list(s) Download to your calendar using vCal - Nicola Gambino (University of Leeds)
- Friday 26 May 2017, 11:00-12:00
- Computer Science 217.
If you have a question about this talk, please contact Paul Taylor. Room change! It is well-known that monads admit an equivalent presentation via the notion of a Kleisli triple. In recent work, Altenkirch, Chapman and Uustalo generalized Kleisli triples to what they call relative monads, avoiding the assumption that the functor part of the monad is an endofunctor. In this talk, I will present the corresponding 2-categorical notion, that of relative pseudomonad, and offer some applications. In particular, I will show how the presheaf construction gives rise in a natural way to a relative pseudomonad, how this allows us to see the bicategory of profunctors as a Kleisli bicategory, and illustrate how this gives rise to a 2-categorical version of the relational model of linear logic. This is joint work with M. Fiore, M. Hyland, and G. Winskel. This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- Computer Science 217
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsCondensed Matter Physics Seminars RSLC PhD/Postdoc Seminars (Chemistry) Computer Science Lunch Time Talk Series## Other talksQuantum simulations using ultra cold ytterbium TBC Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Ultrafast, all-optical, and highly efficient imaging of molecular chirality Sensing and metrology activities at NPL, India Geometry of alternating projections in metric spaces with bounded curvature |