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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Monads and Comonads

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cavendish Graduate Student Conference 2010 INI info aggregator Cambridge Fly Meetings Theory Workshop ARClub Talks Cambridge University Science and Policy Exchange (CUSPE)

Other talks

Planning for sustainable urbanisation in China: a community perspective Developing a single-cell transcriptomic data analysis pipeline Description: TIE proteins: chemical harpoons of Gram-positive bacteria Responsible Research and Innovation Lunch- Lent 2018 Women's Staff Network: Career Conversations Graph Convolutional Networks for Natural Language Processing and Relational Modeling
 

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