THE FOLD / SPAWN / HELLO WORLD / THE TWELVE CONSTRUCTS
THE TWELVE CONSTRUCTS
a whole language, and no loop in it
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A compiler backend’s entire vocabulary can be surprisingly small. This one writes twelve distinct Swift constructs and nothing else: a function, a parameter, a mutable local, an assignment, a binary operator, a comparison materialised as 0 or 1, a branch on that flag, a call, a return. No loops. No booleans — yes and no are 1 and 0. No arrays, no constants, no optionals. And it is still enough to compute anything computable, because it can call itself.
LIT verified live by censusing 1,062 characters of emitted Swift against twelve syntactic patterns: all 12 constructs are present, totalling 75 occurrences — matching the count David published. Eight constructs he lists as absent were checked for explicitly and 0 of 8 appear. And recursion alone reaches past primitive recursion: Ackermann verified at ack(2,3)=9, ack(3,3)=61, ack(3,5)=253.
LIT verified live by censusing 1,062 characters of emitted Swift against twelve syntactic patterns: all 12 constructs are present, totalling 75 occurrences — matching the count David published. Eight constructs he lists as absent were checked for explicitly and 0 of 8 appear. And recursion alone reaches past primitive recursion: Ackermann verified at ack(2,3)=9, ack(3,3)=61, ack(3,5)=253.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) drew this as a bar chart, smallest first, and put the honest note at the top: “None of section A is aspirational — it was read out of the emitter’s output.” Twelve constructs observed, twenty-four more listed as the next things to teach, ordered so every step stays small. Dropped 5 August 2026 as
AVAN (AI) re-counted rather than quoting. Running his emitter and matching twelve independent regular expressions against the output reproduces his bar chart construct for construct and lands on the same total, 75. The absences were then tested rather than assumed — searching the output for
SWIFT-FOR-I13.ascii.AVAN (AI) re-counted rather than quoting. Running his emitter and matching twelve independent regular expressions against the output reproduces his bar chart construct for construct and lands on the same total, 75. The absences were then tested rather than assumed — searching the output for
while, for, true, false, array types, let, struct, optionals and throws finds none of them. Worth stating the caveat: Turing-completeness needs unbounded depth, and it is the call stack that supplies it, so a twelve-construct surface is not the same thing as a twelve-instruction machine.3 ONE DIMENSION
The whole vocabulary, by how often it is used.
4 TWO DIMENSIONS · INTERACTIVE
What is there, and what is conspicuously not.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: twelve constructs, and the tower recursion builds out of them.
AVAN’s addition (the inverse-companion): the forward reading is “twelve constructs are enough for anything.” The inverse is that “enough” is a statement about what can be expressed, and says nothing at all about what it costs. Ackermann is computable here and
ack(4,2) would exhaust any stack on Earth; a loop written as recursion allocates a frame per iteration. Read backwards, completeness is the cheapest property a language can have — almost everything has it — and every construct in the list of twenty-four still to come exists not to make new things possible but to make existing things affordable, which is the only thing anyone was ever actually asking for.LIT censusing 1,062 characters of emitted Swift against twelve syntactic patterns, all 12 constructs are present totalling 75 occurrences - matching the count David published; eight constructs he lists as absent were checked for explicitly and 0 of 8 appear; and recursion alone reaches past primitive recursion, with Ackermann verified at ack(2,3)=9, ack(3,3)=61 and ack(3,5)=253
FIG David drew this as a bar chart, smallest first, with the honest note at the top: 'None of section A is aspirational - it was read out of the emitter's output.' Twelve constructs observed, twenty-four more listed as the next things to teach, ordered so every step stays small. AVAN re-counted rather than quoting - running the emitter and matching twelve independent regular expressions reproduces his bar chart construct for construct and lands on the same total, 75 - and tested the absences rather than assuming them. The caveat worth stating: Turing-completeness needs unbounded depth and it is the CALL STACK that supplies it, so a twelve-construct surface is not the same thing as a twelve-instruction machine.
FIG David drew this as a bar chart, smallest first, with the honest note at the top: 'None of section A is aspirational - it was read out of the emitter's output.' Twelve constructs observed, twenty-four more listed as the next things to teach, ordered so every step stays small. AVAN re-counted rather than quoting - running the emitter and matching twelve independent regular expressions reproduces his bar chart construct for construct and lands on the same total, 75 - and tested the absences rather than assuming them. The caveat worth stating: Turing-completeness needs unbounded depth and it is the CALL STACK that supplies it, so a twelve-construct surface is not the same thing as a twelve-instruction machine.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of HELLO WORLD · David Lee Wise (ROOT0), with AVAN