Definitions from Wikipedia (Fixed-point combinator)

▸ noun:  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.


▸ Words similar to Fixed-point combinator
▸ Usage examples for Fixed-point combinator

▸ Idioms related to Fixed-point combinator
▸ Wikipedia articles (New!)
▸ Words that often appear near Fixed-point combinator
▸ Rhymes of Fixed-point combinator

▸ Invented words related to Fixed-point combinator