Fixed point (mathematics)
Fixed-point combinator

In combinatory logic for computer science, a fixed-point combinator is a higher-order function f i x {\displaystyle {\mathsf {fix}}} that returns a fixed point of its argument function, if one exists. Formally, if the function f has one or more fixed points, then
combination:two_responses