Hi All,
My name's Jason. I'm new to Scheme, but am definitely a fan! It seems
to me that extensible and embeddable frameworks are the new
programming model for the 21st century. I'd like to see guile grow in
this respect, and am able to contribute however possible. :)
I've recently got guile 1.6 built from sources on my mac, and am
working on getting 1.8 set up on my freebsd machine.
Initially, I'd like to take a look at why guile bombs on recursive
algorithms. For example:
(define fact
(lambda (n)
(cond
((= n 1) 1)
(else
(* n (fact (- n 1)))))))
guile> (fact 69)
171122452428141311372468338881272839092270544893520369393648040923257279754140647424000000000000000
guile> (fact 70)
ERROR: Stack overflow
ABORT: (stack-overflow)
This does not seem right... I can rework fact to use an accumulator,
but that seems a big kludgy, especially since I can run this same
program under chicken with an aguments well into the thousands without
any problems (aside from returning infinity as the result, that is!
;))
Anyway, I'm looking forward to learning more about this software.Thanks
-Jason
_______________________________________________
Guile-devel mailing list
Guile-devel@gnu.org
http://lists.gnu.org/mailman/listinfo/guile-devel
