Moggi's Monads

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

• Philip Saville (University of Cambridge)
• Wednesday 23 January 2019, 11:00-12:00
• Rainbow Room (FS07), Computer Laboratory.

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.

This talk is included in these lists:

• Logic & Semantics for Dummies
• Rainbow Room (FS07), Computer Laboratory
• tcw57’s list
• yk373's list

Note that ex-directory lists are not shown.