A program transformation where several results are returned from a single traversal of a data structure. E.g. mean l = sum l / length l ==> mean l = s/n where (s,n) = sumLen l sumLen [] = (0,0) sumLen (x:xs) = (s+x, n+1) where (s,n) = sumLen xs In procedural languages this technique is known as horizontal loop combination because it uses one loop to calculate several results. Another form of tupling transformation is used to avoid repeated evaluation where a function generates several identical calls to itself. By analysing the pattern of recursion (see descent function) it is possible to arrange for these identical calls to share results. E.g. fib 0 = 1 fib 1 = 1 fib n = fib (n-1) + fib (n-2) ==> fib n = v where (_,v) = fibt n fibt 0 = (1,1) fibt n = (u+v,u) where (u,v) = fibt (n-1) (1995-01-12)

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ av ] [ B ] [ b ] [ be ] [ bi ] [ bt ] [ ca ] [ ch ] [ co ] [ com ] [ combination ] [ cu ] [ data ] [ data structure ] [ de ] [ descent function ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ evaluation ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ function ] [ ge ] [ gen ] [ generate ] [ gl ] [ gr ] [ gt ] [ gu ] [ h ] [ hn ] [ horizontal loop combination ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ iq ] [ is ] [ it ] [ kn ] [ la ] [ language ] [ lc ] [ Lex ] [ li ] [ loop ] [ loop combination ] [ ls ] [ lt ] [ lu ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ pl ] [ pling ] [ pr ] [ program ] [ program transformation ] [ query ] [ range ] [ rave ] [ rc ] [ re ] [ recursion ] [ repeat ] [ ro ] [ ru ] [ sa ] [ sc ] [ se ] [ sh ] [ shar ] [ si ] [ st ] [ struct ] [ su ] [ sum ] [ th ] [ to ] [ tr ] [ transformation ] [ traversal ] [ tt ] [ ua ] [ um ] [ up ] [ us ] [ va ] [ ve ]