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.

In addition suitable contents:
[ = ] [ ad ] [ al ] [ am ] [ an ] [ app ] [ applicative order reduction ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ au ] [ b ] [ be ] [ by ] [ ca ] [ cat ] [ ch ] [ ci ] [ co ] [ com ] [ cy ] [ de ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ es ] [ et ] [ evaluation ] [ evaluation strategy ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ function ] [ gh ] [ gu ] [ gy ] [ h ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ Lex ] [ li ] [ ls ] [ lu ] [ ly ] [ ma ] [ method ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ om ] [ pa ] [ ph ] [ pl ] [ pr ] [ query ] [ rc ] [ re ] [ redex ] [ reduction ] [ S ] [ se ] [ si ] [ so ] [ st ] [ T ] [ th ] [ tm ] [ to ] [ tr ] [ ua ] [ um ] [ us ] [ va ] [ ve ]