05 - The Untyped Lambda-Calculus

Updated Fri 2024-05-03 | 18 words

Lambda grammer:

t ::==    # terms
	x       # variable
  λx.t    # abstraction
  t t     # application

Church Booleans

tru = λt. λf. t;
fls = λt. λf. f;

test = λl. λm. λn. l m n;

and = λb. λc. b c fls;

Ex 5.2.1: Define logical or and not functions