|[3 earlier articles]|
|Re: Tail recursion firstname.lastname@example.org (Toon Moene) (2000-08-14)|
|Re: Tail recursion email@example.com.OZ.AU (2000-08-21)|
|Re: Tail recursion Wilco.Dijkstra@arm.com (Wilco Dijkstra) (2000-08-21)|
|Re: Tail recursion firstname.lastname@example.org (2000-08-21)|
|Re: Tail recursion email@example.com (2000-09-08)|
|Tail recursion Alexey.Mikhailov@gmail.com (jjb) (2006-11-04)|
|Re: Tail recursion firstname.lastname@example.org (russell kym horsell) (2006-11-04)|
|Re: Tail recursion email@example.com (2006-11-05)|
|Re: Tail recursion firstname.lastname@example.org (Oliver Wong) (2006-11-08)|
|Re: Tail recursion email@example.com (=?ISO-8859-1?Q?J=FCrgen_B=F6hm?=) (2007-02-04)|
|From:||russell kym horsell <firstname.lastname@example.org>|
|Date:||4 Nov 2006 23:20:17 -0500|
|Organization:||Central Iowa (Model) Railroad, Plano, TX, USA|
|Posted-Date:||04 Nov 2006 23:20:17 EST|
jjb <Alexey.Mikhailov@gmail.com> wrote:
> 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.
Return to the
Search the comp.compilers archives again.