Re: A stack overflow problem.

2013-12-05 Thread Ludovic Courtès
rvclay...@verizon.net (R. Clayton) skribis: > $ guile > GNU Guile 2.0.9-deb+1-1 > Copyright (C) 1995-2013 Free Software Foundation, Inc. > > Guile comes with ABSOLUTELY NO WARRANTY; for details type `,show w'. > This program is free software, and you are welcome to redistribute it > un

Re: A stack overflow problem.

2013-12-05 Thread Ludovic Courtès
I should have taken this as an opportunity to mention that the forthcoming Guile 2.1 has expandable stacks: http://wingolog.org/archives/2013/11/26/a-register-vm-for-guile Goodness ahead! Ludo’.

A stack overflow problem.

2013-12-04 Thread R. Clayton
I am running this $ guile -v guile (GNU Guile) 2.0.9-deb+1-1 Copyright (C) 2013 Free Software Foundation, Inc. License LGPLv3+: GNU LGPL 3 or later . This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the exte

Re: stack overflow problem

2006-02-13 Thread Holger Blasum
On 02-05, William Xu wrote: > Yeah, i understand that. But i thought this ought to be done > automatically in some way, not requiring user to do this manually, which > would make codes less readable, isn't it? (debug-set! stack 0) would do the trick (disabling stack depth management) afaik? --

Re: stack overflow problem

2006-02-05 Thread William Xu
Stephen Compall <[EMAIL PROTECTED]> writes: > On Sat, 2006-02-04 at 18:54 +0800, William Xu wrote: >> (define (enumerate-interval low high) >> "Return a sequence list by walking from LOW to HIGH. >> e.g., >> (enumerate-interval 1 10) >> => (1 2 3 4 5 6 7

Re: stack overflow problem

2006-02-04 Thread Stephen Compall
On Sat, 2006-02-04 at 18:54 +0800, William Xu wrote: > (define (enumerate-interval low high) > "Return a sequence list by walking from LOW to HIGH. > e.g., > (enumerate-interval 1 10) > => (1 2 3 4 5 6 7 8 9 10)" > (if (> low high) > '() > (c

Re: stack overflow problem

2006-02-04 Thread Chusslove Illich
> [: William Xu :] > Might be a bug? (i also tested this on mzscheme, and works fine.) > > Guile version: 1.6.7, debian unstable. Same Debian, same Guile, same effect. I guess stack has to go at one point or another, and it is anyway a better idea to use tail recursion: (define (enumerate-interv

stack overflow problem

2006-02-04 Thread William Xu
[i wish i'm not resending this mail..] Hi, I define the following function, (define (enumerate-interval low high) "Return a sequence list by walking from LOW to HIGH. e.g., (enumerate-interval 1 10) => (1 2 3 4 5 6 7 8 9 10)" (if (> low high) '(

stack overflow problem

2006-02-04 Thread William Xu
Hi, I define the following function, (define (enumerate-interval low high) "Return a sequence list by walking from LOW to HIGH. e.g., (enumerate-interval 1 10) => (1 2 3 4 5 6 7 8 9 10)" (if (> low high) '() (cons low (enumerate-interval