Some error occured while loading page for you. Please try again.
Sort 3 Discussions, By:
Please Login in order to post a comment
The term DOES reduce to itself. Please fix the test case. The usage of the notion of "reduce" in the problem statement is left to interpretation , but in formal literature means to produce another term by using a reduction rule (ie. beta-rule). If you check books like Type and Programming Languages of B.Pierce and Programming Languages and Lambda Calculi of Matthias Felleisen you can go deeper in the notion of reduction.
Is this solution here ?
(lx.(x x)) (lx.(x x))
=> (lx.(x x))(ly.(y y)) (since right one is independent)
=> (ly.(y y)) (ly.(y y)) (Infinite loop)
aka the divergent combinator aka omega.
My mistake was thinking that the " "'s were necc when they needed to be stripped.
This term reduces to itself. Hence it does reduce. Please fix it. Thank you.
No more comments