Issue No. 08 - August (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2246
Presents a demand-driven evaluation system for list-structure language systems, using the functional language FP. It enables execution in a data-driven environment. A formal approach for transforming FP programs into lazy programs, which contain the notion of demands, is used. The superset language of FP is called DFP (demand-driven FP). A demand reduction scheme is used to remove unnecessary d
data-flow multiprocessor; demand-driven evaluation system; list-structure language systems; functional language FP; lazy programs; DFP; demand-driven FP; data-flow graphs; FP-DFP transformation rules; partial-function-value evaluation; run-time interpretation; graph theory; multiprocessing systems; parallel programming; program interpreters.
J.-L. Gaudiot, Y.-H. Wei, "Demand-Driven Interpretation of FP Programs on a Data-Flow Multiprocessor", IEEE Transactions on Computers, vol. 37, no. , pp. 946-966, August 1988, doi:10.1109/12.2246