Although this example is very simple, it does illustrate how the graph reduc- 2.1. Compiling Lazy Functional Languages 35 tion model handles the two aspects of lazy evaluation: call-by-need and sharing. Further examples illustrating how the model also handles higher-order functions can be found in, for example (Peyton Jones, 1987). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Parallel Graph Reduction for Shared-Memory Architectures - Andrew Jonathan (1993) (1 citation) (Correct)
No context found.
Although this example is very simple, it does illustrate how the graph reduc- 2.1. Compiling Lazy Functional Languages 35 tion model handles the two aspects of lazy evaluation: call-by-need and sharing. Further examples illustrating how the model also handles higher-order functions can be found in, for example (Peyton Jones, 1987).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC