Hands on With Recursion Schemes - Part 1 of 2
summary
Workshop turns an AST into a parametric functor and actually wires it to recursion schemes: functor-ise the AST, use Fix (fixed point) and cata and its monadic variant cataM, and rely on the matryoshka library in Scala. Exercises implement an Inc transformation (increment all literals) and an eval that returns division-by-zero errors; live coding shows solutions compile after adding the Functor instance and the right imports, so the examples execute rather than staying theoretical.
AI-written summary · about
chapters (4)
related talks
02h 00mUsing Corecursion Schemes
29mIntroduction to Recursion Schemes
37mGoing bananas with recursion schemes for fixed point data types
56mAn introduction to recursion schemes
51mGoing bananas with recursion schemes for fixed point data types
32mRecursion schemes with Higherkindness
34mPeeling the Banana: Recursion Schemes from First Principles
01h 02mGoing bananas with recursion schemes for fixed point data types