Simple driving techniques

Authors:
Mads Rosendahl
Affiliations:
University of Roskilde, Dept. of Computer Science, Building 42.1, P.O. Box 260, DK-4000 Roskilde, Denmark
Venue:
The essence of computation
Year:
2002

Citing 11
Cited 1

The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Deforestation: transforming programs to eliminate trees

Proceedings of the Second European Symposium on Programming
Automatic complexity analysis

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Verifying Program Performance

Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Symbolic Solution of Finite-Difference Equations

ACM Transactions on Mathematical Software (TOMS)
Mechanical program analysis

Communications of the ACM
Program improvement by internal specialization

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The structure of a self-applicable partial evaluator

Programs as Data Objects, Proceedings of a Workshop
Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Experiments with a supercompiler

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming

Closed-Form Upper Bounds in Static Cost Analysis

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Driving was introduced as a program transformation technique by Valentin Turchin in some papers around 1980. It was intended for the programming language REFAL and used in metasystem transitions based on super compilation. In this paper we present one version of driving for a more conventional lisp-like language. Our aim is to extract a simple notion of driving and show that even in this tamed form it has much of the power of more general notions of driving. Our driving technique may be used to simplify functional programs which use function composition and will often be able to remove intermediate data structures used in computations.