View source for Natural 2D visualization of 1D bit data

'''Natural 2D visualization of 1D bit data.'''

'''Question:''' How can a one dimensional stream of data be displayed as 2D visual graphic in the most natural way <br>
when there is no information at all provided about correct interpretation?

Specifically: <br>
How could the progression of evaluation of an untyped lambda expression be <br>
most naturally mapped to a black and white pixels 2D visualization?

----

The right approach cannot involve any 2D array type interpretation since this introduces <br>
an arbitrary line-end wraparound length.
Rather one wants to use an in-an-obvious-natural-way serializable representation of 2D bit data that <br>
does not contain an arbitrary line-end wraparound length. <br>
Tries/MemoTries might do the trick.

In a sequence of evaluations of a [[lambda calculus]] expressions much of the structure often stays static and unchanged. <br>
So one might want to visualize the differences instead. 

== Related ==

* [[A more natural data representation for array and tensor datastructures]] {{wikitodo|Make that page and link Conal Elliots paper. And back-link here.}}
* [[A true but useless theory of everything]]
* [[The program of all programs (code)]]
* [[Fractals]]

== Related ==

* 2021 [https://github.com/conal/talk-2021-can-tensor-programming-be-liberated 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

[[Category:Conal Elliott]]