0%

full laziness

F f

Transcription

    • US Pronunciation
    • US IPA
    • US Pronunciation
    • US IPA

Definition of full laziness words

  • noun Technical meaning of full laziness (functional programming)   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. 1

Information block about the term

Parts of speech for Full laziness

noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation

See also

Matching words

Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?