In this post, we will solve Lambda Calculus – Reductions #4 HackerRank Solution. This problem (Lambda Calculus – Reductions #4) is a part of HackerRank Functional Programming series.
Reduce the following expression, using the beta-rule, to no more than one term. If the expression cannot be reduced, enter “CAN’T REDUCE”.
(λg.((λf.((λx.(f (x x)))(λx.(f (x x))))) g))
Your answer should look like:
(This is not the actual answer, just a demonstration of how you should present it.)
Solution – Lambda Calculus – Reductions #4 HackerRank Solution