Factor Recursion Out of Your Codebase

Please log in to watch this conference skillscast.

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, and provide a walk-through of 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. There are no prerequisites to attend the talk, Tamer will be explaining any advanced concepts as you go.

YOU MAY ALSO LIKE:

• Recursion Schemes: How to Factor Recursion Out of Your Codebase (SkillsCast recorded in October 2018)
• Haskell at Work (Online Workshop on 30th January - 2nd February 2023)
• Haskell eXchange 2022: Novice Track (Online Conference on 7th December 2022)
• Haskell eXchange 2022: Online Conference (Online Conference on 8th - 9th December 2022)
• High level JDK comparison for cloud native hosting (Online Meetup on 30th November 2022)
• London Java Community Unconference (in London on 5th December 2022)
• Taming the Context Beast (SkillsCast recorded in October 2022)
• The Middle Way for Static Typing in Spark DataFrames (SkillsCast recorded in October 2022)