Data Made out of Functions, for Faster Monads

A SkillsCast for this session is not available.

We’ll look at the remarkable technique of Church encoding, whereby any data structure or programming concept can be represented using nothing but the magic sauce of lambda functions! After the talk, you’ll know how to Church encode arbitrary structures yourself, and how it can actually yield huge performance gains, in particular when applied to free monads.

In the subsequent workshop, we’ll reinvent boolean and integer arithmetic, lists and free monads from scratch, Church encoding them in Haskell.

YOU MAY ALSO LIKE:

• Replatform In A Year or Die; The Tale Of A Turnaround (SkillsCast recorded in September 2021)
• Making Less of the Web with Feature Policy (SkillsCast recorded in July 2019)
• Experimenting with Distributed Data Processing in Haskell (SkillsCast recorded in May 2019)