Language Semantics and Implementation

Here are links to the course home page and the formal TQA description.

Description

The aim of the course is to present a unified view of programming language semantics and implementation, based upon the linked notions of structured operational semantics and abstract machines. Different styles of languages (such as declarative and object oriented) will be treated. Lecture notes will be available on the module web page.

Syllabus

Dynamic Language Semantics

Semantic rules as an inference system; treatment of variable assignment, iteration, scope, function declaration and application, parameter passing, records, recursion.

Static Semantics

Semantic rules for type checking as an inference system.

Abstract Machines

The SMC machine for an imperative while language

Assessed Coursework

The coursework consists mostly of paper and pencil exercises, but there may be programming exercises.

References:

* M. Hennessy, The Semantics of Programming Languages, Wiley, 1990.

* G. D. Plotkin, (Parts of) A Structural Approach to Operational Semantics, Aarhus Research Report.

*** A. Pitts, Semantics of Programming Languages, Lecture Notes, University of Cambridge,
http://www.cl.cam.ac.uk/Teaching/2000/Semantics/