[Haskell-cafe] Re: Memoization

[Simon Marlow]

Rodrigo Queiro wrote:
> sorear pointed me to this paper a while ago: 
> http://citeseer.ist.psu.edu/peytonjones99stretching.html
> 
> I never tried any of the code in the end, but it will probably be useful?

An implementation of that memo table scheme can be found here:

http://darcs.haskell.org/testsuite/tests/ghc-regress/lib/should_run/Memo.lhs

It's probably too slow for general use, though.  You might find it useful if 
your keys are huge (or infinite) and comparing them directly is impractical.

Cheers,
	Simon