Tensors as trie datastructures rather than arrays (Conal Elliott)
Jump to navigation
Jump to search
(wiki-TODO: Add some explanantions.)
Related
- Natural 2D visualization of 1D bit data
- Programming as closest thing to real world magic (somewhat redundant)
Related
- 2021 Can Tensor Programming Be Liberated from the Fortran Data Paradigm? (github shownotes)
Conal Elliott (draft 2018) – "Data-Parallel Programming without Arrays"
- http://conal.net/papers/data-parallel-programming-without-arrays/
- http://conal.net/papers/data-parallel-programming-without-arrays/data-parallel-programming-without-arrays.pdf
Trie datastructure
- Wikipedia: https://de.wikipedia.org/wiki/Trie
- Haskell library MemoTrie: https://hackage.haskell.org/package/MemoTrie