Principles of Programming Languages: 2017-2018
This course use interpreters written in Haskell as a vehicle for exploring various kinds of programming languages.
- Translation between recursive and iterative algorithms in a simple functional language.
- Semantics of a language with call-by-name and assignable variables.
After taking this course, students will be able to:
- define the semantics of a programming language using a definitional interpreter.
- investigate semantic issues in programming languages by studying implementations in an interpreter
- solve problems using a range of programming paradigms and assess the effectiveness of each paradigm for a particular problem.
- Introducing Fun, with familiar examples rewritten in the language.
- The concrete and abstract syntax of Fun.
- A definitional interpreter for Fun. Examples of evaluation.
- Changing the interpreter to support assignable variables, with references as expressible values (like ML).
- Changing the interpreter to support output; extracting common features of memory and output.
- Interpreters in monadic form.
- Call by name and call by value.
- Nondeterministic programs for bactracking search.
- Abstract types.
- Simple types.
- First theorems relating types, the abstract machine and the definitional interpreter.
SyllabusAbstract and concrete syntax. Definitional interpreters in direct and monadic form. Functional and imperative programming. Simple types and basic denotational semantics. Call by value and call by name. Continuations and abstract machines.
The course explores many of the same themes that are covered in
- Friedman, Wand and Haynes, Essentials of Programming Languages, 2nd or 3rd ed., MIT Press.
However, that book contains interpreters written in Scheme, and we will use Haskell. Full notes for the course (in the form of a draft book) will be handed out in lectures and put on the web.