Re: Tail recursion

russell kym horsell <>
4 Nov 2006 23:20:17 -0500

          From comp.compilers

Related articles
[3 earlier articles]
Re: Tail recursion (Toon Moene) (2000-08-14)
Re: Tail recursion (2000-08-21)
Re: Tail recursion (Wilco Dijkstra) (2000-08-21)
Re: Tail recursion (2000-08-21)
Re: Tail recursion (2000-09-08)
Tail recursion (jjb) (2006-11-04)
Re: Tail recursion (russell kym horsell) (2006-11-04)
Re: Tail recursion (2006-11-05)
Re: Tail recursion (Oliver Wong) (2006-11-08)
Re: Tail recursion (=?ISO-8859-1?Q?J=FCrgen_B=F6hm?=) (2007-02-04)
| List of all articles for this month |

From: russell kym horsell <>
Newsgroups: comp.compilers
Date: 4 Nov 2006 23:20:17 -0500
Organization: Central Iowa (Model) Railroad, Plano, TX, USA
References: 06-11-018
Keywords: optimize, theory
Posted-Date: 04 Nov 2006 23:20:17 EST

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.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.