Categories for the Working Hacker
summary
Explains how category theory models three concrete data types — products sums exponentials — and proves the specific isomorphisms like Hom(C, A×B) ≅ Hom(C,A)×Hom(C,B) and Hom(A+B, C) ≅ Hom(A,C)×Hom(B,C). Implements the ideas in Java and Haskell (pair/record, Either, currying) and points out the practical mismatch with nontermination in ML. Notes that blockchain script languages Simplicity Michelson Plutus expose these constructs, argues category theory discovers monads and can shrink compilers, and cites concrete code and hiring at IOHK.
AI-written summary · about
chapters (5)
related talks
51mCategory Theory for the Working Hacker
57mApplied category theory and abstract algebra
52mCategory Theory Through Functional Programming (part 1/3)
01h 29mCategory Theory Track by Bartosz Milewski Part 1
56mCategory Theory Through Functional Programming (part 2/3)
41mA Pragmatic Introduction to Category Theory
01h 31mCategory Theory Track by Bartosz Milewski Part 2
42mWhat did category theory do for us?