Skip to main content

Efficient Demand-Driven Evaluation - Part 1

Keshav Pingali, Arvind

PDF DOI 10.1145/3318.3480 dblp BibTeX

Abstract

We describe a program transformation technique for programs in a general stream language L whereby a data-driven evaluation of the transformed program performs exactly the same computation as a demand-driven evaluation of the original program. The transformational technique suggests a simple denotational characterization of demand-driven evaluation.

Related papers

Clarification of "Feeding Inputs on Demand" in Efficient Demand-Driven Evaluation - Part 1 TOPLAS 1986
Efficient Demand-Driven Evaluation - Part 2 TOPLAS 1986
Demand-Driven Pointer Analysis PLDI 2001
Evaluating a Demand Driven Technique for Call Graph Construction CC 2002
EXPLORER : query- and demand-driven exploration of interprocedural control flow properties OOPSLA 2015
A demand-driven adaptive type analysis ICFP 2002
From Raw Pointers to Memory Safety: A Modular Demand-Driven Typestate Analysis for Rust OOPSLA 2026
Data-driven precondition inference with learned features PLDI 2016