BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Theoretical computer science seminar
SUMMARY:Relative monads - Tarmo Uustalu\, Tallinn Universi
ty of Technology
DTSTART:20090918T130000Z
DTEND:20090918T140000Z
UID:TALK101AT
URL:/talk/index/101
DESCRIPTION:In programming language theory we encounter some s
trikingly monad-like \nstructures that fail to be
monads seemingly only for the reason that the \nun
derlying functor is not an endofunctor. We propose
a notion of relative \nmonad lifting this restric
tion. A good part of the theory of monads carries
\nover to the relative case. Under meaningful cond
itions\, a relative monad is \na monoid in a (gene
rally non-endo-) functor category and extends to a
\n(standard) monad. Some examples of relative mon
ads are the syntaxes of the \nuntyped and typed ve
rsions of lambda calculus over finite contexts and
\nHughes's arrow types mathematized a la Jacobs a
nd Heunen. (Joint work with \nThorsten Altenkirch
and James Chapman.)\n\n
LOCATION:LG52 Learning Centre
CONTACT:Paul Levy
END:VEVENT
END:VCALENDAR