Re: Desperate Questions: [1]Absolute-Child-Number

[Paul Prescod <papresco@xxxxxxxxxxxxxxxxxxxxxxxxx>]

Frank Christoph wrote:
> It's not in tail-recursive form, but any self-respecting (eager) functional
> compiler will transform such definitions into tail-recursive form, usually by
> using something called the CPS transformation.  

Thanks for the reminder. I've heard about CPS transformation (and even
had the CPS of the Y-combinator memorized at one time) but I would be
surprised if most DSSSL implementations would do it. My understanding is
that CPS is typically only used in real compilers and not in
interpreters. On the other hand, call/cc is a standard part of Scheme,
(but not DSSSL) so I guess Scheme interpreter writers find a way to
implement continuations.

 Paul Prescod


 DSSSList info and archive:  http://www.mulberrytech.com/dsssl/dssslist