ALL meanings of partial evaluation
- noun Technical meaning of partial evaluation (compiler, algorithm) (Or "specialisation") An optimisation technique where the compiler evaluates some subexpressions at compile-time. For example, Partial evaluation might change the termination properties of the program if, for example, the expression (x * 0) was reduced to 0 it would terminate even if x (and thus x * 0) did not. It may be necessary to reorder an expression to partially evaluate it, e.g. f x y = (x + y) + 1 g z = f 3 z If we rewrite f: f x y = (x + 1) + y then the expression x+1 becomes a constant for the function g and we can say g z = f 3 z = (3 + 1) + z = 4 + z Partial evaluation of built-in functions applied to constant arguments is known as constant folding. See also full laziness. 1
- noun partial evaluation (computing theory) A technique for program optimization by specialization, so as to produce new programs which run faster than the originals while guaranteed to behave in the same way. 0