🌀 compilersearch

optimizing OCaml's pattern-match compiler · metric = decision-tree cost vs baseline (lower is better) connecting…

Best result

—
no successful runs yet
tree size
—
path len
—
timing
—
runs
0
correct
0
score = 0.35·size + 0.45·path + 0.20·timing (ratios vs baseline) · tree metrics are deterministic, timing is best-effort · baseline —

Progress (best speedup over time)

Runs

whennamestatus scoresizepath timingbuild snote

Detail

decision-tree cost
timing
patch
select a run above