A data flow approach to the evaluation of FP programs
Z Zhang, KM George, GE Hedrick - … of the 1988 ACM sixteenth annual …, 1988 - dl.acm.org
Z Zhang, KM George, GE Hedrick
Proceedings of the 1988 ACM sixteenth annual conference on Computer science, 1988•dl.acm.orgCurrent implementations of Backus' FP do not explore the parallelism in FP programs fully.
Thus, the efficiency techniques is limited. This paper presents a new approach, namely, data
flow, to evaluate FP programs. The data flow approach is more effective than the
conventional approaches both since it adopts an eager evaluation and since the parallelism
can be used fully. An FP to data flow graph translation algorithm is presented. Some
optimization techniques are also presented. The implementations based on this approach …
Thus, the efficiency techniques is limited. This paper presents a new approach, namely, data
flow, to evaluate FP programs. The data flow approach is more effective than the
conventional approaches both since it adopts an eager evaluation and since the parallelism
can be used fully. An FP to data flow graph translation algorithm is presented. Some
optimization techniques are also presented. The implementations based on this approach …
Current implementations of Backus' FP do not explore the parallelism in FP programs fully. Thus, the efficiency techniques is limited. This paper presents a new approach, namely, data flow, to evaluate FP programs. The data flow approach is more effective than the conventional approaches both since it adopts an eager evaluation and since the parallelism can be used fully. An FP to data flow graph translation algorithm is presented. Some optimization techniques are also presented. The implementations based on this approach are also discussed.
ACM Digital LibraryShowing the best result for this search. See all results