Learn More
A wide variety of computational models, including the lambda calculus, may be represented by a set of <italic>reduction rules</italic> which guide the (run-time) construction of a <italic>process tree.</italic> Even a single source of parallelism in an otherwise lazy evaluator may give rise to an exponential growth in the process tree, which must eventually(More)
When evaluating a functional program on a network of processors, it is necessary to decide when parallelism is desirable, which work may be transferred to another processor, and in what form the work is to be transferred. If the wrong decisions are made, a parallel evaluation may require asymptotically more time than a sequential evaluation, owing to(More)