Goal-Directed Program Transformation

Authors:
B. Wegbreit
Affiliations:
Xerox Palo Alto Research Center
Venue:
IEEE Transactions on Software Engineering
Year:
1976

Citing 0
Cited 6

Dynamic Programming via Static Incrementalization

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Mechanical analysis of program complexity

SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
A learning system able to synthesize arithmetical functions

IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
How to facilitate the proof of theories by using the induction matching, and by generalization

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
A system which synthesizes array-manipulating programs from specifications

IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Characterization of a class of functions synthesized from examples by a summers like method using a "B.M.W." matching technique

IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.