constant folding


A compiler optimisation technique where constant subexpressions are evaluated at compile time. This is usually only applied to built-in numerical and boolean operators whereas partial evaluation is more general in that expressions involving user-defined functions may also be evaluated at compile time.

Last updated: 1997-02-20

Nearby terms:

constant applicative formconstant foldingConstantine/Yourdon

Try this search on Wikipedia, Wiktionary, Google, OneLook.