Tree Calculus

6 days ago

Tree Calculus is minimal with a single operator that operates on three values, using a visual tree structure where values are natural binary trees with leaves, stems, and forks.
It is Turing-complete, comparable to combinatory logic with operators S and K, and allows recursive functions to be represented as normal forms via fixpoint constructions.
Tree Calculus is reflective, enabling case analysis on tree structures and self-application for introspection; for example, it can represent natural numbers and compute node counts, facilitating program serialization and analysis.
It is modular, with sub-terms as sub-trees, allowing recursive operations like node counting and supporting the bootstrapping of common functionality without large tree structures.

Hasty Briefsbeta