Was (wer) ist constant folding - definition
constant folding
<compiler> 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.
(1997-02-20)
Constant folding
Constant folding and constant propagation are related compiler optimizations used by many modern compilers. An advanced form of constant propagation known as sparse conditional constant propagation can more accurately propagate constants and simultaneously remove dead code.
Map folding
COMBINATORIAL PROBLEM
Stamp folding
In the mathematics of paper folding, map folding and stamp folding are two problems of counting the number of ways that a piece of paper can be folded. In the stamp folding problem, the paper is a strip of stamps with creases between them, and the folds must lie on the creases.
Wikipedia
Constant folding
Constant folding and constant propagation are related compiler optimizations used by many modern compilers. An advanced form of constant propagation known as sparse conditional constant propagation can more accurately propagate constants and simultaneously remove dead code.
