Some transformations for developing recursive programs

Rod M. Burstall, John Darlington · ACM SIGPLAN Notices · 1975

The paper describes a system of rules for transforming programs, the programs being in the form of recursion equations. The idea is to start with a very simple, lucid and hopefully correct program, then to transform it into a more efficient one by altering the recursion structure. Illustrative examples of program transformations are given, and a tentative implementation is described. We hope to throw some light on the alternative structures for programs, also to indicate a possible initial phase for an automatic or semi-automatic program manipulation system.

Cited by 78 works. doi:10.1145/390016.808470

Authors

References