Chasing Arrows, in categories containing functors and monads
summary
Course material condenses Category Theory for programmers into Scala code and commutative diagrams, claims that monad = functor + flatMap (laws) and demonstrates that flatMap = flatten after map using Option and List examples and a counterexample for Tree. Implementation work uses Scala to build mappable/flattenable types, plus exercises (7 hours lectures, 2 hours exercises, ~6 hours of BOS video prep) and a 30‑page draft document; the pedagogy proves illuminating for both mathematicians and programmers.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 2:31Composition in programming
- 11:34Categories and functors
- 19:51Functors to monads
- 26:57Flat map and flatten
- 33:21Monad laws and transformations
- 37:50Conclusion
related talks
45mA practical introduction to Category Theory
01h 15mA Crash Course in Category Theory
01h 11mHands on Chat About Categories
36mCategory Theory: An Abstraction for Anything
48mCategory Theory: You Already Know It
51mCategory Theory for People who Can't be Bothered to Learn It (Part 2)
38mCategory Theory as a Tool for Thought
40mFunctors, in Theory and in Practice!