- Code COMP3610
- Unit Value 6 units
- Offered by Research School of Computer Science
- ANU College ANU College of Engineering and Computer Science
- Course subject Computer Science
- Areas of interest Computer Science, Software Engineering
- Academic career UGRD
- Dr Clement Baker-Finch
- Mode of delivery In Person
Second Semester 2015
See Future Offerings
The course is built around an investigation of what programming languages are, and the notion of programs as artefacts. Two key aspects of the study of programming languages are their semantics, and their syntax.
We will survey some of the fundamental principles of the semantics and computational behaviour of programs, including the lambda calculus, types and fixed-points. Rigorous proofs of properties of programs, such as are needed for safety-critical software, or for program transformations such as are carried out by optimising compilers, require a formal description of the 'meaning' and behaviour of programs. We will study two of the dominant approaches: denotational semantics and opertional semantics. In each case, standard proof techniques will be developed and applied.
The syntax of programming languages is routinely defined by well-understood means, in terms of formal grammars and their relation to certain classes of automata. We will investigate the algorithms underlying standard automata-bsed compiler generators and make practical use of them to construct simle translators.
Upon successful completion, students will have the knowledge and skills to:
Students who succeed in all aspects of this course will be able to:
- manipulate and generate lambda-terms, extending a system such as Church numerals; check and assign types to lambda terms.
- solve simple recursive equations by determining the limit of the Kleene fixpoint construction.
- design and extend operational and denotational definitions for basic programming language constructs.
- prove properties of programs by various formal means, including structural and fixpoint induction.
- demonstrate correspondences between grammars, languages and automata.
- use standard parser and lexer generator tools to construct and implement translations such as a very simple compiler.
Course offered in Semester 2 in alternate odd-numbered years.
- Assignments (40%)
- Final Exam (60%)
The ANU uses Turnitin to enhance student citation and referencing techniques, and to assess assignment submissions as a component of the University's approach to managing Academic Integrity. While the use of Turnitin is not mandatory, the ANU highly recommends Turnitin is used by both teaching staff and students. For additional information regarding Turnitin please visit the ANU Online website.
Thirty one-hour lectures, three one-hour tutorials and seven two-hour laboratory sessions.
Requisite and Incompatibility
Tuition fees are for the academic year indicated at the top of the page.
If you are a domestic graduate coursework or international student you will be required to pay tuition fees. Tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at Fees.
- Student Contribution Band:
- Unit value:
- 6 units
If you are an undergraduate student and have been offered a Commonwealth supported place, your fees are set by the Australian Government for each course. At ANU 1 EFTSL is 48 units (normally 8 x 6-unit courses). You can find your student contribution amount for each course at Fees. Where there is a unit range displayed for this course, not all unit options below may be available.
Offerings, Dates and Class Summary Links
Class summaries, if available, can be accessed by clicking on the View link for the relevant class number.
|Class number||Class start date||Last day to enrol||Census date||Class end date||Mode Of Delivery||Class Summary|
|3568||20 Jul 2015||07 Aug 2015||31 Aug 2015||30 Oct 2015||In Person||N/A|