Monadic Memoization Mixins

  title={Monadic Memoization Mixins},
  author={Daniel Brown and William R. Cook},
Memoization is a familiar technique for improving the performance of programs: computed answers are saved so that they can be reused later instead of being recomputed. In a pure functional language, memoization of a function is complicated by the need to manage the table of saved answers between calls to the function, including recursive calls within the function itself. A lazy recursive data structure can be used to maintain past answers — although achieving an efficient algorithm can require… CONTINUE READING
4 Citations
24 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 24 references

Memo functions, polytypically! InSecond Workshop on Generic Programming

  • Ralf Hinze
  • 2000
Highly Influential
3 Excerpts

Monadification of functional programs

  • Bryan Ford
  • Sci . Comput . Program .
  • 2004

Jones . Type classes with functional dependencies

  • L. Simon
  • ESOP ’ 00 : Proceedings of the 9 th European…
  • 2000


  • Graham Hutton
  • 2000

Peyton Jones , Simon Marlow , and Conal Elliott . Stretching the storage manager : Weak pointers and stable names in haskell

  • L Simon
  • Implementation of Functional Languages
  • 1999

Similar Papers

Loading similar papers…