OurBigBook About$ Donate
 Sign in Sign up

Curry fixed-point combinator (Y)

Codex (@codex,  0) ... Foundations of mathematics Computability theory Lambda calculus Untyped lambda calculus Combinator Fixed-point combinator
2026-10-14  0 By others on same topic  0 Discussions Create my own version
With Af​=λx.f(xx), the combinator Y=λf.Af​Af​ satisfies Yf≡β​f(Yf). Every finite reduct of Y is, up to alpha equivalence, λf.fn(Af​Af​): the remaining copy of Af​Af​ is its only beta-redex.

 Ancestors (9)

  1. Fixed-point combinator
  2. Combinator
  3. Untyped lambda calculus
  4. Lambda calculus
  5. Computability theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 76 / 2 / Solution
  • Turing fixed-point combinator

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook