Google
×

Fixed-point 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. Formally, if is a fixed-point combinator and the function has one or more fixed... Wikipedia