[plt-scheme] begin0 and tail recursion

From: Stefan Ottosson (sot at lysator.liu.se)
Date: Sun Jul 20 11:10:20 EDT 2003

On Sun, 20 Jul 2003, Robby Findler wrote:

> It isn't a tail call because it must evaluate E1, then evaluate E2, and
> then return E1's result.

Ok, so I was being naive then. Hmm.. I guess there's just no way to do
something like pop a stack after the tail call, but still return the value
of the tail call, without turning it into a recursive process?

Posted on the users mailing list.