Re: Stack overflow in relatively simple programs
- From: Pascal Bourguignon <pjb@xxxxxxxxxxxxxxxxx>
- Date: Sun, 31 Dec 2006 05:08:54 +0100
Dan Bensen <randomgeek@xxxxxxxxxxxxxx> writes:
fairchild.anthony@xxxxxxxxx wrote:
I believe this is more a problem with your algorithms and not Lisp.
Nothing but tail calls there. What's wrong with them?
Common Lisp doesn't specify anything relative to tail calls.
Implementations don't necessarily implement tail call optimization.
clisp doesn't on interpreted code, to ease debugging.
In any case, what's recursive in primes?
--
__Pascal Bourguignon__ http://www.informatimago.com/
Litter box not here.
You must have moved it again.
I'll poop in the sink.
.
- Follow-Ups:
- Re: Stack overflow in relatively simple programs
- From: Dan Bensen
- Re: Stack overflow in relatively simple programs
- From: Timofei Shatrov
- Re: Stack overflow in relatively simple programs
- References:
- Stack overflow in relatively simple programs
- From: robinganemccalla@xxxxxxxxx
- Re: Stack overflow in relatively simple programs
- From: fairchild . anthony
- Re: Stack overflow in relatively simple programs
- From: Dan Bensen
- Stack overflow in relatively simple programs
- Prev by Date: Re: Stack overflow in relatively simple programs
- Next by Date: Re: Stack overflow in relatively simple programs
- Previous by thread: Re: Stack overflow in relatively simple programs
- Next by thread: Re: Stack overflow in relatively simple programs
- Index(es):
Relevant Pages
|
|