Advanced
Compilers & Programming Language Theory
Q92 / 100
What is the Y combinator in lambda calculus?
Correct! Well done.
Incorrect.
The correct answer is B) A fixed-point combinator enabling recursion in lambda calculus without explicit self-reference: Y = λf.(λx.f(x x))(λx.f(x x))
B
Correct Answer
A fixed-point combinator enabling recursion in lambda calculus without explicit self-reference: Y = λf.(λx.f(x x))(λx.f(x x))
Explanation
Y combinator: Y f = f (Y f). Enables defining recursive functions without named recursion. In call-by-value languages, use Z combinator (strict version). Y demonstrates lambda calculus has fixed points, enabling computation of all recursive functions.
Progress
92/100