BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Notation for Comonads - Dominic Orchard (University of Cambridge
 )
DTSTART:20120829T140000Z
DTEND:20120829T144500Z
UID:TALK39507@talks.cam.ac.uk
CONTACT:Dominic Orchard
DESCRIPTION:The category-theoretic concept of a monad is applied widely as
  a design pattern for functional programs involving effects. The utility a
 nd ubiquity of monads is such that some languages provide syntax to simpli
 fy use of this pattern. Comonads\, the dual of monads\, can be similarly u
 sed 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. \n\nThis is a practise talk for IFL '12. Joint work with Alan M
 ycroft.
LOCATION:GS15\, Computer Laboratory
END:VEVENT
END:VCALENDAR