# Lambda Calculus - Reductions #3

# Lambda Calculus - Reductions #3

raimil_cruz + 0 comments 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.

ghutirea + 1 comment When I enter the answer on the third line, the solution the text box by default contains 3 lines, the answer is considered incorrect. I have multiple submissions with the same answer entered in multiple ways. I think the question needs to be more specific how to enter the problem. MAKE SURE YOUR ANSWER IS THE FIRST AND THE ONLY LINE and please don't pull your hair over this because I did.

pedrosqueiroga + 0 comments hehehe me too in an earlier example

angelicdemon + 2 comments 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)

rigsby + 0 comments aka the divergent combinator aka omega.

My mistake was thinking that the " "'s were necc when they needed to be stripped.

quannguyenhong_1 + 0 comments Lambda definition of recursion

andrew_eisenberg + 0 comments I wrote "can't reduce" in lower case and it was deemed an incorrect response. The instructions should have mentioned that the answer is case sensitive.

Kaan_Aydinay + 0 comments **CAN'T REDUCE**

No more comments

Sort 6 Discussions, By:

Please Login in order to post a comment