Programming Language Theory Flashcard

How to encode booleans and conditionals using church booleans in lambda calculus?

Books

Concepts

Deckpure-lambda-calculus

Question

How to encode booleans and conditionals using church booleans in lambda calculus?

Answer

Booleans:

\begin{matrix} tru & = λ f . λ s . f \\ fls & = λ f . λ s . s \end{matrix}

Conditionals (call-by-name):

test = λ c . λ t . λ e . c t e