A pragmatic introduction to Category Theory
summary
Compact, pragmatic mapping of category theory to Scala: demonstrates how Functor, Applicative and Monad correspond to map, ap/pure and flatMap/flatten by implementing Maybe with map ap flatMap and verifying laws with property tests using ScalaCheck; shows practical examples (string->int->bool composition, Option concatenation and numeric monoids) and explains the core claim that a monad is a monoid in the category of endofunctors. All examples are implemented and the tests pass.
AI-written summary · about
chapters (6)
- 0:00Start
- 3:01YOU DO NOT NEED TO KNOW CATEGORY THEORY TO WRITE
- 4:08HOW DO WE REASON?
- 4:55COMPOSITION ABSTRACTION
- 5:45ARROW THEORY CATEGORY THEORY HOW THINGS COMPOSE
- 34:10MONAD IS A MONOD IN THE CATEGORY OF ENDOFUNCTORS
related talks
40mA Pragmatic Introduction to Category Theories
41mA Pragmatic Introduction to Category Theory
52mCategory Theory Through Functional Programming (part 1/3)
35mThe Functor, Applicative, Monad talk
32mClassical Category Theory in Plain Scala
32mA practical introduction to category theory
57mApplied category theory and abstract algebra
42mWhat did category theory do for us?
