Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A fixed point combinator 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 is a first-order value, a fixed point of a higher-order function f is another function p such that f(p) = p
"Sinopsis" puede pertenecer a otra edición de este libro.
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A fixed point combinator 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 is a first-order value, a fixed point of a higher-order function f is another function p such that f(p) = p
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A fixed point combinator 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 is a first-order value, a fixed point of a higher-order function f is another function p such that f(p) = p 68 pp. Englisch. Nº de ref. del artículo: 9786130706210
Cantidad disponible: 2 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Fixed Point Combinator | Fixed point combinator, Higher-order function, Fixed point (mathematics), Lambda calculus, Haskell Curry, Simply typed lambda calculus, First-class function, Recursion, Name binding, Identifier | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130706210 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 113239206
Cantidad disponible: 5 disponibles