APPLICATIVE ORDER REDUCTION
\ˈaplɪkətˌɪv ˈɔːdə ɹɪdˈʌkʃən], \ˈaplɪkətˌɪv ˈɔːdə ɹɪdˈʌkʃən], \ˈa_p_l_ɪ_k_ə_t_ˌɪ_v ˈɔː_d_ə ɹ_ɪ_d_ˈʌ_k_ʃ_ə_n]\
Definitions of APPLICATIVE ORDER REDUCTION
Sort: Oldest first
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.
By Denis Howe
Word of the day
- sa-d[=e]'na, n. a clupeoid fish resembling sardine. [Sp. sardina.]