[plt-scheme] Lazy evaluation and tail calls

From: Grant Rettke (grettke at acm.org)
Date: Sat Jan 17 11:42:31 EST 2009

On Sat, Jan 17, 2009 at 8:42 AM, James Coglan <jcoglan at googlemail.com> wrote:
> I have a factorial function that runs iteratively in eager mode, but it blows up the stack in lazy mode.
> I was wondering whether it's possible to have tail call optimisation when using normal order.

Do you want to add a construct to allow for the programmer to specify
that something be eagerly evaluated in lazy mode, or you want the
interpreter to perform that step automically?

I think that Haskell and Lazy Scheme offer the former but I'm not any
more familiar than that.

Posted on the users mailing list.