[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
In article <9002051741.AA03862@heike.informatik.uni-dortmund.de>
email@example.com (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
Wait, isn't this _required_ of an implementation?
- [no subject]
- From: Holger Muenx <firstname.lastname@example.org>