A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation
We define a small-step semantics for the untyped λ-calculus, that traces the β-reductions that occur during evaluation. By abstracting the computation traces, we reconstruct -CFA using abstract interpretation, and justify constraint-based -CFA in a semantic way. The abstract interpretation of the trace semantics also paves the way for introducing widening operators in CFA that go beyond existing analyses, that are all based on exploring a finite state space. We define ∇CFA, a widening-baseddoi:10.1145/3453483.3454057 fatcat:hpnb2jttn5anbpg6sd4bhwtxcq