"An Introduction to Combinator Compilers and Graph Reduction Machines" by David Graunke

[@DunktLOL]

Thanks for this presentation, very content dense but digestible enough. Here from Bend/HVM

[@gralha_]

I've recently seen a optimal reduction VM that avoids using graphs and is able to achieve much better performance (close to C levels), called HVM.
It also supports easy parallelization, just like the graph reduction VMs mentioned here. It's real promising and looks to me like the future of the types of tech explained in this video.

[@IanDutfield]

Inspirational. Thanks. It's still abstract, weird, and yet amazing. I like how you addressed the implementations and the challenges. I think there is more to be discovered here for those that dare to push forward.

[@derelbenkoenig]

Around 26:00 In the graph for the expression (S + I 5) were the positions of the (+) and the (I) flipped or am I just confused?

[@平沐东]

I’m also confused. That is probably a mistake.

[@kenc.4598]

Super interesting talk David! Thanks for putting it together. I came across the Reduceron paper last year and was intrigued too. I can't shake the feeling that there is a much better hardware solution waiting for us somewhere in the future, but I'm a software guy! I'm definitely going to spend some more time looking into combinators though. Cheers!

[@linjianru]

Great talk. Thank you so much.

[@johnwerner3714]

Thanks great lecture. You're a natural teacher. I'm much closer to getting the SKI calculus.

[@yuricarvalho8196]

This is truly amazing!

[@KennethKasajian]

A huge "aha!!!!" at 27:27

[@dragolov]

Respect!