[Shootout-list] Re: OCaml fibonacci entry

[Peter Hinely]

>
> The OCaml fibonacci entry is incorrect.  It uses an iterative loop to
> compute the fibonacci numbers, while the test requires the usual naive
> recursive approach.
>

Good catch.  It should be reverted.

And now for a question: It was my understanding that some of the
functional languages cache the result of a function call for a given
argument(s).  If so, then Fibonacci/Ackermann for those functional
languages are fundamentally different than the same benchmarks in other
languages, right?  Has this topic been discussed before on the shootout
list?

One could conceivably cache the results by hand in other languages.  Is
that allowed?

Regards,
Peter