For convenience, many of the most common combinators are available here and given firendlier names

The classic BCKW combinators. A similar idea to SKI, but with different primitives

Function composition is taking two functions, and joining them together to create a new function. For example

Currying breaks up a function into a series of unary functions that apply their arguments to some inner n-ary function. This is a convenient way to achieve a general and flexble partial application on any curried function

Fixed point combinators generalize the idea of a recursive function. This can be used to great effect, simplifying many definitions

Provide curried functions, that can also be partially bound without dot notation. Partially applying a function will always return a fully-curried function

The classic SKI system combinators. s and k alone can be used to express any algorithm, though generally not efficiently