| |
| | Fixed point combinator - Definition, explanation |
 | | A fixed point combinator is a function which computes fixed pointss of other functions. |
 | | Y is a function with the property that f(Y(f)) = Y(f) for all functions f. |
 | | The function labels Y, H, FACT, PRED, MULT, ISZERO, 1, 0 (defined in the article for lambda calculus) are meta-labels, to which correspond meta-definitions and meta-equations, and with which a user can perform algebraic meta-substitutions. |
| www.calsky.com /lexikon/en/txt/f/fi/fixed_point_combinator.php (508 words) |
|