Subject: Re: Tail recursion & CL
From: rpw3@rigden.engr.sgi.com (Rob Warnock)
Date: 28 Oct 2001 11:46:32 GMT
Newsgroups: comp.lang.lisp
Message-ID: <9rgr6o$3p1nk$1@fido.engr.sgi.com>
<jrm@itasoftware.com> wrote:
+---------------
| "felix" <felixundduni@freenet.de> writes:
| > Well, thanks! But the idea is entirely Henry Baker's. Chicken is just the
| > first implementation that uses this approach, AFAIK.
| 
| The first Scheme implementation that uses this approach.  I used this
| approach on another language back in 1997.
+---------------

And of course Baker himself used it in 1994 to code Gabriel's "Boyer
Benchmark" in C (hand-compiling/CPS'ing the Lisp).

   Baker, H.G.  "CONS Should Not CONS Its Arguments, Part II: Cheney
   on the M.T.A."  Draft Memorandum, Jan., 1994.  Available from
   ftp://ftp.netcom.com/pub/hb/hbaker/CheneyMTA.ps.Z.

[Archived at <URL:http://linux.rice.edu/~rahul/hbaker/CheneyMTA.html>
or <URL:http://linux.rice.edu/~rahul/hbaker/CheneyMTA.ps.Z>, code at 
<URL:http://linux.rice.edu/~rahul/hbaker/cboyer13.c>.]


-Rob

-----
Rob Warnock, 30-3-510		<rpw3@sgi.com>
SGI Network Engineering		<http://www.meer.net/~rpw3/>
1600 Amphitheatre Pkwy.		Phone: 650-933-1673
Mountain View, CA  94043	PP-ASEL-IA

[Note: aaanalyst@sgi.com and zedwatch@sgi.com aren't for humans ]