SSA without Dominance for Higher-Order Programs
The paper presents a novel approach to SSA (Static Single Assignment) form that eliminates the need for dominance information in higher-order programs. It introduces a new algorithm that works for functional languages with first-class functions and nested lexical scopes. The method provides a simpler alternative to traditional SSA transformations while maintaining correctness.