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 categorytheoretic 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 underutilised 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 donotation 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.
This talk is included in these lists:
Note that exdirectory lists are not shown.
