A Transformation System for Developing Recursive Programs
- 1 January 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 24 (1), 44-67
- https://doi.org/10.1145/321992.321996
Abstract
A system of rules for transforming programs is described, with the programs in the form of recursion equations. An initially very simple, lucid, and hopefully correct program is transformed into a more efficient one by altering the recursion structure. Illustrative examples of program transformations are given, and a tentative implementation is described. Alternative structures for programs are shown, and a possible initial phase for an automatic or semiautomatic program-manipulation system is indicated.Keywords
This publication has 5 references indexed in Scilit:
- Proving Theorems about LISP FunctionsJournal of the ACM, 1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- Semantics and axiomatics of a simple recursive language.Published by Association for Computing Machinery (ACM) ,1974
- Proof of correctness of data representationsActa Informatica, 1972
- Algorithm 245: TreesortCommunications of the ACM, 1964