Boolean logic in lambda calculus

Alonzo Church defined the boolean values true and false in lambda calculus as:

Given a predicate (a function that returns a boolean value) p, the statement that would usually be written if p then E1 else E2 becomes simply pE1E2.

The various boolean functions are also simple:

Where now?

Found this useful? Share it:

Also in Lambda calculus: