Data Made out of Functions, for Faster Monads

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.

 
 

Target Audience

All

schedule Submitted 2 months ago

Public Feedback

comment Suggest improvements to the Speaker