MemoTrie: Difference between revisions
No edit summary |
(links to blog posts and vector-space) |
||
| 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] | ||
* [http://citeseer.ist.psu.edu/233124.html Generalizing Generalized Tries] | * [http://citeseer.ist.psu.edu/233124.html Generalizing Generalized Tries] | ||
* Related [http://conal.net/blog/tag/tries/ blog posts]. | |||
* Use of MemoTrie in [[vector-space]]. | |||
Revision as of 16:58, 21 October 2008
Abstract
MemoTrie is functional library for creating efficient memo functions, using tries. It's based on some code I got from Spencer Janssen and uses type families.
Besides this wiki page, here are more ways to find out about MemoTrie:
- Read the library documentation.
- Get the code repository: darcs get http://code.haskell.org/MemoTrie.
- Install from Hackage.
- See the version history.
Please leave comments at the Talk page.
See also
- An associated data type example
- Generalizing Generalized Tries
- Related blog posts.
- Use of MemoTrie in vector-space.