In eager evaluation an expression is evaluated as soon as it gets bound to a variable. This is generally more efficient as a low-level strategy in simple programming languages, as it removes the need to build and manage intermediate data structures representing unevaluated expressions.
However, in more sophisticated programming languages, the low-level optimisation of forced eager evaluation is found to be disadvantageous over lazy evaluation. This is because it prevents the higher-level optimisations and greater expressiveness that can be obtained under the latter method, which generally allows the implementation of both lazy and eager semantics.
Besides performance increases, the most important benefit of lazy evaluation is that it allows one to construct an infinite data structure.
Minimal evaluation (also known as short circuit evaluation) is an evaluation strategy in which an expression is only evaluated until the point where its final value is known.
When using delayed evaluation, an expression is not evaluated as soon as it gets bound to a variable, but when the evaluator is forced to produce the expression's value.
In eagerevaluation an expression is evaluated as soon as it gets bound to a variable.
However, in more sophisticated programming languages, the low-level optimisation of forced eagerevaluation is found to be disadvantageous over lazy evaluation.
Feeds |
Contact