[1] : The Free On-line Dictionary of Computing (27 SEP 03)

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
     
     
see also:
graph reduction fully lazy lambda lifting let floating 

Full >> F Words
Full, definition of term: Full
full_pag1.html

Full Stop >> F Words
Full Stop, definition of term: Full Stop
full+stop_pag1.html

Full Professor >> F Words
Full Professor, definition of term: Full Professor
full+professor_pag1.html

Full Moon >> F Words
Full Moon, definition of term: Full Moon
full+moon_pag1.html

Full House >> F Words
Full House, definition of term: Full House
full+house_pag1.html