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)
• YOW! Lambda Jam 2022 (Online Conference on 1st - 30th May 2022)
• Haskell eXchange 2022 (in Online Event on 1st - 30th November 2022)
• Steve Poole presents Log4Shell : Armageddon or Opportunity? (Online Meetup on 26th January 2022)
• A Conceptual Introduction to Nix for Haskellers (SkillsCast recorded in November 2021)
• Haskell in the Enterprise: A Report from in the Belly of the Whale (SkillsCast recorded in November 2021)