The course introduces basic concepts of programming language theory: operational semantics and type systems. The approach is strictly formal, with definitions and proofs carried out with the Coq proof assistant. The course proceeds from the basics of constructive logic in Coq to the theory and metatheory of simply typed lambda calculus and beyond. A strong background in logic (formal proofs) is required. Knowledge of functional programming, lambda calculus and/or compilers is recommended. Course exam Mon 14.12. at 16-19.