Advertisement

A System which Automatically Improves Programs

  • J. Darlington
  • R. M. Burstall
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

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).

Keywords

Iterative Schema State Transformation Recursive Call Recursion Equation Recursive Schema 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc 1978

Authors and Affiliations

  • J. Darlington
    • 1
  • R. M. Burstall
    • 1
  1. 1.University of EdinburghUK

Personalised recommendations