| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Eager evaluation | Computing | Mode of carrying out a program in a data flow system, in which an instruction is carried out whenever all its input values are present. Source: European Union. (references) | |
| Eager evaluation | Computing | Eager evaluation Any evaluation strategy where evaluation of some or all function arguments is started before their value is required. A typical example is call-by-value, where all arguments are passed evaluated. The opposite of eager evaluation is call-by-need where evaluation of an argument is only started when it is required. The term "speculative evaluation" is very close in meaning to eager evaluation but is applied mostly to parallel architectures whereas eager evaluation is used of both sequential and parallel evaluators. Eager evaluation does not specify exactly when argument evaluation takes place - it might be done fully speculatively (all redexes in the program reduced in parallel) or may be done by the caller just before the function is entered. The term "eager evaluation" was invented by Carl Hewitt and Henry Baker | |
Source: compiled by the editor from various references; see credits. | Top | ||
