| Syllabus and Study Guide for the final |
|
- Understand the lecture slides and discussions thoroughly.
- Revisit the MPs and HWs and make sure you understand the solutions
thoroughly. Repeat any you are not comfortable with.
- Take the sample exam as a dry-run for the actual exam.
The exam will cover all the lectures in the course. It is a
ccomprehansive exam. Listed here are topics not previously listed
in midterm1.syllabus.html or
midterm2.syllabus.html.
They include writing parsers, Lambda Calculus, Evaluation
strategies (eager and lazy evaluation), Natural Semantics and
Transition Semantics,
Continuation Passing Style, Infinite data and call-by-need
evaluation. The following give
examples of the kinds of
questions you are likely to be asked for each topic:
- Lambda Calculus (LC)
- Be able to parse a lambda term correctly (e.g. which
variable is bound by which abstraction, which variable is
free, which application is top-most, etc.)
- Describe and know how to apply α-conversions
and β-reductions.
- Write simple non-recursive functions as
λ-expressions.
- Know the differences between and be able to
demonstrate lazy/eager evaluation and unrestricted
alpha-beta reduction.
- Understand Church numerals and Church booleans and how to
manipulate/generate them in LC (e.g, be able to write
addition and multiplication λ-expressions).
- Understand how other high-level datatypes and
primitive recursive functions are encoded in LC.
- Semantics
- Be able to derive the proof tree for the evaluation of an expression in Natural semantics.
- Be able to derive the proof tree for the evaluation of an expression in Transitional semantics.
- Be able to compare Natural and Transitional semantics.
- Understand the evaluation rules in both semantics, and be able to write evaluation rules for new syntactic constructs.
- Axiomatic Semantics
- Be able to prove simple statements in Floyd-Hoare Logic, similar to what you found on the homework.
- Be able to derive new Floyd-Hoare logic rules for new programming language constructs.
|
|