University of Cambridge > Talks.cam > Computer Laboratory Programming Research Group Seminar > Embedding effect systems in Haskell

Embedding effect systems in Haskell

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

If you have a question about this talk, please contact Raphael Proust.

Monads are now an everyday tool in functional programming for abstracting and delimiting effects. The link between monads and effect systems is well-known, but monads provide a much more coarse-grained view of effects. Whilst effect systems capture fine-grained information about the effects, monads provide only a binary view: effectful or pure.

Recent theoretical work has unified fine-grained effect systems with monads using a monad-like structure indexed by a monoid of effect annotations (called parametric effect monads). This aligns the power of monads with the power of effect systems.

This paper leverages recent advances in Haskell’s type system (as provided by GHC ) to embed this approach in Haskell, providing user-programmable effect systems. We explore a number of practical examples that make Haskell even better and safer for effectful programming. Along the way, we relate the examples to other concepts, such as Haskell’s implicit parameters and coeffects.

This a practise talk for the Haskell symposium at ICFP . This is joint work with Tomas Petricek.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity