Files
AILang/examples/bench_hof_pipeline.ail
T
Brummel 6fdb45d2f2 iter rpe.1: retire per-type print effect-ops
Single iter shipping the post-milestone-24 follow-up named in
docs/specs/2026-05-14-retire-per-type-print-effects.md. After this
iter the only surviving direct-output effect-op is `io/print_str`;
all per-type print primitives are replaced by the polymorphic
`print` helper (prelude, iter 24.3).

Components:
- 92 examples/*.ail fixtures migrated (do io/print_<T> x) →
  (app print x); 6 .prose.txt snapshots regenerated via `ail prose`.
- Four-site lockstep compiler deletion: crates/ailang-check/src/builtins.rs
  (3 effect_ops.insert blocks + 3 list() rows + the
  install_io_print_float_signature test + module + EffectOpSig
  doc-comments); crates/ailang-codegen/src/lib.rs lower_app
  (3 arms + lowers_io_print_float test); crates/ailang-codegen/src/synth.rs
  builtin_effect_op_ret match-arm pattern. Dead `intern_string`
  helper removed as a follow-up.
- Five incidental test-body migrations (ailang-check x2, ailang-core
  spec_drift + design_schema_drift, ailang-surface/src/lex.rs,
  ailang-prose/src/lib.rs round-trip test).
- Cat B test-harness patch: six IR-shape tests in
  crates/ail/tests/e2e.rs gained a monomorphise_workspace call
  before lower_workspace_with_alloc so they follow the same
  pipeline as `ail build` (the home-rolled desugar+lift loop
  stayed because mono's precondition is "already lifted"; mono
  inserts after lift).
- Six doc-comment touch-ups (lex.rs module doc, parse.rs
  diagnostic example, ail/src/main.rs x2, runtime/str.c %g anchor,
  crates/ailang-core/specs/form_a.md surface-spec example).
- DESIGN.md seven-site sweep (Decision 11 example, Polymorphic
  print past-tense, Heap-Str output sentence, effect-op
  invocation comment, Float NaN paragraph re-anchored on
  float_to_str, two "What is supported" lists).
- Three E2E test-comment polish + four IR-snapshot refresh + one
  canonical-hash pin update (plan-unanticipated downstream
  consequences of the corpus migration).
- bench/{check,compile_check,cross_lang}.py: all exit 0; no
  ratification needed.
- Roadmap entry struck through; per-iter journal at
  docs/journals/2026-05-14-iter-rpe.1.md.

Tests 564/0/3. cargo clippy and cargo doc: zero warnings.

Two upstream codegen bugs surfaced during the first BLOCKED
attempt and were fixed in separate iters before this retry:
- 1fb225e bugfix: mono cursor misalignment at poly-free-fn Var
  with class-constrained Forall.
- feb9413 bugfix: print leak — propagate ret_mode through rigid
  substitution + prelude Show.show ret_mode.

Known debt (carried forward for next /audit):
- Emitter.strings field is functionally dead post-iter (orphan
  after intern_string removal); cycles over empty map harmlessly.
2026-05-14 02:12:34 +02:00

88 lines
2.9 KiB
Plaintext

; Bench fixture: HOF + polymorphic ADT pipeline.
;
; Builds a polymorphic List<Int> of length n, then folds it with a
; higher-order function `inc` to compute the sum of incremented
; elements. Distinct from bench_list_sum:
; 1. Uses `(data List (vars a) ...)` — polymorphic ADT, exercises
; the 13b/14a polymorphism-at-runtime path. The Cons cell
; layout is the same width as bench_list_sum's IntList ICons,
; but the type-arg substitution is the additional code path.
; 2. The traversal is via `fold_with_fn` — an HOF taking
; `(fn-type (params a) (ret (con Int)))` as its first param.
; Each step calls `(app f h)` — an indirect call through the
; fn-arg. This is the only fixture that exercises tight-loop
; indirect dispatch.
;
; Build phase is alloc-heavy (n Cons cells); fold phase is
; dispatch-heavy (n indirect calls). Per-iteration cost should be
; visibly higher than bench_list_sum's direct sum.
;
; Result for size n (using inc(x) = x+1):
; sum (inc 0) + (inc 1) + ... + (inc (n-1)) = sum 1..n = n*(n+1)/2
;
; Sizes:
; 100_000 -> 5_000_050_000
; 1_000_000 -> 500_000_500_000
; 3_000_000 -> 4_500_001_500_000
(module bench_hof_pipeline
(data List (vars a)
(doc "Polymorphic singly-linked list. Same shape as list_map_poly's List, replicated here so the bench fixture is self-contained.")
(ctor Nil)
(ctor Cons a (con List a)))
(fn build_n
(doc "Build [0, 1, ..., n-1] :: List Int. Tail-recursive accumulator form.")
(type
(fn-type
(params (con Int) (con List (con Int)))
(ret (con List (con Int)))))
(params n acc)
(body
(if (app == n 0)
acc
(tail-app build_n
(app - n 1)
(term-ctor List Cons (app - n 1) acc)))))
(fn inc
(doc "Add 1 to an Int. Used as the HOF argument to fold_with_fn.")
(type (fn-type (params (con Int)) (ret (con Int))))
(params x)
(body (app + x 1)))
(fn fold_with_fn
(doc "Polymorphic foldl-with-mapping. Apply f:(a)->Int to every element of xs, sum into acc. Tail-recursive on (xs, acc); the f arg is forwarded unchanged.")
(type
(forall (vars a)
(fn-type
(params (fn-type (params a) (ret (con Int)))
(con List a)
(con Int))
(ret (con Int)))))
(params f xs acc)
(body
(match xs
(case (pat-ctor Nil) acc)
(case (pat-ctor Cons h t)
(tail-app fold_with_fn f t (app + acc (app f h)))))))
(fn run_one
(doc "Build [0..n-1], fold with inc, print sum of (inc x).")
(type (fn-type (params (con Int)) (ret (con Unit)) (effects IO)))
(params n)
(body
(app print
(app fold_with_fn inc
(app build_n n (term-ctor List Nil))
0))))
(fn main
(type (fn-type (params) (ret (con Unit)) (effects IO)))
(params)
(body
(seq (app run_one 100000)
(seq (app run_one 1000000)
(app run_one 3000000))))))