Xref: utzoo comp.theory:1427 comp.lang.functional:580
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!zaphod.mps.ohio-state.edu!rpi!uupsi!sunic!lth.se!newsuser
From: glenn@dit.lth.se (Glenn Jennings)
Newsgroups: comp.theory,comp.lang.functional
Subject: recursive =?=> iterative ?
Message-ID: <1991Jan17.160716.292@lth.se>
Date: 17 Jan 91 16:07:16 GMT
Sender: newsuser@lth.se (LTH network news server)
Reply-To: glenn@DNA.LTH.Se ()
Organization: Lund Institute of Technology, Sweden
Lines: 15

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.  
  Please reply by email to glenn@dit.lth.se    THANK YOU !
-- 

     Glenn  Jennings       DSt/LTH       Tel:     (+46) 46 109763
     Dept. of Computer Engineering       Fax:     (+46) 46 104714
     Box  118,    Lund  University       Email:  glenn@dit.lth.se
     S-221 00     Lund,     SWEDEN