University of Birmingham > Talks@bham > Theoretical computer science seminar > Update monads: cointerpreting directed containers

Update monads: cointerpreting directed containers

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

  • UserTarmo Uustalu, Tallinn University of Technology
  • ClockFriday 14 March 2014, 14:00-15:00
  • HouseUG10 Learning Centre.

If you have a question about this talk, please contact Paul Levy.

I will talk about update monads, a generalization of reader and writer monads and a variation of state monads.

An update monad is given by a set (of states), a monoid (of updates) and an action of the monoid on the set (defining the effect of every update on every state). Update monads are exactly the compatible compositions of reader and writer monads, which are in a bijection with distributive laws between reader and writer monads.

State monads are canonically related to those update monads where the monoid of updates is the free monoid on the overwrite semigroup structure on the set of states.

A finer dependently-typed variation of the concept has every state coming with its own set of enabled updates. Dependently typed update monads arise from “cointerpreting” directed containers

This is joint work with Danel Ahman, University of Edinburgh.

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.