The lambda calculus and basic type checking

In this monologue podcast, David Broman provides a gentle introduction to lambda calculus and type checking, explaining its history, syntax, and semantics. He discusses Alonzo Church's invention of lambda calculus in the 1930s and its relation to computability and modern programming languages. David covers abstract syntax, alpha and beta conversions, and conventions for writing lambda expressions, including currying. He also touches on dynamic semantics, evaluation rules, type systems, and type checking, illustrating concepts with examples in OCaml, and explains the concept of well-typedness and avoiding getting "stuck" in normal forms.