developer tools
The Optimizer Got a Compile-Time Bound
A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.
Summary
A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.
The proof-of-concept treats compiler performance and unpredictable search time as properties worth verifying alongside semantics. It applies a cache-cost model to inline expansion rather than claiming a verified optimizer for every pass.
Why it matters
A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.
Limits and context
No additional limitation was separately recorded.
Key claims
A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.
Evidence: source-2026-08-23-020
Sources
- arXiv preprint 2608.20137arXiv · primary research
Corrections
No corrections have been recorded for this story.