University of Cambridge > Talks.cam > Computer Laboratory Programming Research Group Seminar > A Notation for Comonads

A Notation for Comonads

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

If you have a question about this talk, please contact Dominic Orchard.

The category-theoretic concept of a monad is applied widely as a design pattern for functional programs involving effects. The utility and ubiquity of monads is such that some languages provide syntax to simplify use of this pattern. Comonads, the dual of monads, can be similarly used as a design pattern in functional programming, yet remain relatively under-utilised compared with monads. There are several useful examples of comonads but a lack of syntactic sugar prevents wider adoption and indeed further understanding of comonads as an abstraction mechanism. We propose a lightweight syntax for programming with comonads in Haskell, analogous to the do-notation for monads, accompanied by examples of comonads in the notation.

This is a practise talk for IFL ‘12. Joint work with Alan Mycroft.

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