Functional programming with monads combined with comonads

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

• Dominic Orchard, Computer Lab, Cambridge
• Wednesday 02 June 2010, 15:30-16:00
• Microsoft Research, Cambridge.

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

Monads and comonads succinctly structure computation: monads describe effects e.g. input/output, comonads describe contextual computations e.g. dataflow/stream computations. Recently, comonads and monads have been combined for applications such as partial streams or combining intensional and extensional semantics. This paper furthers work on the interaction of comonads and monads via distributive laws and the Kleisli category construction on monads and comonads. I introduce extension in the ``biKleisli’’ category, providing combinators analogous to the (co)extend operation of a (co)monad which is useful for practical programming with combinations of comonads and monad. In this talk I introduce the concepts involved, the new extension operation on BiKleisli categories, and show a few examples.

This is work in progress. This talk is part of the ICFP PC Functional Programming Workshop.

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

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Programming Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Microsoft Research, Cambridge
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.