Tree Calculus is a powerful and unique system that captures computation using one operator, making it Turing-complete and intensional. It allows for program analysis without quotation, supporting type systems and gradual typing seamlessly. The ability to reflect on programs within the reduction rules enables everything from type checking to compilation and optimization without external tools. Tree Calculus is concise, with a simple abstract syntax of unlabeled binary trees, making it great for formal specifications and education. Its minimal syntax and self-contained semantics make it portable and easy to write interpreters on any platform or in any programming language. Despite its simplicity, Tree Calculus is not a Turing tarpit, boasting asymptotically optimal data encodings and algorithms. Contact [email protected] for more information.
https://treecalcul.us/