Fixed Point Combinator: Fixed point combinator, Higher-order function, Fixed point (mathematics), Lambda calculus, Haskell Curry, Simply typed lambda ... function, Recursion, Name binding, Identifier - Softcover
Synopsis
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
"synopsis" may belong to another edition of this title.
Reseña del editor
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
"About this title" may belong to another edition of this title.
Search results for Fixed Point Combinator: Fixed point combinator, Higher-order...
Seller Image
Fixed Point Combinator
Published by
Alphascript Publishing, 2010
ISBN 10: 6130706219
ISBN 13: 9786130706210
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786130706210
Seller Image
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
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 113239206