binding-time analysis


Also found in: Acronyms.

binding-time analysis

(compiler)
An analysis to identify sub-expressions which can be evaluated at compile-time or where versions of a function can be generated and called which are specialised to certain values of one or more arguments.

See partial evaluation.
References in periodicals archive ?
With the append example, the binding-time analysis must insert a memoization point at the recursive call if 11 is dynamic, so as to prevent infinite unfolding.
Every program transformation which enables the binding-time analysis to mark more expressions as static is a binding-time improvement.
To achieve context propagation, the binding-time analysis must not insert a memoization point at the dynamic conditional s = d.
Minor modifications to the inference rules suffice to obtain a binding-time analysis.
The set of binding-time properties arising from our axiomatization extends earlier domains used for binding-time analysis based on projections and partial equivalence relations [Hunt and Sands 1991; Jones et al.