Syllabus
Home Syllabus Lecture Slides Learning Haskell Problem Set 1 Problem Set 2 Problem Set 3 Problem Set 4 Problem Set 5 Problem Set 6 Problem Set 7 Problem Set 8 Problem Set 9

 

Here is a rough syllabus that will give you an idea of what we will cover.

  1. Introduction and motivation (Reynolds Ch 1).
  2. Denotational semantics of SIL: a Simple Imperative Language (Reynolds Ch 2).
  3. Prototyping denotational semantics in Haskell (supplemental reading).
  4. Axiomatic semantics of SIL (Reynolds Ch 3).
  5. Continuations, and a new denotational semantics for extended SIL (Reynolds Ch 5).
  6. Operational (transition) semantics for SIL (Reynolds Ch 6).
  7. Semantics of non-determinism (Reynolds Ch 7).
  8. The lambda calculus (Reynolds Ch 10).
  9. Semantics of ML-like languages (Reynolds Ch 11).
  10. Semantics of Haskell-like languages (Reynolds Ch 14).
  11. Semantics of ISWIM-like languages (Reynolds Ch 13).
  12. Continuation semantics for other language features (supplemental reading).
  13. Monads and continuations (supplemental reading).
  14. Equational logic (supplemental reading).
  15. Denotational semantics of objects (supplemental reading).
  16. Semantics of types (Reynolds Ch 15 and supplemental reading).