My burgeoning conjecture (as hinted at in a previous comment) is that all can be unified, transformed, and optimized for modern hardware under the matrix model of computation -- type theory, the lambda calculus, the actor model, neural nets, graph computing -- I'm starting to see a path to where all models are aligned across vectors of unity.
Here are some the correspondences I've been looking at...
* Graph algos in the lang of linear algebra now realized and encoded into GraphBLAS [1]
* The three normed division algebras are unified under a complex Hilbert space [2]
* Ascent sequences and the bijections discovered between four classes of combinatorial objects [3]
* Dependent Types and Homotopy Type Theory [4]
* Bruhat–Tits buildings, symmetry, and spatial decomposition [5]
* Distributed lattices, topological encodings, and succinct representations [6]
* Zonotopes and Matroids and Minkowski Sums [7]
* Holographic associative memory and entanglement renormalization [8]
Can you expand on what you mean? What is "the matrix model of computation" and "vectors of unity"?
Which actor model are you talking about? The variants are very different and Hewitt's original paper is mainly referenced for coming up with the name rather and kicking off the field than inventing a usable model.
Type theory is even vaster. Are we talking homotopy type theory? Calculus of constructions? System F?
Basically, it's a calculus of constructions that guarantees equivalent funtions get compiled to the same thing. It's really intended as an intermediate form for some higher-level language, and we have Annah as just such an example:
code -tx-> polynomial -tx-> simplification -tx-> [possibly more efficient] code