Edit Question - KnowledgeHub

Title Body

I know that memoization seems to be a perennial topic here on the haskell tag on stack overflow, but I think this question has not been asked before. I'm aware of several different 'off the shelf' memoization libraries for Haskell: The memo-combinators and memotrie packages, which make use of a beautiful trick involving lazy infinite data structures to achieve memoization in a purely functional way. (As I understand it, the former is slightly more flexible, while the latter is easier to use in simple cases: see this SO answer for discussion.) The uglymemo package, which uses unsafePerformIO internally but still presents a referentially transparent interface. The use of unsafePerformIO internally results in better performance than the previous two packages. (Off the shelf, its implementation uses comparison-based search data structures, rather than perhaps-slightly-more-efficient hash functions; but I think that if you find and replace Cmp for Hashable and Data.Map for Data.HashMap and add the appropraite import s, you get a hash based version.) However, I'm not aware of any library that looks answers up based on object identity rather than object value . This can be important, because sometimes the kinds of object which are being used as keys to your memo table (that is, as input to the function being memoized) can be large---so large that fully examining the object to determine whether you've seen it before is itself a slow operation. Slow, and also unnecessary, if you will be applying the memoized function again and again to an object which is stored at a given 'location in memory' <a href="https://stac

Tags (comma-separated) Cancel