Types for Proofs and Programs TYPES

This course provides a first introduction to the Curry-Howard correspondence between programs and proofs, from a theoretical programmer's perspective: we want to understand the theory behind logic and programming languages, but also to write concrete programs (in OCaml) and proofs (in Agda). After an introduction to functional programming languages, we present propositional logic, λ-calculus, the Curry-Howard correspondence, first-order logic, Agda, dependent types and homotopy type theory.

https://rapidgator.net/file/a654301b74560f7ea9c81b721420e5b8/

http://nitroflare.com/view/F5CD7721A112E87/

https://k2s.cc/file/254c7ef2e2776