Eager Evaluation

Eager evaluation is the evaluation model in most traditional programming languages. 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. Also related * Graph reduction

 

<< PreviousWord BrowserNext >>
catalan's conjecture
proof
beatnik
centrohelid
pharaoh hound
langmuir probe
academy award for documentary feature
academy award for unique and artistic production
location based service
academy award for engineering effects
plasma source
belmont stakes
kentucky oaks
secretariat (racehorse)
lovebird
tarsier
schooner
global crossing
salerno
j. b. s. haldane
modena
standard enthalpy change of combustion
tier 1
list of pharmaceutical companies
tier 1 carrier
partial evaluation
pawnee
evaluation
puberty
scada
john walker (runner)
expression
the sting
v5 interface
230 bc
alice (alice's adventures in wonderland)
catharina of wrttemberg
giustina pecori surez
independence
johnson city
jerome napoleon bonaparte ii
charles joseph bonaparte
leesburg
lowell