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.