Keywords

#fixed-point_combinator

Fixed-point combinator

Higher-order function Y for which Y f = f (Y f)

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.

Mon 2nd

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Fixed-point combinator Fixed-point theorem Fixed point (mathematics) Fixed-point iteration Y combinator Combinatory logic Let expression SKI combinator calculus Least fixed point Kleene's recursion theorem
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.