tuna

a standalone tree-calculus evaluator habitat. programs are trees; the calculus in two lines:

Leaf | Stem of t | Fork of t * t
0 = leaf, 1+child = stem, 2+left+right = fork (canonical ternary)

A step is one triage-rule firing; the two wrapper applications are application, not steps — so step counts are an invariant of the calculus, not of the engine. Every run is journaled and replayable.

The book (tuna.borg + borg/*.borg) is the source of truth; it ships inside the source tarball.