It is possible to evaluate function arguments at the time of the call (eager evaluation) or at the time they are used (lazy evaluation). Most programming languages (including ML) use eager evaluation, but we can simulate lazy evaluation in an eager language such as ML by using higher-order functions. Consider a sequence data structure that starts with a value and continues with a function (known as a thunk) to compute the rest of the sequence: