catflap.org Online Dictionary Query |
5 definitions found
From The Free On-line Dictionary of Computing (27 SEP 03) : [ foldoc ]
call-by-name
(CBN) (Normal order reduction, leftmost, outermost reduction).
An argument passing convention (first provided by ALGOL 60?)
where argument expressions are passed unevaluated. This is
usually implemented by passing a pointer to some code which
will return the value of the argument and an environment
giving the values of its free variables. This evaluation
strategy is guaranteed to reach a normal form if one
exists.
When used to implement functional programming languages,
call-by-name is usually combined with graph reduction to
avoid repeated evaluation of the same expression. This is
then known as call-by-need. The opposite of call-by-name is
call-by-value where arguments are evaluated before they are
passed to a function. This is more efficient but is less
likely to terminate in the presence of infinite data
structures and recursive functions. Arguments to macros
are usually passed using call-by-name.
(1994-11-29)
From English Wiktionary: All languages (2023-07-27) : [ dictinfo.com:wikt-en-ALL-2023-07-27 ]
call-by-name
alt.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
n.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
From English Wiktionary: English language only (2023-07-27) : [ dictinfo.com:wikt-en-en-2023-07-27 ]
call-by-name
alt.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
n.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
From English Wiktionary: Western, Greek, and Slavonic languages only (2023-07-27) : [ dictinfo.com:wikt-en-Western_Greek_Slavonic-2023-07-27 ]
call-by-name
alt.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
n.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
From English Wiktionary: Western languages only (2023-07-27) : [ dictinfo.com:wikt-en-Western-2023-07-27 ]
call-by-name
alt.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
n.
(lb en programming) An
https://en.wikipedia.org/wiki/Evaluation%20strategy whereby an argument
to a function is evaluated each time its value is used in the function,
and is not evaluated at all if its value is never used.
Questions or comments about this site? Contact dictionary@catflap.org
Access Stats