applicative order reduction

(programming)An evaluation strategy under which anexpression is evaluated by repeatedly evaluating its leftmostinnermost redex. This means that a function's arguments areevaluated before the function is applied. This method willnot terminate if a function is given a non-terminatingexpression as an argument even if the function is not strictin that argument. Also known as call-by-value since thevalues of arguments are passed rather than their names. Thisis the evaluation strategy used by ML, Scheme, Hope andmost procedural languages such as C and Pascal.

See also normal order reduction, parallel reduction.

单词	applicative order reduction
释义	applicative order reduction applicative order reduction (programming)An evaluation strategy under which anexpression is evaluated by repeatedly evaluating its leftmostinnermost redex. This means that a function's arguments areevaluated before the function is applied. This method willnot terminate if a function is given a non-terminatingexpression as an argument even if the function is not strictin that argument. Also known as call-by-value since thevalues of arguments are passed rather than their names. Thisis the evaluation strategy used by ML, Scheme, Hope andmost procedural languages such as C and Pascal. See also normal order reduction, parallel reduction. AcronymsSeeAOR
随便看	tekoa tekoa (disambiguation) tekoah tekoah tekoa tekor tek pad tekrit tekrur teks tekstilnaia promyshlennost tekstilshchik tektat tektite tektites tektitic tektology tektronix window manager tekturna tek tyrosine kinase, endothelial tekua tekumel tekun tekwm .tel tel