Communications of the ACM
Functional Programming
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
First version of a data flow procedure language
Programming Symposium, Proceedings Colloque sur la Programmation
The semantic elegance of applicative languages
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Applications of feedback in functional programming
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Efficient demand-driven evaluation. Part 2
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Demand-Driven Interpretation of FP Programs on a Data-Flow Multiprocessor
IEEE Transactions on Computers - Special issue on architectural support for programming languages and operating systems
Lazy evaluation and the logic variable
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Architectural support for the efficient data-driven evaluation scheme
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Automatic transformation of series expressions into loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sparse functional stores for imperative programs
IR '95 Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations
First-class synchronization barriers
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Consistency in Dataflow Graphs
IEEE Transactions on Parallel and Distributed Systems
FOOD: An Intermediate Model for Automated Refactoring
Proceedings of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06
The tao of parallelism in algorithms
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
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.