Principles of Programming Languages COMP3610

Learning outcomes

More information may be available for enrolled students on the course website at http://cs.anu.edu.au/courses/comp3610/

Students who succeed in all aspects of this course will be able to:

1. Manipulate and generate lambda-terms, extending a system such as Church numerals; check and assign types to lambda terms.
2. Solve simple recursive equations by determining the limit of the Kleene fixpoint construction.
3. Design and extend operational and denotational definitions for basic programming language constructs.
4. Prove properties of programs by various formal means, including structural and fixpoint induction.
5. Demonstrate correspondences between grammars, languages and automata.
6. Use standard parser and lexer generator tools to construct and implement translations such as a very simple compiler.