Stephanie Weirich - How to Implement the Lambda Calculus, Quickly
Special thanks to the Haskell Foundation for supporting the production of this video!
Haskell Love 2021 schedule: https://emamo.com/event/haskell-love
Haskell Love twitter: / _haskellove
Alpha-equivalence and capture-avoiding substitution are two fundamental operations in the implementation of the lambda calculus. But, what is the best way to implement these operations in Haskell? I wish I knew.
In this talk, which is part tutorial and part work-in-progress, I'll present what I have learned from gathering many, many implementations of these operations into the same repository and comparing their execution using a small benchmark suite.
One observation to make is that that most of these implementations of capture-avoiding substitution require multiple traversals of the AST, which can lead to a significant slowdown on larger examples. However, by reifying, delaying, and fusing these traversals, we can dramatically improve performance. Not only that, but I will also show how this optimization can be invisibly incorporated into binding libraries that automatically provide capture-avoiding substitution "for free".
Link to benchmark repository: https://github.com/sweirich/lambda-n-...
Watch video Stephanie Weirich - How to Implement the Lambda Calculus, Quickly online without registration, duration hours minute second in high quality. This video was added by user Konfy 09 November 2022, don't forget to share it with your friends and acquaintances, it has been viewed on our site 1,954 once and liked it 55 people.