0%

applicative order reduction

A a

Transcription

    • US Pronunciation
    • US IPA
    • US Pronunciation
    • US IPA

Definition of applicative order reduction words

  • noun Technical meaning of applicative order reduction (programming)   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. 1

Information block about the term

Parts of speech for Applicative order reduction

noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation

See also

Matching words

Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?