Recursion Schemes Without the Barbed Wire (Part 2)
summary
Recursion schemes get applied end-to-end to a toy data lake: schema-driven validation, transforms into Parquet/Avro, and pipeline pieces implemented in Scala using Matryoshka (Scala). Exercises produce concrete algebras and coalgebras—cata / ana recursion schemes—and show surprising results like implementing quicksort as an algebra/coalgebra pair (quicksort as algebra/coalgebra). Code exercises compile and run, producing working validators and transformers and demonstrating measurable, practical value.
AI-written summary · about
chapters (22)
- 0:00Intro
- 1:15Fixed points
- 2:13Recursion schemes
- 2:57Fix
- 3:35Type signatures
- 4:11Patent for natural numbers
- 4:46Lists as a pattern
- 6:06Options
- 7:14Structure
- 8:06Algebra
- 9:45Recursion
- 12:53Kata
- 15:12Fix of Piano
- 16:04S Algebras
- 17:26Questions
- 18:07Binary Trees
- 24:39Changing Label Types
- 25:30Changing Structure
- 28:00Types
- 29:49Branches
- 34:56Partition
- 38:34Quicksort
related talks
36mData pipelines engineering made simple with Scala
38mAdd ALL the things: abstract algebra meets analytics
42mScala: The Unpredicted Lingua Franca for Data Science
29mSchemas: The Key To Data Happiness
01h 28mBuilding Reliable, Open Lakehouses with Delta Lake
24mLightning Talks
23mAxle A Spire based DSL
20mSkrub DataOps, Probabl