University of Cambridge > > Logic & Semantics for Dummies > Moggi's Monads

Moggi's Monads

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

If you have a question about this talk, please contact Nathanael Arkor.

Monads are used in functional languages such as Haskell to explicitly separate effectful behaviour from pure behaviour. In this talk we explore the theoretical underpinnings of this idea, starting from Moggi’s ‘computational lambda calculus’ and showing how (strong) monads give a sound and complete semantics for the language. We will use some category theory, but the talk will be self-contained. If time permits, we shall see how monads arise in other parts of mathematics and theoretical computer science as models of algebraic constructions.

This talk is part of the Logic & Semantics for Dummies series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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