Principles and tools to cleverly model your data in Scala
summary
Explains how to build free monads in Scala starting from case classes and sealed trait hierarchies, and how to use fixed-point types to represent recursive data. Demonstrates fold and unfold as practical morphisms with examples: a small presentation DSL as sealed types, lists vs streams, and monoid/monad instances with laws plus a simplifier enforcing associativity and identity. Provides slides and reproducible example code showing construction, deconstruction and equivalences.
AI-written summary · about
chapters (6)
- 0:00Start
- 4:38WHAT IS A PRESENTATION?
- 20:41FIXED POINT EQUATION
- 47:00COALGEBRA MORPHISM
- 49:15INITIAL/TERMINAL OBJECTS
- 55:05CONCLUSION
related talks
39mA few tips on modelling things in Scala
01h 03mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 4 of 6
35mThe Functor, Applicative, Monad talk
37mIntro to FP in Scala: Exploring a Toolbox for Solving Problems - Part 6 of 6
55mMonoids, Monoids, Monoids
23mDuality and How to Delete Half (minus ε) of Your Code
27mMonad Stacks or: How I Learned to Stop Worrying and Love the Free Monad
29mIntroduction to Recursion Schemes