Please log in to watch this conference skillscast.
Recursive data structures are a core tool of any functional programmer's toolkit, but they are also one of the most challenging. Budding functional programmers are plagued with nightmares of infinite recursion, mental stack overflows, and the terrifying fixed point. Recursion schemes, generalised folds and unfolds with exotic names and signatures, are a further hurdle to overcome. But past this hurdle there are many rewards.
This talk uses the power of recursion schemes to predict survival on the Titanic. Zainab will show that recursion schemes can be used to grow a decision tree and make predictions from it. Furthermore, they give us far more benefits than the basic folds or unfolds we would otherwise use.
You will make use of many folds, unfolds and even refolds. Be prepared to exercise your skills in origami!
YOU MAY ALSO LIKE:
- Abstract Data Types In The Region Of Abysmal Pain, And How To Navigate Them (SkillsCast recorded in September 2019)
- F# eXchange 2020 (Online Conference on 21st October 2020)
- Haskell eXchange 2020 (Online Conference on 4th - 5th November 2020)
- Intro to OCaml (SkillsCast recorded in June 2020)
- Keynote: Haskell is a Great Host (SkillsCast recorded in October 2019)