Please log in to watch this conference skillscast.
In your day to day functional programming, you encounter recursion every step of the way. If only there were a way of abstracting away its repetitive parts and clarifying the recursive code with minimal boilerplate!
Fortunately, recursion schemes come to the rescue. They allow for a clear and concise definition of recursion, while being guided by the typechecker. During this talk, you will explore the basic theory behind them but will not require advanced knowledge of mathematics. Recursion schemes can greatly benefit from a more widespread usage and will try to convey the practical ways in which they can be used in real life programs.
YOU MAY ALSO LIKE:
Functional Programming with Bananas in Barbed Wire
Michał is an engineer of many trades. He is currently responsible for libraries and architecture of League of Legends, and, previously, he had worked with startups, supercomputers, and particle detectors. At night, he writes Haskell libraries and runs the biggest Haskell Meetup in Poland.