A data flow approach to the evaluation of FP programs

Authors:
Z. Zhang;K. M. George;G. E. Hedrick
Affiliations:
Oklahoma State University, Dept. of Computing & Information Sciences, Stillwater, OK;Oklahoma State University, Dept. of Computing & Information Sciences, Stillwater, OK;Oklahoma State University, Dept. of Computing & Information Sciences, Stillwater, OK
Venue:
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Year:
1988

Citing 5
Cited 0

An execution architecture for FP

IBM Journal of Research and Development
The Illinois functional programming interpreter

SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
On the Development of the Algebra of Functional Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Type inference and type checking for functional programming languages: A reduced computation approach

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.