Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
