Please log in to watch this conference skillscast.

Recursion is hard! But luckily you can 'get it right' once and reuse it in other projects.

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)
• Functional Concurrency in .NET with C# and F# (in London on 9th - 10th September 2019)
• Fast Track to F# with Tomas Petricek & Phil Trelford (in London on 9th - 10th September 2019)
• Haskell eXchange 2019 (in London on 10th - 11th October 2019)
• Clojure eXchange 2019 (in London on 2nd - 3rd December 2019)
• Hands-on: Fractal art with Fable and WebGL (in London on 20th June 2019)
• Keynote by Dick Wall on Why API Design Matters, and Why Yours Sucks! (and mine sucks too!) (in London on 24th June 2019)
• The Elements of Tagless Final Style (SkillsCast recorded in May 2019)
• The Cost of Code (SkillsCast recorded in May 2019)