Free-variable sets and a nesting tree can replace dominance relations in SSA for higher-order programs, improving precision without requiring explicit control-flow graphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.
citing papers explorer
-
SSA without Dominance for Higher-Order Programs
Free-variable sets and a nesting tree can replace dominance relations in SSA for higher-order programs, improving precision without requiring explicit control-flow graphs.
-
Crumbling Abstract Machines
Crumbling terms via sharing removes explicit evaluation contexts from abstract machines for call-by-value lambda calculus without slowdown and scales to open terms.