[Haskell-cafe] Re: [newbie question] Memoization automatic in
apfelmus at quantentunnel.de
Sun Jan 13 04:13:36 EST 2008
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
That's not what blueprints were for. You want generalized tries here
Ralf Hinze. Generalizing generalized tries.
as Luke pointed out.
More information about the Haskell-Cafe