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 ]