Path: utzoo!attcan!uunet!snorkelwacker!apple!voder!nsc!amdahl!pacbell!osc!jgk
From: jgk@osc.COM (Joe Keane)
Newsgroups: comp.lang.scheme
Subject: Re: (none)
Message-ID: <2008@osc.COM>
Date: 7 Feb 90 21:36:48 GMT
References: <9002051741.AA03862@heike.informatik.uni-dortmund.de>
Organization: Object Sciences Corp., Menlo Park, CA
Lines: 9
In-reply-to: muenx@heike.informatik.uni-dortmund.de's message of 5 Feb 90 17:41:57 GMT

In article <9002051741.AA03862@heike.informatik.uni-dortmund.de>
muenx@heike.informatik.uni-dortmund.de (Holger Muenx) writes:
>At first, it is possible to implement scheme that tail recursions (means
>recursions of iterative nature, needing only a constant amount of memory)
>really work without allocating new memory during every recursive application.
>In Abelson + Sussman it is said it is possible and I think in MIT-Scheme it
>is done.

Wait, isn't this _required_ of an implementation?