Monads you already use without knowing it
summary
Shows concrete code patterns: implements a list monad via map‑cat (arrays of values, square root returning ± results) and a constrained maybe monad as 0/1-element lists for error short‑circuiting, builds a state monad threading implicit stack with push/pop/double as lambdas returning (value, state) and a bind that sequences them, and models IO as a world/state seed for deterministic randomness; examples use Ruby‑style pseudocode, Clojure core.monads and Haskell snippets, and the demos work conceptually.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 0:53Online abuse
- 2:11Disclaimer
- 3:33What are monads
- 5:40What do monads do
- 13:24Selfimposed constraint
- 16:50Try
- 18:33Identity
- 19:48State Monad
- 22:03Push Pop
- 26:11Why
- 28:20Assignments
- 31:21State Monads
- 33:48Closure Monads
related talks
41mLiving the Monadstic Life
39mDemystifying Monads with Java
36mAn introduction to monadic structures and functional programming
35mThe Functor, Applicative, Monad talk
30mMonad for dummies
43mM-M-M-Monads!
59mDo or don’t There’s no try Or is there The power of monads explained Sort of
27mMonad Stacks or: How I Learned to Stop Worrying and Love the Free Monad