Found 1 hit - Term: applicative order reduction, Database: *, Strategy: prefix
- [1] : The Free On-line Dictionary of Computing (27 SEP 03)
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.
1995-01-25
see also:
evaluation strategy redex strict call-by-value ml scheme
hope procedural languages c pascal normal order reduction
parallel reduction
Results 1 - 7 of 7 found about applicative order reduction: Order
>> O Words
Order, definition of term: Order
order_pag1.html Applicative
>> A Words
Applicative, definition of term: Applicative
applicative_pag1.html Money Order
>> M Words
Money Order, definition of term: Money Order
money+order_pag1.html Mail Order
>> M Words
Mail Order, definition of term: Mail Order
mail+order_pag1.html In Order
>> I Words
In Order, definition of term: In Order
in+order_pag1.html Animal Order
>> A Words
Animal Order, definition of term: Animal Order
animal+order_pag1.html In Order To
>> I Words
In Order To, definition of term: In Order To
in+order+to_pag1.html
Last accessed:2008/10/10 23:11:46 [Total processing time: 0 seconds] |