Speaker: Tim Williams
In this talk, we'll explore both the theory and practice of various recursion schemes applied to real world problems. We'll also demonstrate how we can achieve compositional data-types and data-type generic programs by modelling our recursive types as fixed points of functors. The talk will feature an abundance of code, starting with simple list examples and quickly moving on to more problematic topics, such as program analysis, optimisation, memoization, templating and more.
Tim Williams has worked as software developer in the city of London for over 10 years, prior to that he worked as a research physicist specialising in computer simulation. He is an active member of the London Haskell community and has recently started to develop in Haskell professionally.