University of Cambridge > Talks.cam > Churchill CompSci Talks > Monads and Comonads

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Monads and Comonads

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland .

Monads are a powerful and widely used abstraction in functional programming that can be used for modelling sequential computations. In this talk we will build up an understanding of monads: first seeing their origins in category theory, then moving swiftly on to see how monads can be used in Haskell programs, finally we will explore the lesser known dual of monads called comonads.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Soul Food Average on weekdays: 8935.01351351 kWh Babraham - The Cambridge Building; The Kings Hedges Room

Other talks

CSAR lecture: Decarbonizing road freight (TBC) The Inaccessible Game Quantifying the unquantifiable? Assessing the importance of almsgiving in early modern France and Spain Director's Briefing Group Presentation 5 Title to be confirmed
 

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