математика частичное вычисление
(Or "specialisation") An optimisation technique where the compiler evaluates some subexpressions at compile-time. It is important that the partial evaluation algorithm should terminate. This is not guaranteed in the presence of recursive function definitions. Partial evaluation of built-in functions applied to constant arguments is known as constant folding. See also full laziness.