A Pragmatic Introduction to Category Theory
summary
Practical, non‑mathematical introduction that claims category concepts let codeers reason about composition and metadata by actually coding them: builds a small category‑theory library in Scala with tests written in ScalaCheck, implements Functor, Applicative and Monad typeclasses and law checks, models Maybe/Option, List and Int monoid instances, shows map/pure/ap/flatMap/flatten and for‑comprehension usage, and publishes the working workshop code on GitHub for direct reuse.
AI-written summary · about
chapters (23)
- 0:00Intro
- 2:03I AM NOT A MATHEMATICIAN
- 6:08WHAT IS A CATEGORY?
- 7:13COMPOSITION LAW
- 7:37IDENTITY LAW
- 8:09COMPOSITION + ASSOCIATIVITY
- 8:35CATEGORY'S RULES
- 9:59CATEGORY WITH 1 OBJECT
- 10:41MONOID'S RULES
- 11:38A PRACTICAL EXAMPLE
- 14:23MONOID INSTANCES (1)
- 15:43CATEGORY IN A BOX
- 16:17LIFTING: CONTEXT VS CONTENT
- 17:44FUNCTOR'S RULES
- 20:20FUNCTOR FOR MAYBE
- 21:14BOX FUNCTION + BOX VALUES
- 25:47APPLICATIVE FOR MAYBE
- 27:10BOX IN A BOX
- 29:20SCALACHECK FTW!
- 30:32BOXES IN A SEQUENCE
- 31:13FOR-COMPREHENSION
- 32:55MONAD FOR MAYBE
- 36:17SUMMARY
related talks
40mA Pragmatic Introduction to Category Theories
42mA pragmatic introduction to Category Theory
52mCategory Theory Through Functional Programming (part 1/3)
32mClassical Category Theory in Plain Scala
57mApplied category theory and abstract algebra
32mA practical introduction to category theory
42mWhat did category theory do for us?
51mCategory Theory for the Working Hacker
