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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag New York Inc
About this chapter
Cite this chapter
Darlington, J., Burstall, R.M. (1978). A System which Automatically Improves Programs. In: Gries, D. (eds) Programming Methodology. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6315-9_15
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6315-9_15
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6317-3
Online ISBN: 978-1-4612-6315-9
eBook Packages: Springer Book Archive