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
other 1
citation-polarity summary
fields
cs.PL 2years
2026 2verdicts
UNVERDICTED 2roles
other 1polarities
unclear 1representative citing papers
Clef compiler applies fixed-point scaffolding and a functor from compilation poset to target category to preserve dimensional, grade, escape and numeric structure through MLIR lowering while adding compact-closed negative and fractional types.
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.
-
Fixed-Point Scaffolding in the Clef Programming Language
Clef compiler applies fixed-point scaffolding and a functor from compilation poset to target category to preserve dimensional, grade, escape and numeric structure through MLIR lowering while adding compact-closed negative and fractional types.