Difference between revisions of "MemoTrie"
Jump to navigation
Jump to search
(links to blog posts and vector-space) |
m |
||
| Line 3: | Line 3: | ||
== Abstract == |
== Abstract == |
||
| − | '''MemoTrie''' is functional library for creating efficient memo functions, using [http://en.wikipedia.org/wiki/Trie trie]s. It's based on some code |
+ | '''MemoTrie''' is functional library for creating efficient memo functions, using [http://en.wikipedia.org/wiki/Trie trie]s. It's based on [http://hpaste.org/3839 some code] from Spencer Janssen and uses type families. |
Besides this wiki page, here are more ways to find out about MemoTrie: |
Besides this wiki page, here are more ways to find out about MemoTrie: |
||
| Line 16: | Line 16: | ||
* [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:// |
+ | * Ralf Hinze's ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.223 Generalizing Generalized Tries]'' |
* Related [http://conal.net/blog/tag/tries/ blog posts]. |
* Related [http://conal.net/blog/tag/tries/ blog posts]. |
||
* Use of MemoTrie in [[vector-space]]. |
* Use of MemoTrie in [[vector-space]]. |
||
Revision as of 17:08, 21 October 2008
Abstract
MemoTrie is functional library for creating efficient memo functions, using tries. It's based on some code 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
- Ralf Hinze's Generalizing Generalized Tries
- Related blog posts.
- Use of MemoTrie in vector-space.