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
Like
0 By others
on same topic
0 Discussions
Create my own version
With
A
f
=
λ
x
.
f
(
xx
)
, the
combinator
Y
=
λ
f
.
A
f
A
f
satisfies
Y
f
≡
β
f
(
Y
f
)
. Every finite
reduct
of
Y
is,
up to
alpha equivalence
,
λ
f
.
f
n
(
A
f
A
f
)
: the remaining copy of
A
f
A
f
is its only
beta-redex
.
Ancestors
(9)
Fixed-point combinator
Combinator
Untyped lambda calculus
Lambda calculus
Computability theory
Foundations of mathematics
Area of mathematics
Mathematics
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)
Subscribe (1)
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