Difference between revisions of "MemoTrie"

From HaskellWiki
Jump to navigation Jump to search
(Hinze's other paper on tries, specifically with application to memoization)
(blog posts tag tweak)
Line 17: Line 17:
 
* [http://www.haskell.org/haskellwiki/GHC/Indexed_types#An_associated_data_type_example An associated data type example]
 
* [http://www.haskell.org/haskellwiki/GHC/Indexed_types#An_associated_data_type_example An associated data type example]
 
* Ralf Hinze's ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.223 Generalizing Generalized Tries]'' and [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3272 ''Memo functions, polytypically!'']
 
* Ralf Hinze's ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.223 Generalizing Generalized Tries]'' and [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3272 ''Memo functions, polytypically!'']
* Related [http://conal.net/blog/tag/tries/ blog posts].
+
* Related [http://conal.net/blog/tag/trie/ blog posts].
 
* Use of MemoTrie in [[vector-space]].
 
* Use of MemoTrie in [[vector-space]].

Revision as of 04:46, 2 December 2009


Abstract

MemoTrie is functional library for creating efficient memo functions, using tries. It's based on some code from Spencer Janssen (originally put on hpaste.org, now expired) and uses type families.

Besides this wiki page, here are more ways to find out about MemoTrie:

Please leave comments at the Talk page.

See also