Topic

Y combinator.

one of the fixed-point combinators in untyped lambda calculus

The journal

The conversation starts in the journal — be the first to post.

About Y combinator

In combinatory logic for computer science, a fixed-point combinator is a higher-order function that returns some fixed point of its argument function, if one exists.

Everything about Y combinator →

Y combinator — one of the fixed-point combinators in untyped lambda calculus