## A Recursion Removal Theorem (1993)

Citations: | 7 - 3 self |

### BibTeX

@MISC{Ward93arecursion,

author = {Martin Ward},

title = {A Recursion Removal Theorem},

year = {1993}

}

### OpenURL

### Abstract

In this paper we briefly introduce a Wide Spectrum Language and its transformation theory and describe a recent success of the theory: a general recursion removal theorem. Recursion removal often forms an important step in the systematic development of an algorithm from a formal specification. We use semantic-preserving transformations to carry out such developments and the theorem proves the correctness of many different classes of recursion removal. This theorem includes as special cases the two techniques discussed by Knuth [13] and Bird [7]. We describe some applications of the theorem to cascade recursion, binary cascade recursion, Gray codes, and an inverse engineering problem.