Monoidal Catamorphisms
summary
Claims that a monoidal catamorphism combines a recursion scheme cata with a fold-that-hides-a-monoid yielding a reusable pattern are demonstrated concretely. Tools include Haskell recursion schemes, existential types, Fix and a byfunctor encoding, with code and slides linked on GitHub. The talk builds an implementation and runs a tree example that maps doubles to a Sum monoid then to strings so the pattern composes and produces the expected result. existential fold M-algebra
AI-written summary · about
chapters (14)
- 0:00Introduction
- 5:10Monoidal Catamorphisms
- 9:04Monoidal Data Structures
- 17:25Monoidal Factor
- 19:41Recursion
- 25:29Folding
- 29:27Monoidal
- 31:04Example
- 33:50Monoidal Algebra
- 41:10Questions
- 44:55Use cases
- 46:58Recursion schemes
- 49:00Optics
- 51:58Question
related talks
44mPeeling The Banana: Recursion Schemes from First Principles
45mA practical introduction to Category Theory
55mCategory Theory - Part 3 of 6
46mChasing Arrows, in categories containing functors and monads
38mCategory Theory as a Tool for Thought
59mCategory Theory - Part 6 of 6
01h 15mA Crash Course in Category Theory
01h 11mHands on Chat About Categories