20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

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 -

English
2026-03-16
€133.57 €166.96

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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

You May Also Like

Description

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

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786130706210
Write Your Own Review
You're reviewing: 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
Your Rating:

Goodreads Reviews

€133.57 €166.96