Recursion schemes is a code pattern that allows you to automate the process of traversing and recursing through nested data structures by separating recursion out of the rest of the logic. They allow you to use off-the-shelf libraries to do the recursion for you, so you can write less code and potentially fewer bugs!
In this talk, Tamer will share with you an example, a JSON data-structure, walk-through a step-by-step transformation of the code to use a recursion schemes library. By attending you will understand the gist of Recursion Schemes and how to use it in your codebase.
YOU MAY ALSO LIKE:
- Factor Recursion Out of Your Codebase (SkillsCast recorded in December 2018)
- Haskell Fundamentals (2-Day Course) with Alejandro Serrano (Online Course on 8th - 9th March 2021)
- Extreme Java: Advanced Topics with Dr Heinz Kabutz (Online Course on 29th - 30th March 2021)
- F# eXchange 2021 (Online Conference on 20th - 21st October 2021)
- Haskell eXchange 2021 (Online Conference on 16th - 17th November 2021)
- Rethinking Bioinformatic Algorithms Using F# (SkillsCast recorded in October 2020)
- Intro to OCaml (SkillsCast recorded in June 2020)
Recursion Schemes: How to Factor Recursion Out of Your Codebase
Tamer is a Senior Software Engineer at Disney Streaming Services, building and maintaining distributed systems armed with nothing but Scala, types and the power of functional programming.