Stackless Python, Tail Recursion and Functional Programming
Christian Tismer
tismer at tismer.com
Mon Jan 13 18:45:11 EST 2003
beno wrote:
> At 03:48 PM 1/11/2003 -0800, you wrote:
>
>> On Sat, 11 Jan 2003 01:18:05 -0400, in comp.lang.python you wrote:
>>
>> >Hi;
>> >Someone wrote me from this list advising me to drop my passion for
>> >functional programming because Python doesn't optimize for it. Then I
>> >remembered Cameron Laird's *Stackless Python*. Doesn't this take care of
>> >this problem by converting the stack into a tree, just like XSLT?
>>
>> Yes, it takes care of the recursion problem. It's _Christian Tismer_
>> who wrote it, however.
>
>
> Okay, okay, apologies to Christian Tismer already <g>. But now I almost
> feel like taking a poll because I've received so many conflicting
> reports <g>. Guess I'll have to dig a little deeper.
Did you say I should post a little more info
about Stackless? I guess, yes.
Will do -- sorry - chris
More information about the Python-list
mailing list