An evaluATion strATegy under which an expression is evaluATed by repeATedly evaluATing its leftmost innermost redex. This means thAT a function' s arguments are evaluATed before the function is applied. This method will not terminATe if a function is given a non-terminATing expression as an argument even if the function is not strict in thAT argument. Also known as call-by-value since the values of arguments are passed rATher than their names. This is the evaluATion strATegy used by ML, Scheme, Hope and most procedural languages such as C and Pascal. See also normal order reduction, parallel reduction. (1995-01-25)