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

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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!