From: WJ <w_a_x_man@...>
Date: 2011-04-19T07:34:15+09:00
Subject: Re: Tail Call Optimization (Tail Recursion)

Louis-Philippe wrote:

> 
> otherways, I have MacRuby, Racket and Haskell in their tail recursive fib
> solving routine, no results yet but all are still working...

I'm surprised that they are still working. Gambit Scheme takes
very little time for this.

(define (fib n a b)
  (if (zero? n)
    b
    (fib (- n 1) b (+ a b))))

(time
  (let ((bigfib (fib 50000 0 1)))
    #t))

  ==>

    453 ms real time
    454 ms cpu time (438 user, 16 system)
    762 collections accounting for 141 ms real time (125 user, 16 system)
    119074992 bytes allocated
    no minor faults
    no major faults