Formal Semantics of Programming Languages Fall 2018, Nanjing University

Lecture Notes

• [12/21]: Simply-typed lambda calculus (notes).
• [12/14]: Concurrency Semantics: notes. Reading: Chapter 8 of Reynolds.
• [12/07]: Separation Logic - III (notes).
• [11/30]: Separation Logic - II (notes).
• [11/23]: Separation Logic - I (notes). Reading: notes by Reynolds, also see his mini-course web page.
• [11/16]: Hoare Logic (continued).
• [11/09]: Hoare Logic (notes). Reading: Chapter 3 of Reynolds, and the following chapters from software foundations, Volume 2: Hoare, Hoare2, and HoareAsLogic.
• [10/26]: Denotational Semantics (continued).
• [10/19]: Denotational Semantics (notes). Reading: Chapter 2 of Reynolds.
• [10/12]: Operational Semantics (continued).
• [09/30]: Operational Semantics (notes). Reading: Chapter 6 of Reynolds, and the following chapters from software foundations: Imp of Volume 1, ImpCEvalFun of Volume 1, and Smallstep of Volume 2.
• [09/28]: Lambda calculus (notes). Read the first three sections of Peter Selinger's lecture notes. Also see Alligator Eggs for Untyped Lambda Calculus for fun.
• [09/21]: Mathematical foundations (notes). Reading: Appendix of Reynolds.
• [09/14]: Coq tutorial, continued.
• [09/07]: Introduction (notes), and Coq tutorial (Overview, and Coq files used for the demo). Here are instructions on how to install Coq, emacs and proof general on windows.