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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]