The following is how boolean values are typically encoded in the lambda calculus: T = (xy.x)

F = (xy.y) Here is a definition of the boolean function NOT:

(x.x(uv.v)(ab.a)) Here is the same NOT in syntax that you can type into the online interpreter:

(lambda x . (x (lambda u v . v) (lambda a b . a)))

(a)Write the lambda expression for NOT F. (Write the expression that would compute NOT F, not the result of the computation.)

(b): Show step-by-step how the term for NOT F that you gave in (a) reduces. Hint: It should reduce to T! (c): Why does this definition of NOT work?

Only do question B