See lazy evaluation for a general treatment of this idea.

It was first used for early experimentation with lazy evaluation.

This is a small, but significant difference because the original version benefits significantly by lazy evaluation.

However, lazy evaluation can be achieved through the use of closures.

Lazy evaluation can lead to reduction in memory footprint, since values are created when needed.

There are also specialized collections like that provide built-in support for lazy evaluation.

It then becomes possible to switch to lazy evaluation.

This technique complements lazy evaluation, but can be used only when the tests are not dependent on one another.

This remains true even if the language performs out-of-order or lazy evaluation of functions.

Their implementation was strictly purely functional in the sense that it did not use lazy evaluation.

Research in Miranda, a functional language with lazy evaluation, began to take hold in this decade.

The Haskell language is a functional language that also provides lazy evaluation.

Even if the result is finite, this example depends on lazy evaluation due to the use of self-referential data structures.

You can easily accelerate this function via memoization yet lazy evaluation still wins.

The language is a language with lazy evaluation semantics, similar to Haskell.

The greater flexibility obtained through the dynamic power of lazy evaluation using data-base technology is not the only advantage in this area.

XFS makes use of lazy evaluation techniques for file allocation.

For better performance, patch execution follows a lazy evaluation approach, meaning that patches are only executed when their output is needed.

This form of non-strict evaluation is also known as lazy evaluation and used in functional programming.

Introduced in Python 2.4, generator expressions are the lazy evaluation equivalent of list comprehensions.

R (promises for lazy evaluation - still single threaded)

Therefore, the notions of purely eager or purely lazy evaluation may not be applicable in practice.

NET Framework it is possible to do lazy evaluation using the class .

May be combined with lazy evaluation.

Groovy also supports lazy evaluation, reduce/fold, infinite structures and immutability, among others.