fixed point combinator

A fixed point combinator (or fixed-point operator) is a higher-order function which computes a fixed point of other functions. This operation is relevant in programming language theory because it allows the implementation of recursion in the form of a rewrite rule, without explicit support from the language's runtime engine.
See more at Wikipedia.org...

<mathematics> (Y) The name used in combinatory logic for the fixed point function, also written as "fix".
(1994-10-20)