University of Birmingham > Talks@bham > Theoretical computer science seminar > Syntactic and semantic fun with monads

Syntactic and semantic fun with monads

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

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

There are still plenty of interesting things to say about the use of monads in computer science. In this talk I will sketch two recent strands of research which concern the syntactic and the semantic role of monads.

In the first half of the talk I will describe a procedure for building programming languages layer by layer, by combining monads. It is well-known that the composition of two monads is in general not a monad. The procedure which I will describe either (i) shows that the composition of two monads is a monad by concretely building a distributive law, or (ii) identifies the precise algebraic obstacle to the existence of a distributive law and allows us to troubleshoot the language’s construction. As an application of this procedure, I will give a principled account of the network specification language ProbNetKAT.

In the second half of the talk I will look at monads as semantic devices which encode computational effects. I will present some work which aims to answer the following question: what programming features can a given effect monad support? By completely classifying certain natural transformations I will show that this question can be answered very precisely for many well-known monads. As an illustration I will show how to list all of Haskell’s MonadPlus structures for well-known monads.

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.