Search results
We did not find results for: y combinator lambda calculus.
Check spelling or type a new query.
Yahoo Web Search
- Fixed-point combinator
Higher-order function y for which y f = f
In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator), is a higher-order function (i.e. a function which takes a function as argument) that returns some fixed point (a value that is mapped to itself) of its argument function, if one exists. Formally, if is a fixed-point combinator and the function has one or more fixed points, then is one of these fixed point... Wikipedia
