We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

Loading...

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

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.

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

No more comments

Sort 3 Discussions, By:

Please Login in order to post a comment