[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Function Cell Follow-up
- To: shebs%utah-orion@UTAH-CS.ARPA, DCP@SCRC-QUABBIN.ARPA, JAR@mc.lcs.mit.edu
- Subject: Re: Function Cell Follow-up
- From: Guy Steele <gls@THINK-AQUINAS.ARPA>
- Date: Fri, 28 Feb 86 14:44 EST
- Cc: common-lisp@SU-AI.ARPA, gls@THINK-AQUINAS.ARPA
- In-reply-to: <8602250156.AA26504@utah-orion.ARPA>
Date: Mon, 24 Feb 86 18:56:14 MST
From: shebs%utah-orion@utah-cs.arpa (Stanley Shebs)
Date: Mon, 24 Feb 86 20:28:33 EST
From: Jonathan A Rees <JAR@MC.LCS.MIT.EDU>
Date: Mon, 24 Feb 86 15:56 EST
From: David C. Plummer <DCP at SCRC-QUABBIN.ARPA>
Is tail recursion REQUIRED of Scheme implementations, or is just in all
the papers because it is easy to do in most Scheme implementations.
It's absolutely as essential as garbage collection. [...]
I recall reading some old Lisp Machine papers that suggested
garbage collection should be avoided (DDI = Don't Do It!) :-) :-)
stan
Probably you are thinking of JONL White's paper in the 1980 Lisp Conference.
--Guy