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.
- Prepare
- Functional Programming
- Introduction
- Lambda Calculus - Reductions #1
Lambda Calculus - Reductions #1
Lambda Calculus - Reductions #1
Reduce the following expression to no more than one term. If the expression cannot be reduced, enter "CAN'T REDUCE".
((λx.(x y))(λz.z))
Your answer should look like:
u
(This is not the actual answer, just a demonstration of how you should present it.)