[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: CSI LISP
- To: Jonathan A Rees <JAR@MIT-MC>
- Subject: Re: CSI LISP
- From: Jim Meehan <Meehan@YALE.ARPA>
- Date: Fri ,12 Jul 85 14:54:23 EDT
- Cc: T-Discussion@YALE.ARPA, Adams@YALE.ARPA, ANDY@SU-SCORE, linus!ramsdell@MITRE-BEDFORD
- In-reply-to: Jonathan A Rees <JAR@MIT-MC.ARPA>, Fri, 12 Jul 85 10:54:22 EDT
You didn't say anything about tail recursion ...
Right. I'm one of the world's great fans of tail-recursion elimination
(TRE). I'm forever writing programs that implement finite-state
machines and file-transducers with LABELS-forms that depend on TRE,
but most people don't. At the Lisp meeting at AAAI last summer, I
asked the panel of wizards and implementors how they each felt about
TRE, and the consensus was that it was a nice idea but not worth the
trouble, a view I found lamentable. In fact, both VAX LISP and LISP/VM
eliminate *some* cases of tail-recursion (and in VAX LISP, at least,
you can ask for a bigger stack if you run out). So we don't promise
TRE in CSI LISP. I consider that to be a bug that we could fix at
great expense, but the number of people who care about it seems to
be small.
*sigh*
-- Jim
-------