Principles of Programming Languages: 2018-2019
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.
- Defunctionalization and closures
- State passing style
- Changing the interpreter to support assignable variables, with references as expressible values (like ML).
- Monads and interpreters in monadic form.
- A language with exceptions.
- Call by value and call by name.
- Continuations and continuation passing style
- Abstract machines.
- Inductive definitions
- Simple types, and proofs by induction
- Basics of using chain complete partial orders to interpret programs with recursion
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.
Full notes for the course will be provided on the course materials page.
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.