An optimisation where a function of some systematically changing variable is calculated more efficiently by using previous values of the function. In a procedural language this would apply to an expression involving a loop variable and in a declarative language it would apply to the argument of a recursive function. E.g. f x = ... (2**x) ... (f (x+1)) ... ==> f x = f' x (2**x) where f ' x z = ... z ... (f' (x+1) 2*z) ... Here the expensive operation (2**x) has been replaced by the cheaper 2*z in the recursive function f' . This maintains the invariant that z = 2**x for any call to f' . (1995-01-31)

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ arg ] [ argument ] [ as ] [ at ] [ b ] [ be ] [ by ] [ ca ] [ ch ] [ ci ] [ cl ] [ cu ] [ de ] [ dec ] [ declarative language ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ er ] [ era ] [ es ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ function ] [ ge ] [ gi ] [ gu ] [ h ] [ hang ] [ hat ] [ heap ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ invariant ] [ io ] [ is ] [ it ] [ la ] [ language ] [ lc ] [ ld ] [ Lex ] [ loop ] [ lu ] [ lv ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ng ] [ ns ] [ om ] [ op ] [ pe ] [ ph ] [ pl ] [ ply ] [ pr ] [ procedural language ] [ pt ] [ query ] [ rc ] [ re ] [ recursive ] [ ro ] [ sa ] [ se ] [ si ] [ so ] [ st ] [ sy ] [ system ] [ T ] [ th ] [ to ] [ ua ] [ um ] [ us ] [ va ] [ value ] [ var ] [ variable ] [ ve ] [ vi ]