First offered in 2014. (Offered even years only.) Semantics of functional, logic, imperative and concurrent programming languages. Reduction rules as a basis for semantics. Grammars as rewriting rules for syntax. Reduction rules for lambda calculus and logic programming; pattern matching and unification. Type theory. Operational semantics of imperative and concurrent programming languages. Specification constructs such as non-determinism. Fixed points for defining iteration and recursion. Algebraic laws of programming constructs. -- Course Website
Instructor: TBA
