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

Relative monads

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

  • UserTarmo Uustalu, Tallinn University of Technology
  • ClockFriday 18 September 2009, 14:00-15:00
  • HouseLG52 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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