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:

• Scala eXchange London 2019 (in London on 12th - 13th December 2019)
• Recursion Schemes: How to Factor Recursion Out of Your Codebase (SkillsCast recorded in October 2018)
• Lightbend Akka for Scala - Professional (in London on 11th - 12th November 2019)
• Advanced Scala with Dick Wall (in London on 9th - 11th December 2019)
• Clojure eXchange 2019 (in London on 2nd - 3rd December 2019)
• Code Kata: Yilin Wei - Optics with Monocle (in London on 22nd October 2019)
• Don’t keep it to yourself - openness and honesty in the workplace (in London on 30th October 2019)
• Keynote: (Programming Languages) in Agda = Programming (Languages in Agda) (SkillsCast recorded in October 2019)
• Keynote: Haskell is a Great Host (SkillsCast recorded in October 2019)