 S combinator

In lambda calculus, $S\equiv \lambda xyz.xz(yz)$ distributes its third argument to its first two arguments. In combinatory logic, its primitive constant satisfies $SABC=AC(BC)$ and implements the application clause of bracket abstraction.