[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Scheme Digest #13
In article <8811212337.AA01324@toucan.LCS.MIT.EDU>, bard@THEORY writes:
>If the typical program structure is LISP-like, it is a long sequence of short
>function declarations followed by a body:
> LET x1 = m1 IN
> LET x2 = m2 IN
> LET xk = mk IN
>which is indeed a deeply nested term, although not quite of the form above.
>All this proves is that you should do something in a way other than the
>theoretician's straightforward translation of LET.
Not necessarily. A better solution (if it works) is working on optimizing
nested terms. This will help efficiency in the general case, not just in the
case of LET. (This is the T/Orbit approach.)