[Haskell-cafe] Re: [newbie question] Memoization automatic in Haskell?

Henning Thielemann wrote:

David Benbennick wrote:

...

But how can I implement memoization for a more complicated function? For example, perhaps I want to memoize

f :: String -> Int -> Double -> String -> Bool

There was a long thread about a sophisticated technique called "blue prints", which allows you to use binary search trees as memoizing structure. http://www.haskell.org/pipermail/haskell-cafe/2006-September/018204.html

That's not what blueprints were for. You want generalized tries here Ralf Hinze. Generalizing generalized tries. http://www.informatik.uni-bonn.de/~ralf/publications/GGTries.ps.gz as Luke pointed out. Regards, apfelmus