Word:

applicative order reduction

(programming)applicative order reduction - 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.
Browse
application server
Application Service Element
application service provider
application software
Application Software Installation Server
application testing
Application Visualisation System
application-oriented language
Application-Specific Integrated Circuit
applications language
applications programme
Applications Programming Interface
applications software
Applicative
applicative language
Applicative Language for Digital Signal Processing
-- applicative order reduction --
applicator
Applicatorily
Applicatory
applied
applied anatomy
Applied chemistry
applied math
applied mathematics
Applied mechanics
applied psychology
applied science
applied scientist
Appliedly
Applier
Appliment
Applique
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home