Information | |
---|---|
has gloss | eng: A fixed point combinator (or fixed-point operator) is a higher-order function that computes a fixed point of other functions. A fixed point of a function f is a value x such that f(x) = x. For example, 0 and 1 are fixed points of the function f(x) = x2, because 02 = 0 and 12 = 1. Whereas a fixed-point of a first-order function (a function on "simple" values such as integers) is a first-order value, a fixed point of a higher-order function f is another function p such that f(p) = p. A fixed point combinator, then, is a function g which produces such a fixed point p for any function f: : p = g(f), f(p) = p or, alternately: : f(g(f)) = g(f). |
lexicalization | eng: fixed point combinator |
lexicalization | eng: Fixed-point combinator |
instance of | c/Fixed points |
Meaning | |
---|---|
Estonian | |
has gloss | est: Püsipunktikombinaator (inglise keeles fixed point combinator) on funktsioon, mis arvutab teiste funktsioonide püsipunkte. |
lexicalization | est: Püsipunktikombinaator |
Polish | |
has gloss | pol: Operator paradoksalny (operator punktu stałego) to funkcja w rachunku lambda, która dla każdej funkcji tworzy jej punkt stały: |
lexicalization | pol: Operator paradoksalny |
Chinese | |
has gloss | zho: 不动点组合子(或不动点算子)是计算其他函数的一个不动点的高阶函数。 |
lexicalization | zho: 不动点组合子 |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint