Expand description
Binding-Time Analysis (BTA)
Classifies every variable and expression as Static (S) — value known at compile time — or Dynamic (D) — value depends on runtime input. This classification drives function specialization in the partial evaluator.
BTA is polyvariant: the same function analyzed at different call sites with different argument divisions produces different results.