Mighty Morphin Data Types
summary
Gentle, example-rich survey that names and types specific morphisms and shows how they appear in code: map/filter/fold as canonical homomorphisms and monadic binds, endomorphism as A→A combos, isomorphism as reversible bijections, and the recursion-scheme trio cata/ana/hylo implemented as fold/unfold/compose with a note about avoiding intermediate collections via stream fusion. Uses Haskell-style type signatures and practical language analogues; no slides, live examples and clarifications.
AI-written summary · about
chapters (7)
- 0:00Start
- 4:30Endomorphism
- 7:59Homomorphism
- 15:57Isomorphism
- 25:33Catamorphism
- 26:30Anamorphism
- 37:40Hylomorphism
related talks
01h 02mPrinciples and tools to cleverly model your data in Scala
38mRefactoring Recursion
35mThe Functor, Applicative, Monad talk
21mGraded Monoids for Dependently Typed Array Programming
56mCategory Theory Through Functional Programming (part 2/3)
52mCategory Theory Through Functional Programming (part 1/3)
56mAn introduction to recursion schemes
42mMonads you already use without knowing it