Question: Prove that for any lambda expression f , if the normal-order evaluation of Y f terminates, where Y is the fixed-point combinator h:(x:h(x x)) (x:h(x
Prove that for any lambda expression f , if the normal-order evaluation of Y f terminates, where Y is the fixed-point combinator λh:(λx:h(x x)) (λx:h(x x)), then f (Yf ) and Yf will reduce to the same simplest form.
Step by Step Solution
3.42 Rating (158 Votes )
There are 3 Steps involved in it
Our goal in this chapter is to define the calculus and ... View full answer
Get step-by-step solutions from verified subject matter experts
