normal order reduction

Computing Dictionary

normal order reduction definition


Under this evaluation strategy an expression is evaluated by reducing the leftmost outermost redex first. This method will terminate for any expression for which termination is possible, whereas applicative order reduction may not. This method is equivalent to passing arguments unevaluated because arguments are initially to the right of functions applied to them. See also computational adequacy theorem.

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: normal opsonin
Next Definition: normal orthogonal
More from Thesaurus.com
Synonyms and Antonyms for normal order reduction
More from Reference.com
Search for articles containing normal order reduction
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature