Hi Tom,
I want to use the memo function for implementing a dynamic programming algorithm in Haskell.
This is needed to cache intermediate results.
Can anyone tell me where I can find some examples that use the memo function or even a tutorial.
Here are some refs
Hughes, 1985.
@inproceedings{hughes:lazy-memo,
TITLE = {{Lazy Memo-functions}},
AUTHOR = {R. J. M. Hughes},
BOOKTITLE = {{Proceedings 1985 Conference on Functional Programming Languages and Computer Architecture}},
ADDRESS = {Nancy, France},
YEAR = {1985}
}
(I think this appeared in LNCS)
or
Ralf Hinze. Memo functions, polytypically!. In Johan Jeuring, editor, Proceedings of the Second Workshop on Generic Programming, WGP 2000, Ponte de Lima, Portugal, 6th July 2000, see http://www.cs.uu.nl/~johanj/wgp2000/wgp2000cfp.html#Programme
Cheers,
Johan _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
