Abstract :
Program development often proceeds by transforming simple, clear programs into complex, involuted, but more efficient ones. This paper examines ways this process can be rendered more systematic. We show how analysis of program performance, partial evaluation of functions, and abstraction of recursive function definitions from recurring subgoals can be combined to yield many global transformations in a methodical fashion. Examples are drawn from compiler optimization, list processing, very high-evel languages, and APL execution.
Keywords :
APL; Analysis of prograns; Lisp; compiler optimization; evaluation in context; execution analysis; generalization; list processing; optimizing transformations; partial evaluation; program analysis; program transfornation; simplification; very high-level language; Computational efficiency; Cost function; Design engineering; High level languages; Local activities; Optimizing compilers; Performance analysis; Program processors; Programming profession; APL; Analysis of prograns; Lisp; compiler optimization; evaluation in context; execution analysis; generalization; list processing; optimizing transformations; partial evaluation; program analysis; program transfornation; simplification; very high-level language;
