How is lambda calculus defined?

What are he syntactic rules of lambda calculus

What are free and bound variables?

What are substitutions?

What are the rewriting rules of lambda calculus?



What is normal form?

What are nonterminating reductions?

What is call-by-value reduction/applicative order?

What is call-by-name reduction/ normal order reduction?

What reduction type is applicative order? Normal order?

How are integers represented in lambda calculus?
