University
of Washington • CSE583 • D. Notkin © 2000
82
High-level view
lNormal-order defines a kind of lazy
(non-strict)
semantics, where values are only computed
as needed
–This is not unlike shortcircuit boolean computations
lApplicative-order defines a kind of
eager (strict)
semantics, where values for functions are computed regardless of whether they are needed