archives

"Down with Lambda-Lifting"

With regard to the absence of new posts (and Eric Meijer), I don't think this paper has been much discussed.

Simplifications of the Spineless Tagles G-Machine and TIM are presented, which
like the classic SECD machine or the Krivine machine reduce lambda-expressions to weak
head normal form -- no prior lambda-lifting is necessary. The machines are at least as
efficient as their combinatorforebears but more importantly they are simpler due to the
elimination of a translation step that obfuscates programs without improving their efficiency.

Note that this marked (on his home-page) as an unfinished draft. Not sure when it was last revised, but it looks post-1992.

Actually I'm hopeing someone might be able to translate the gist of the paper to something a Schemer might understand :), since I think at least Chicken uses lambda-lifting.