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.)

ISBN 10: 6130706219 / ISBN 13: 9786130706210

Published by OmniScriptum, 2026

About this Item

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

Bibliographic Details

• Title: 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
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 6130706219
• ISBN 13: 9786130706210
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 5D millimeters 220 millimeters width by 150 millimeters height by 5 millimeters depth
• Weight: 119 grams
• Seller catalogs:
  • Bücher

About this title

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