FULL LAZINESS

Domain	Definition
Computing	Full laziness A transformation, described by Wadsworth in 1971, which ensures that subexpressions in a function body which do not depend on the function's arguments are only evaluated once. E.g. each time the function f x = x + sqrt 4 is applied, (sqrt 4) will be evaluated. Since (sqrt 4) does not depend on x, we could transform this to: f x = x + sqrt4 sqrt4 = sqrt 4 We have replaced the dynamically created (sqrt 4) with a single shared constant which, in a graph reduction system, will be evaluated the first time it is needed and then updated with its value. See also fully lazy lambda lifting, let floating. (1994-11-09). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Crosswords: FULL LAZINESS

Anagrams: FULL LAZINESS

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-e-f-i-l-l-l-n-s-s-u-z"
	-4 letters: ainsells, fullness, inulases, laziness, sensilla.
	-5 letters: ainsell, failles, falsies, finales, finless, fulness, fusains, illness, infalls, infuses, inulase, lazulis, salines, sallies, sensual, silanes, silenus, sullies, unseals, unsells.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.