Monads Asking the Right Question
summary
Explains monads as a concrete abstraction with two operations—unit and bind (flatMap)—and laws (left/right identity, associativity), not metaphors; shows a Maybe-based partner-lookup that replaces exceptions and a List/Many-based rum-sum for pirate ships, implements lift/map/bind (within/andThen) and for-comprehension/do desugaring to flatMap+map, and demonstrates the code running end to end with missing partners handled and totals computed; notes the odd curse of understanding and Maybe monad with unit and bind and list/sequence monad for many values
AI-written summary · about
chapters (12)
- 0:00Monads introduction
- 1:42Why monads are hard
- 3:10Junior dev’s dilemma
- 5:19Partner lookup app
- 7:06Missing partners with Maybe
- 9:55Maybe monad intro
- 11:43Code with do notation
- 13:33Pirate monad for rum
- 16:03Total rum with monads
- 17:51What makes a monad
- 19:16Monad laws
- 20:20Closing
