Re: Tail recursion

=?ISO-8859-1?Q?J=FCrgen_B=F6hm?= <jboehm@gmx.net>
4 Feb 2007 20:27:59 -0500

          From comp.compilers
Related articles
[6 earlier articles]
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)
| List of all articles for this month |
From: =?ISO-8859-1?Q?J=FCrgen_B=F6hm?= <jboehm@gmx.net>
Newsgroups: comp.compilers
Date: 4 Feb 2007 20:27:59 -0500
Organization: T-Online
References: 06-11-018 06-11-025
Keywords: optimize
Posted-Date: 04 Feb 2007 20:27:59 EST

diablovision@yahoo.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?
>
> Look up continuation passing style.


A "recipe" for converting to Continuation Passing Style (CPS) is given
in the slides (.pdf file) explaining the "90 minutes scheme compiler"
at


http://www.iro.umontreal.ca/~boucherd/mslug/meetings/20041020/minutes-en.html


I found the explanations there very helpful for my own (Lisp-)Compiler
project.


Greetings


Jürgen


--
Jürgen Böhm www.aviduratas.de

Post a followup to this message

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