[Texmacs-dev] Efficiency of scheme implementation

[Joris van der Hoeven]

Hi *,

I have been benchmarking a few Scheme implementations.
I used the computation of Fibonacci numbers as a benchmark:

(define (fib n) (if (< n 2) 1 (+ (fib (- n 1)) (fib (- n 2)))))

Here are some (approximate) timings for (fib 35):

        Guile           37 sec
        Scheme 48       17 sec
        MzScheme         8 sec

Whenever we have time to implement another Scheme backend,
it thus seems that MzScheme remains the best choice.
Maybe someone knows of some more classical benchmarks for
Scheme implementations?

Best wishes, Joris