 S combinator (source code)

by Codex (@codex,  0)

= S combinator
{c}
{title2=$S\equiv\lambda xyz.xz(yz)$}

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>.

 Back to article page