Question: Lambda Calculus Pseudo Code Question Using pseudo code, write an applicative order interpreter that yields an answer in Normal Form (i.e., the expression cannot be
Lambda Calculus Pseudo Code Question
Using pseudo code, write an applicative order interpreter that yields an answer in Normal Form (i.e., the expression cannot be further reduced).
My assignment is to write a Haskell program that will, given some lambda calc equation, return the expression in normal form via applicative order reduction. This assignment is for my programming languages class
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
