Using the definitions of boolean constants and operators presented in class, show that the following evaluates to true. Show all your steps for a perfect mark. Always evaluate the "outer" applications first (i.e., use lazy evaluation), but continue to evaluate further until you obtain true.

or true (not true)

Given the following definitions: true = x.y.(x) false = x.y.(y) not = v.w.x.(v x w) or = v.w.(v v w) and = v.w.(v w v) The functions for and and or are expressed as prefix functions, rather than infix.

It is lambda calculus.