Moggi's Monads
- đ¤ Speaker: Philip Saville (University of Cambridge)
- đ Date & Time: Wednesday 23 January 2019, 11:00 - 12:00
- đ Venue: Rainbow Room (FS07), Computer Laboratory
Abstract
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.
Series This talk is part of the Logic & Semantics for Dummies series.
Included in Lists
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Wednesday 23 January 2019, 11:00-12:00