Lecture
This lecture explores the Curry-Howard Correspondence, showing the relationship between constructive logics and programming languages. It covers how proofs in logic correspond to evidence in programming, and how types in programming correspond to propositions in logic. The lecture delves into the concept of proof simplification, also known as 'cut elimination', and mentions tools like Coq, Lean, Agda, Idris, Scala, and Haskell.