| Webster's Online Dictionary |
| Expressions | Definition | ||
| Evaluation strategy | An evaluation strategy (or reduction strategy) for a programming language is a set of (usually deterministic) rules for defining the evaluation of expressions under β-reduction. Emphasis is typically placed on functions or operators -- an evaluation strategy defines when and in what order the arguments to a function are evaluated, when they are substituted into the function, and what form that substitution takes. A language may combine several evaluation strategies; for example, C++ combines call-by-value with call-by-reference. Most languages that are predominantly strict use some form of non-strict evaluation for boolean expressions and if-statements. (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
| Expressions | Domain | Definition | |
| Evaluation strategy | Computing | Evaluation strategy reduction strategy. Source: The Free On-line Dictionary of Computing.. | |
Source: compiled by the editor from various references; see credits. | Top | ||
