Description
Provides a memoization monad transformer for Haskell. Memoization stores previous computation results so repeated requests for the same input can be answered faster.
It is useful for recursive algorithms, dynamic programming, parsers, search, and expensive pure computations wrapped in a monadic structure. It is a developer library and has no standalone interface.