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 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

1 Expert Approved Answer
Step: 1 Unlock

Our goal in this chapter is to define the calculus and ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Language Pragmatics Questions!