Description
A Haskell library with combinators for building memo tables. Memoization stores previous results so repeated calls with the same input can be returned faster.
Developers use it for dynamic programming, recursive algorithms, parsers, and expensive pure computations. Memo tables can trade memory for speed, so workloads should be checked for growth and cache lifetime.