A: That's easy: let `T` be an arbitrary term in the lambda calculus. If
`T` has a fixed point, then there exists some `X` such that `X <~~>
A: That's easy: let `T` be an arbitrary term in the lambda calculus. If
`T` has a fixed point, then there exists some `X` such that `X <~~>
* I hear that `Y` delivers the *least* fixed point. Least
according to what ordering? How do you know it's least?
Is leastness important?
* I hear that `Y` delivers the *least* fixed point. Least
according to what ordering? How do you know it's least?
Is leastness important?