applicative order reduction
 

* 1.applicative order reductionan 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

English Related Words* a price order

* absolute order

* additional order

* adin order to

* adjudication order

* administrative order

* adoption order

* advance order

* advances and prepayments on purchase order

* advertising insertion order

* affiliation order

* affinity order

* affixal order

* air force technical order center

* airborne order