Category Theory Through Functional Programming (part 1/3)
summary
A practical walk through category theory implemented in Haskell and Scala using real code that typechecks and illustrates concepts: categories encoded as types and morphisms, GHC 8 and advanced extensions required, a monoid as a one‑object category, orders as categories, products shown as the usual product as pair type with the universal arrow and a constructive uniqueness sketch that typechecks though full equality proofs need dependent types, coproducts as sums, and the arrow functor (D -> -) given by postcomposition.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 3:13Defining category in Haskell
- 9:00Categories as monoids and sets
- 16:49Universal constructions and products
- 26:10Initial objects and duality
- 32:57Co-products and duality in Haskell
- 41:49Functors between categories
- 49:00Functors in Haskell and conclusion
related talks
01h 29mCategory Theory Track by Bartosz Milewski Part 1
41mA Pragmatic Introduction to Category Theory
51mCategory Theory for the Working Hacker
42mA pragmatic introduction to Category Theory
40mA Pragmatic Introduction to Category Theories
32mClassical Category Theory in Plain Scala
01h 11mCategories for the Working Hacker
42mWhat did category theory do for us?
