A program transformation where a recursive call to a function is unfolded to an instance of the function' s body and then later an instance of the function' s body is replaced by a call. E.g. sumdouble l = sum (double l) double l = case l of [] -> [] x:xs -> 2*x + double xs ==> (unfold double) sumdouble l = sum (case l of [] -> [] x:xs -> 2*x : double xs) ==> (distribute over case) sumdouble l = case l of [] -> sum [] x:xs -> sum (2*x : double xs) ==> (unfold sum) sumdouble l = case l of [] -> 0 x:xs -> 2*x + sum (double xs) ==> (fold sumdouble) sumdouble l = case l of [] -> 0 x:xs -> 2*x + sumdouble xs (1994-11-03)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ bo ] [ by ] [ ca ] [ case ] [ ch ] [ cu ] [ do ] [ du ] [ E ] [ ec ] [ ed ] [ er ] [ fi ] [ file ] [ fo ] [ for ] [ function ] [ gr ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ instance ] [ io ] [ is ] [ la ] [ ld ] [ Lex ] [ ma ] [ md ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ nf ] [ ns ] [ ph ] [ pl ] [ pr ] [ program ] [ program transformation ] [ query ] [ rc ] [ re ] [ recursive ] [ ro ] [ se ] [ si ] [ st ] [ su ] [ sum ] [ th ] [ to ] [ tr ] [ transformation ] [ um ] [ unfold ] [ ve ]