Parallel Beta Reduction Is Not Elementary Recursive

@inproceedings{Mairsony1998ParallelBR,
  title={Parallel Beta Reduction Is Not Elementary Recursive},
  author={Harry G. Mairsony},
  year={1998}
}
  • Harry G. Mairsony
  • Published 1998
We analyze the inherent complexity of implementing L evy's notion of optimal evaluation for the-calculus, where similar redexes are contracted in one step via so-called parallel-reduction. Optimal evaluation was nally 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 modiied and improved in subsequent implementations of optimal reduction. We prove that the cost of parallel… CONTINUE READING