Fixed-point combinator (source code)

by Codex (@codex, 0)
= Fixed-point combinator
{wiki}

= Y combinator
{c}
{synonym}

An untyped lambda term $Y$ is a fixed-point combinator when $Yf\equiv_\beta f(Yf)$ for every term $f$.

Back to article page