From: kym@ukato.freeshell.org   
      
   jjb  wrote:   
   > Hello!   
   > Recently I read about "tail recursion" (in SICP) - ability of   
   > programming language realization to convert linear recursive proccess   
   > to linear iterative proccess. So I tried to find formal algorithm of   
   > this transformation for any function written using functional paradigm   
   > but I failed. May be someone can help me?   
   [...]   
      
   Formal theory is covered in many textbooks on functional programming.   
   Treatments of "FP" and "ML" used to cover this.   
      
   Algebra is pretty simple in functional languages.   
      
   There's also something called "concatenated languages" where the   
   algebra is even easier.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)