Monad Fact #4 - 4th in a series

A monad is an implementation of one of the minimal sets of monadic combinators, satisfying the laws of associativity and identity - see how compositional responsibilities are distributed in each combinator set. - download for best results - slides can be a bit grainy/out-of-focus when viewed on the site.