CombinatorS with coarSer granularity than thoSe propoSed by David Turner. A functional program iS tranSlated to a Set of functionS without free variableS. The memberS of the Set are Selected to be optimal for that program. SupercombinatorS were propoSed by John HugheS at UniverSity of Edinburgh.

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arity ] [ at ] [ av ] [ b ] [ be ] [ bi ] [ by ] [ C ] [ ch ] [ co ] [ com ] [ combinator ] [ D ] [ David Turner ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ er ] [ eS ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ free ] [ free variable ] [ function ] [ functional ] [ functional program ] [ gh ] [ gr ] [ granularity ] [ h ] [ hat ] [ hn ] [ hoSe ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ iS ] [ it ] [ J ] [ la ] [ Lex ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ni ] [ nS ] [ nu ] [ om ] [ op ] [ optimal ] [ pe ] [ ph ] [ pr ] [ program ] [ pt ] [ query ] [ rc ] [ re ] [ ro ] [ S ] [ Se ] [ Set ] [ Si ] [ Sit ] [ Sl ] [ T ] [ th ] [ to ] [ tr ] [ ug ] [ up ] [ va ] [ var ] [ variable ] [ ve ] [ vi ]