Adjunctions in Everyday Life
summary
Claim: adjunctions are the concrete pattern behind many FP constructions, shown with Haskell code and category theory. Demonstrations: curry/uncurry as an isomorphism, the (s,) / (s->) adjunction producing the State monad and the Store comonad (used to build a blur/edge detector), the forgetful/left‑adjoint pair giving Maybe as the free pointed type, and lists as the free monoid. All examples are instantiated in Haskell and reduce to the familiar types and operations, so the constructions work and reproduce known behavior.
AI-written summary · about
chapters (5)
related talks
35mAdjunctions in Everyday Life
54mCategory Theory Through Functional Programming (part 3/3)
57mApplied category theory and abstract algebra
56mCategory Theory Through Functional Programming (part 2/3)
01h 14mBeyond Free Monads
17mFunctional Architecture is Algebraic Architecture
01h 29mCategory Theory Track by Bartosz Milewski Part 1
26mAbstraction Functions as Types