I have this naive intuition that graphs are a universal encoding scheme, all theorems of category theory can be expressed as graphs, with the implication there is a massive unifying leap forward in maths that will result from expressing existing problems in terms that are consistent with such a representation. Maybe it's literary sci fi handwaving, but there must be a rules based level of abstraction that contains all we can conceive of and express. These diagrams appear to be an example of it.
Is there are relationship between the lambda calculus and Brainfuck and other few instruction set languages?<p>Edit: well, an easy find, <a href="https://esolangs.org/wiki/Lambda_Calculus_to_Brainfuck" rel="nofollow">https://esolangs.org/wiki/Lambda_Calculus_to_Brainfuck</a>
Another approach for visualizing lambda calculus is presented in <a href="https://ycombinator.chibicode.com/functional-programming-emojis" rel="nofollow">https://ycombinator.chibicode.com/functional-programming-emo...</a> .<p>It looks quite different and I wonder which one is better? Or are they the same really?
A js lambda to graphs parser and reducer
<a href="https://mbuliga.github.io/quinegraphs/lambda2mol.html" rel="nofollow">https://mbuliga.github.io/quinegraphs/lambda2mol.html</a>