Question: Write a term in the pure -calculus which can be reduced to normal form, but which also has paths of unbounded length in the reduction
Write a term in the pure -calculus which can be reduced to normal form, but which also has paths of unbounded length in the reduction graph. Show its normal form. Explain why this term cannot be well typed in the simply typed calculus.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
