Tom writes: > > I want to use the memo function for implementing a dynamic > > programming algorithm in Haskell. > > This is needed to cache intermediate results. > > Can anyone tell me where I can find some examples that use the memo > > function or even a tutorial.
You should also look at Stretching the storage manager: weak pointers and stable names in Haskell Simon Peyton Jones, Simon Marlow, Conal Elliott IFL'99 http://research.microsoft.com/Users/simonpj/Papers/weak.htm which gives an example of a general memoising function "memo", which uses weak pointers to manage storage sensibly. --KW 8-) -- Keith Wansbrough <[EMAIL PROTECTED]> http://www.cl.cam.ac.uk/users/kw217/ University of Cambridge Computer Laboratory. _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
