[Shootout-list] Re: fibonacci and ackermann

[Alan Post]

In article <396d2908050403182054103b5f@mail.gmail.com>, Robert Seeger wrote:
> I guess my overall complain is that Ackermann tends to test the
> compiler's ability to optimize tail calls and memoization more than
> it does the actual cost of recursion.

Do any of the language implementations memoize automatically in this
way?  Certainly the subset with which I am familiar (C, Perl, C++,
Java, OCaml) do not.

  Alan