Brummel
2ed355c6fa
Post-audit downstream-LLM-author field test of the shipped loop/recur surface (DESIGN.md + public examples only). 3 real iterative programs (Newton isqrt, Collatz, Euclidean gcd) + 5 plausible-mistake negatives + 2 no-termination probes, all run through the public ail CLI. 0 bugs. 4 working findings on the milestone's own axes: rejection diagnostics point-exact AND self-fixing; recur tail-position threads through match/let/outer-if (spec only showed if); loop composes as a value sub-expression + byte-stable round-trip; no-termination boundary exact. This empirically substantiates the "LLM author can now write iterative programs" claim. Two orthogonal non-blocking findings, neither in loop/recur scope, both routed to P2 todos (refused the scope creep into a loop/recur tidy): niladic (app f) spec_gap independently re-confirms the existing mut-local-F3 roadmap item (the design-fork decision deliberately NOT auto-ratified under /boss — parked, priority-strengthened); module-level (doc) diagnostic-hint friction (one-line tidy). Boss-verified independently (gcd->27; recur-outside-loop fires exact). The standalone loop/recur milestone is fully ratified and CLOSED: 3 iterations + tidy shipped, audit clean (drift resolved, bench pristine carry-on), fieldtest clean on every axis. Roadmap P0 marked closed.
21 lines
975 B
Plaintext
21 lines
975 B
Plaintext
(module loop_recur_2_collatz
|
|
(fn main
|
|
(doc "Collatz step counts. collatz_len(27)=111, collatz_len(97)=118, collatz_len(1)=0. Expected stdout (per line): 111, 118, 0.")
|
|
(type (fn-type (params) (ret (con Unit)) (effects IO)))
|
|
(params)
|
|
(body
|
|
(seq (app print (app collatz_len 27))
|
|
(seq (app print (app collatz_len 97))
|
|
(app print (app collatz_len 1))))))
|
|
(fn collatz_len
|
|
(doc "Number of Collatz steps to reach 1. Two binders: n (current value) and steps (accumulator). Parity dispatch is a `match` on n%2; the recur lives in the tail of each match arm, not at body toplevel.")
|
|
(type (fn-type (params (con Int)) (ret (con Int))))
|
|
(params start)
|
|
(body
|
|
(loop (n (con Int) start) (steps (con Int) 0)
|
|
(if (app == n 1)
|
|
steps
|
|
(match (app % n 2)
|
|
(case (pat-lit 0) (recur (app / n 2) (app + steps 1)))
|
|
(case _ (recur (app + (app * 3 n) 1) (app + steps 1)))))))))
|