Re: CL idiom for Scheme's named let
- From: Russell McManus <russell_mcmanus@xxxxxxxxx>
- Date: Sat, 26 Nov 2005 13:43:49 -0500
Marcin 'Qrczak' Kowalczyk <qrczak@xxxxxxxxxx> writes:
> Russell McManus <russell_mcmanus@xxxxxxxxx> writes:
>
>> I'm wondering whether it's possible to write in portable CL
>> named-let such that it guarantees iterative behavior when tail
>> calls are made, supports funcall, and works right for non-tail
>> calls.
>
> It depends which kinds of tail calls are supposed to be guaranteed
> to be run without growing the stack.
The macro that I am thinking of writing would look for combinations
with operators referring to the named let symbol (direct calls in your
parlance), which are also in a tail position, and use a GO in these
cases. There would also be a local function introduced that would be
picked up for all other cases.
I think the above approach would work for example 2 but not example 1.
-russ
.
- References:
- CL idiom for Scheme's named let
- From: Bruce Butterfield
- Re: CL idiom for Scheme's named let
- From: Wade Humeniuk
- Re: CL idiom for Scheme's named let
- From: Kalle Olavi Niemitalo
- Re: CL idiom for Scheme's named let
- From: Wade Humeniuk
- Re: CL idiom for Scheme's named let
- From: Marijn
- Re: CL idiom for Scheme's named let
- From: John Thingstad
- Re: CL idiom for Scheme's named let
- From: Russell McManus
- Re: CL idiom for Scheme's named let
- From: Marcin 'Qrczak' Kowalczyk
- Re: CL idiom for Scheme's named let
- From: Russell McManus
- Re: CL idiom for Scheme's named let
- From: Marcin 'Qrczak' Kowalczyk
- CL idiom for Scheme's named let
- Prev by Date: clisp ffi
- Next by Date: Re: Convert a small piece of code
- Previous by thread: Re: CL idiom for Scheme's named let
- Next by thread: Re: CL idiom for Scheme's named let
- Index(es):