Newsgroups: comp.lang.dylan,comp.lang.lisp,comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!ix.netcom.com!netcom.com!NewsWatcher!user
From: hbaker@netcom.com (Henry Baker)
Subject: Re: Recursion where iteration would do
Message-ID: <hbaker-2803951905020001@192.0.2.1>
Sender: hbaker@netcom15.netcom.com
Organization: nil
References: <18426.9503201324@subnode.aiai.ed.ac.uk> <1995Mar22.171609.167@den.mmc.com> <1995Mar23.150306.4307@VFL.Paramax.COM> <3l1r10$2ib@Yost.com> <3l25ju$2ns@Yost.com> <3l46n2$sq8@tusol.cs.trinity.edu>
Date: Wed, 29 Mar 1995 03:01:15 GMT
Lines: 15
Xref: glinda.oz.cs.cmu.edu comp.lang.dylan:3909 comp.lang.lisp:17230 comp.lang.scheme:12435

In article <3l46n2$sq8@tusol.cs.trinity.edu>,
jhowland@ariel.cs.trinity.edu (John E. Howland) wrote:

> I have experimented with having students explicitly
> write out the continuation of each recursive call to a fn
> as (lambda (z) ...).  Tail recursive functions are easily
> identified when each continuation is the identity function.

Don't you mean that the continuation is _eta-reducible_ -- i.e.,
the continuation is (lambda (x) (c x)), where c is the continuation
function -- in the case of a tail-recursive call???

-- 
www/ftp directory:
ftp://ftp.netcom.com/pub/hb/hbaker/home.html
