Classical Category Theory in Plain Scala
summary
Scala code implements a full implementation of small categories (objects, arrows, identities, composition), graphs, functors, natural transformations, cones and algorithms to search for limits and colimits, with unit tests exercising finite cases. It provides a Zermelo-Fraenkel model with Choice inside Scala via a BigSet abstraction (sets by predicate, enumerable vs non-enumerable) and represents diagrams as functors; some constructions are decidable and tested for finite domains while others may not exist or be non-enumerable. Repo on GitHub holds the working code.
AI-written summary · about
chapters (9)
- 0:00Introduction to category theory
- 2:21Tiny categories in Scala
- 8:11Big set category
- 15:28Functors between categories
- 19:28Natural transformations
- 21:45Limits and cones
- 26:31Diagrams and applications
- 28:59Practical uses and future plans
- 30:09Q&A session
related talks
52mCategory Theory Through Functional Programming (part 1/3)
41mA Pragmatic Introduction to Category Theory
42mA pragmatic introduction to Category Theory
40mA Pragmatic Introduction to Category Theories
02h 24mCategory Theory Track
56mCalculating Intuitionistic Logic in Scala
57mApplied category theory and abstract algebra
42mWhat did category theory do for us?
