AESOP home


A new approach to recursion removal

Peter G. Harrison, Hessam Khoshnevisan

Journal Article
Theoretical Computer Science
Volume 93
Issue 1
February, 1992
DOI 10.1016/0304-3975(92)90213-Y

Iterative forms are derived for a class of recursive functions, i.e. the recursion is "removed". The transformation comprises first analysis of the defining equation of a recursive function and then synthesis of an imperative language loop from the primitive subexpressions so obtained. This initially leads to a two-loop program but further transformation provides a single loop version under appropriate conditions. The analysis-synthesis approach contrasts with previous methods using template matching and induces a constructive method which is better suited to mechanisation, although its implementation is not considered here.

PDF of full publication (656 kilobytes)
(need help viewing PDF files?)

Information from