Topic
one of the fixed-point combinators in untyped lambda calculus
Free account · your comment posts right after signup
Not who you're looking for? Others named Y combinator: American startup accelerator
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.
Read the full article →