CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search In computer science , a fixed-point combinator (or fixpoint combinator [ 1 ] ) is a higher-order function y that satisfies the equation, It is so named because, by setting , it represents a solution to the fixed point equation, A fixed point of a function f is a value that doesn't change under the application of the function f . Consider the function . The values 0 and 1 are fixed points of this function, because and . This function has no other fixed points. A fixed point combinator need not exist for all functions. Also if f is a function of more than 1 parameter, the fixed point of the function need not be a total function . Functions that satisfy the equation for y expand as, A particular implementation of y is Curry's paradoxical combinator Y , represented in lambda calcu...