A System which Automatically Improves Programs
Methods are given for mechanically converting programs that are easy to understand into more efficient ones, converting recursion equations using high level operations into lower level flowchart programs. The main transformations involved are (i) recursion removal (ii) eliminating common subexpressions and combining loops (iii) replacing procedure calls by their bodies (iv) introducing assignments which overwrite list cells no longer in use (compile-time garbage collection).
KeywordsIterative Schema State Transformation Recursive Call Recursion Equation Recursive Schema
Unable to display preview. Download preview PDF.