Related articles |
---|
[4 earlier articles] |
Re: Tail recursion fjh@cs.mu.OZ.AU (2000-08-21) |
Re: Tail recursion Wilco.Dijkstra@arm.com (Wilco Dijkstra) (2000-08-21) |
Re: Tail recursion mrs@kithrup.com (2000-08-21) |
Re: Tail recursion ian0kerr@my-deja.com (2000-09-08) |
Tail recursion Alexey.Mikhailov@gmail.com (jjb) (2006-11-04) |
Re: Tail recursion kym@ukato.freeshell.org (russell kym horsell) (2006-11-04) |
Re: Tail recursion diablovision@yahoo.com (2006-11-05) |
Re: Tail recursion owong@castortech.com (Oliver Wong) (2006-11-08) |
Re: Tail recursion jboehm@gmx.net (=?ISO-8859-1?Q?J=FCrgen_B=F6hm?=) (2007-02-04) |
From: | diablovision@yahoo.com |
Newsgroups: | comp.compilers |
Date: | 5 Nov 2006 23:36:07 -0500 |
Organization: | Compilers Central |
References: | 06-11-018 |
Keywords: | analysis |
Posted-Date: | 05 Nov 2006 23:36:07 EST |
> 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?
Look up continuation passing style.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.