# Parallel Beta Reduction is not Elementary Recursive

@inproceedings{Asperti1998ParallelBR, title={Parallel Beta Reduction is not Elementary Recursive}, author={Andrea Asperti and Harry G. Mairson}, booktitle={POPL}, year={1998} }

- Published 1998 in POPL
DOI:10.1145/268946.268971

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 of values. His pioneering insights have been modified and improved in subsequent implementations of optimal reduction.We prove that the cost of… CONTINUE READING

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=268971.