[Haskell-cafe] functions making their own memos

Dennis Raddle dennis.raddle at gmail.com
Sun Jul 8 09:28:29 UTC 2018


In this one use case, there might be a simpler solution, but I have
encountered lots of situations in which a particular algorithm could
benefit from an associated stored cache of information. The most natural
way to write an algorithm, sometimes, is in terms of its past decisions or
past state of the program, interacting with current state.

D
‚Äč
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20180708/525adcb6/attachment.html>


More information about the Haskell-Cafe mailing list