Lambda calculus normal form, and the Church-Rosser theorems

We explore the meaning of normal form as it relates to the lambda calculus as well how different reduction orders can result in lazy evaluation. We end with a look at two Church-Rosser theorems and how they are relevant to the lambda calculus.
Contents:
00:07 - Normal form and reduction orders
01:27 - Reduction orders
03:37 - Church-Rosser theorems
This video is a clip from a longer video where we explore the lambda calculus in much more depth. See the whole video, "Lambda Calculus Primer" here: • Lambda (λ) Calculus Pr...
Also see the Introduction to Functional Programming with Haskell course ( • Intro to Functional Pr... ).
Code shown in the course is available on Github here: github.com/LigerLearn/intro-t...

[@Uselesswmv]

thank you