Re: Implementing Memorize

[Lutz Donnerhacke <lutz@iks-jena.de>]

* Robert I. Eachus wrote:
> Lutz Donnerhacke wrote:
>> Calculating Fibbonacci numbers recursivly is easy but braindead. Languages
>> with access to the symbol table at execution time are able to change the the
>> reccuring call with a memorize wrapper which returns already computed values
>> immediatly instead of recalculating them. In the referenced article I wrote
>> an C-Implementation of such a wrapper. Now I'm looking for a more elegant
>> version in Ada.
>
> Calculating Fibonacci numbers recursively is definitely braindead.  Try
> this approach instead.

I'd like to abstract the problem from fib to an arbitary external provided
recursive function. So I'm looking for an elegant way to define the generic
memorize.