Question: Question 1. [3 MARKS] We can encode boolean logic in lambda calculus as follows: True = 1x.(Ay.x) False = 1x. (Ay.y) AND= Ap.(Aq.(pq)p) OR =
![Question 1. [3 MARKS] We can encode boolean logic in lambda](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f56f91ad290_91366f56f9149f93.jpg)
Question 1. [3 MARKS] We can encode boolean logic in lambda calculus as follows: True = 1x.(Ay.x) False = 1x. (Ay.y) AND= Ap.(Aq.(pq)p) OR = Ap.(aq.(pp)9) Reduce the following lambda-expression to its b-normal form or show it to be diver- gent. Show your work in a similar way to the lecture slides. (AND True) False
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
