Brummel
72e54f4fd3
The surface-form file extension changes from .ailx to .ail. AILang's
authoring surface now uses the same .ail stem as its canonical JSON
form (.ail.json), giving the language a single coherent extension
family: .ail is the LLM-authored Form A, .ail.json is the canonical
JSON-AST Form B.
Scope (touched):
- 61 example renames examples/**/*.ailx → .ail (git mv)
- 1 rename experiments/.../rendered/ailx.md → ail.md
- 35 content-edited live-toolchain files (crates/, docs/DESIGN.md,
docs/roadmap.md, docs/PROSE_ROUNDTRIP.md, skills/, bench/reference/*.c,
experiment crates under experiments/.../{render,harness,master})
- Experiment-crate cohort rename Cohort::Ailx → Cohort::Ail,
Form::Ailx → Form::Ail, per_cohort/ailx → per_cohort/ail,
{form-only: ailx} → {form-only: ail}, ```ailx → ```ail
Out of scope (deliberately untouched, to preserve honest history):
- docs/journal-archive.md (content-frozen per CLAUDE.md)
- docs/journals/, docs/specs/, docs/plans/, bench/orchestrator-stats/
- experiments/.../runs/ (frozen LLM-output artefacts; models actually
saw .ailx — renaming would falsify the experimental record)
Verification: cargo build/test --workspace green; experiment crate
cargo test green; bench/check.py + compile_check.py + cross_lang.py
all 0-regressed; negative grep for ailx|Ailx|AILX outside the
out-of-scope paths returns zero matches.
Opens immediate follow-up: roadmap.md P2 todo `ail check`/build/run
accept .ail extension — after this rename, .ail is canonical
authoring surface but the CLI still produces a misleading JSON-parse
error on `ail check foo.ail`. That's the next iter.
66 lines
2.1 KiB
Plaintext
66 lines
2.1 KiB
Plaintext
; Bench fixture: Collatz step-counter, pure-compute integer math.
|
|
;
|
|
; For each starting value n in [1..N], iteratively count the number of
|
|
; Collatz steps to reach 1. Sum all step counts.
|
|
;
|
|
; Distinct from bench_compute_intsum:
|
|
; - Branchy: each step does an `n % 2 == 0` check and either halves n
|
|
; or computes 3n+1. Tests branch-prediction friendliness of the
|
|
; codegen.
|
|
; - Two nested tail-recursions: outer (sum over starting values) and
|
|
; inner (count steps for one value). Both must lower to musttail
|
|
; loops or the bench segfaults at scale.
|
|
; - No heap, no closure, no pattern match — pure integer + branch.
|
|
;
|
|
; Sizes (small because Collatz step counts grow logarithmically; the
|
|
; cost is dominated by the per-step overhead, ~30ns each):
|
|
; N = 10_000 sum_steps = 849666
|
|
; N = 100_000 sum_steps = 10753840
|
|
; N = 500_000 sum_steps = 62134795
|
|
;
|
|
; Step counts cross-validated against a Python reference; deterministic
|
|
; across allocators.
|
|
|
|
(module bench_compute_collatz
|
|
|
|
(fn collatz_steps
|
|
(doc "Tail-recursive: count Collatz steps from n to 1, accumulating in acc.")
|
|
(type
|
|
(fn-type
|
|
(params (con Int) (con Int))
|
|
(ret (con Int))))
|
|
(params n acc)
|
|
(body
|
|
(if (app == n 1)
|
|
acc
|
|
(if (app == (app % n 2) 0)
|
|
(tail-app collatz_steps (app / n 2) (app + acc 1))
|
|
(tail-app collatz_steps (app + (app * n 3) 1) (app + acc 1))))))
|
|
|
|
(fn sum_steps_loop
|
|
(doc "Tail-recursive: sum collatz_steps(i) for i in [n, n-1, ..., 1].")
|
|
(type
|
|
(fn-type
|
|
(params (con Int) (con Int))
|
|
(ret (con Int))))
|
|
(params i total)
|
|
(body
|
|
(if (app == i 0)
|
|
total
|
|
(tail-app sum_steps_loop
|
|
(app - i 1)
|
|
(app + total (app collatz_steps i 0))))))
|
|
|
|
(fn run_one
|
|
(type (fn-type (params (con Int)) (ret (con Unit)) (effects IO)))
|
|
(params n)
|
|
(body (do io/print_int (app sum_steps_loop n 0))))
|
|
|
|
(fn main
|
|
(type (fn-type (params) (ret (con Unit)) (effects IO)))
|
|
(params)
|
|
(body
|
|
(seq (app run_one 10000)
|
|
(seq (app run_one 100000)
|
|
(app run_one 500000))))))
|