论文信息 - A Conflict Between Call-by-Need Computation and Parallelism

A Conflict Between Call-by-Need Computation and Parallelism

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-by-need semantics offer very little parallelism.

Richard Kennaway | R. Kennaway

[1] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .

[2] Jean-Jacques Lévy,et al. Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[3] Jean-Pierre Jouannaud,et al. Open Problems in Rewriting , 1991, RTA.

[4] Corrado Böhm,et al. A Self-Interpreter of Lambda Calculus Having a Normal Form , 1992, CSL.

[5] Rinus Plasmeijer,et al. The functional strategy and transitive term rewriting systems , 1993 .

[6] Aart Middeldorp,et al. Sequentiality in Orthogonal Term Rewriting Systems , 1991, J. Symb. Comput..