Xref: utzoo comp.theory:1438 comp.lang.functional:589
Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!wuarchive!udel!sbcs!usenet
From: stark@sbstark (Eugene Stark)
Newsgroups: comp.theory,comp.lang.functional
Subject: Re: recursive =?=> iterative ?
Message-ID: <1991Jan19.182618.7727@sbcs.sunysb.edu>
Date: 19 Jan 91 18:26:18 GMT
References: <1991Jan17.160716.292@lth.se>
Sender: usenet@sbcs.sunysb.edu (Usenet poster)
Reply-To: stark@sbstark (Eugene Stark)
Followup-To: comp.theory
Organization: SUNY at Stony Brook Computer Science Dept.
Lines: 12
In-Reply-To: glenn@dit.lth.se (Glenn Jennings)
Cc: glenn@dit.lth.se

>Can anyone please point me to any *published* works dealing with this issue:
>
>  Is it easy or hard to automatically transform an algorithm which
>  is expressed recursively, into one that is expressed iteratively ?
>
>  Practical results are preferred, but theoretical discussions are still
>helpful.  I am guessing that it is hard (in general) to devise a program 
>which can convert an arbitrary recursive program into one having only loops.  

Isn't this something that is done by nearly every compiler?

							- Gene Stark