## Relative monadsAdd to your list(s) Download to your calendar using vCal - Tarmo Uustalu, Tallinn University of Technology
- Friday 18 September 2009, 14:00-15:00
- LG52 Learning Centre.
If you have a question about this talk, please contact Paul Levy. In programming language theory we encounter some strikingly monad-like structures that fail to be monads seemingly only for the reason that the underlying functor is not an endofunctor. We propose a notion of relative monad lifting this restriction. A good part of the theory of monads carries over to the relative case. Under meaningful conditions, a relative monad is a monoid in a (generally non-endo-) functor category and extends to a (standard) monad. Some examples of relative monads are the syntaxes of the untyped and typed versions of lambda calculus over finite contexts and Hughes’s arrow types mathematized a la Jacobs and Heunen. (Joint work with Thorsten Altenkirch and James Chapman.) 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
- LG52 Learning Centre
- Theoretical computer science seminar
Note that ex-directory lists are not shown. |
## Other listsFilling in the blank – I will be ….... in 2050’ Algebra Reading Group on Sporadic Groups Contemporary History## Other talksGeneralised hydrodynamics and universalities of transport in integrable (and non-integrable) spin chains Quantum simulation of strongly correlated fermions: A theory perspective Lovász' Theorem and Comonads in Finite Model Theory Best Response Dynamics on Random Graphs |