Recursion Schemes

2 hours
Speaker: Tim Williams. London Haskell user group. 27th March 2013. The theory and practice of various recursion schemes applied to real world problems. Demonstrating compositional data-types and data-type generic programs by modelling recursive types as fixed points of functors. Code starts with simple list examples and moves quickly on to more problematic topics, such as program analysis, optimisation, memoization, templating and more.

Related Talks

"Writing a game in Haskell" by Elise Huard

Haskell is a beautiful functional language, written by smart computer scientists, and having clever and elegant functional constructs. It clearly separates pure and impure parts of the program. Game programming on the other hand is a very hands-on discipline, trying to wring out the most of the machine's performance, and aiming ...

Rishiyur S. Nikhil - Enigmatic Haskell, Haskellish Enigma

an hour
Boston Haskell, February 18, 2015 Nikhil builds an Enigma machine. First in Cryptol, then in hardware by way of Haskell. Slides and code available here: ...

Kenneth Foner - Getting a Quick Fix on Comonads

an hour
Kenneth Foner's Comonad talk at the Boston Haskell meetup, September 17, 2014. Code and slides: ...

Dan Doel - Introduction to Low Level Haskell Optimization

an hour
Dan Doel's talk at the Boston Haskell Meetup, Sept 17, 2014 Slides: ...

Cody Roux - Pure Type Systems

an hour
Cody Roux's talk for the Boston Haskell Meetup - February 18, 2015 Slides: ...

Brian Beckman: Don't fear the Monad

Cross posted from msdn's channel 9. Functional programming is increasing in popularity these days given the inherent problems with shared mutable state that is rife in the imperative world. As we march on to a world of multi and many-core chipsets, software engineering must evolve to better equip software engineers with ...

Framing the Discussion with EDSLs

Anthony Cowley
2 hours
We will begin with an overview of the Frames library that offers a data frame abstraction for efficiently working with tabular data in Haskell. A close look at an incidental aspect of the Frames implementation will provide an opportunity to think a bit about records and sum types, which will ... 2014 - Demystifying Haskell - Andrew Rademacher

This talk was given at 2014. An in-depth examination of the Fibonacci sequence intended to demonstrate the value of Haskell, bust myths about the difficulty of using Haskell and encourage further research and interest in the language. About the Speaker Andrew is a software consultant with experience delivering telemarketing, manufacturing and analytic ...

Lenses, Folds, and Traversals

Slides: This was a talk I gave at the second New York Haskell User Group Meeting ( on the new lens library, which provides a highly composable toolbox for accessing and modifying multiple parts of data structures. Starting with building blocks such as fmap and (.), we build up combinators suitable ...