In functional language implementation, there is a folklore belief that there is a conflict between implementing call-by-need semantics and parallel evaluation. In this note we illustrate this by proving that reduction algorithms of a certain general and commonly used form which give call-byneed semantics offer very little parallelism. The analysis of lazy pattern-matching which leads to the above result also suggests an efficient sequential algorithm for the evaluation of a class functional programs satisfying certain constraints, an algorithm which respects the mathematical semantics of the program considered as a term rewrite system.
CITATION STYLE
Kennaway, R. (1995). A conflict between call-by-need computation and parallelism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 968, pp. 247–261). Springer Verlag. https://doi.org/10.1007/3-540-60381-6_15
Mendeley helps you to discover research relevant for your work.