LISP is postorder evaluation order of a tree. We can go further and more mind expansive than this! The future I am trying to design is a language where travers

LISP is postorder evaluation order of a tree. We can go further and more mind expansive than this! The future I am trying to design is a language where traversal order is arbitrarily repetitive and arbitrary and corecursive and has term rewriting traversals. I think algorithms are just reified traversal evaluation orders and joins - of algebra and mathematics.