Parallel Beta Reduction is not Elementary Recursive

Abstract

We analyze the inherent complexity of implementing Lévy's notion of optimal evaluation for the &lambda-calculus, where similar redexes are contracted in one step via so-called parallel ß-reduction. optimal evaluation was finally realized by Lamping, who introduced a beautiful graph reduction technology for sharing evaluation contexts dual to the sharing… (More)
DOI: 10.1145/268946.268971

Topics

1 Figure or Table

Slides referencing similar topics