Tensors as trie datastructures rather than arrays (Conal Elliott)

From apm

Revision as of 14:04, 11 August 2025 by Apm (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

This article is a stub. It needs to be expanded.

(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"

Trie datastructure

Wikipedia: https://de.wikipedia.org/wiki/Trie
Haskell library MemoTrie: https://hackage.haskell.org/package/MemoTrie

Retrieved from "https://apm.bplaced.net/w/index.php?title=Tensors_as_trie_datastructures_rather_than_arrays_(Conal_Elliott)&oldid=18525"