COMP 627

4 credits

Theoretical Programming Languages

Computer Science (Sci): Programming language semantics. Lambda calculus, the Church Rosser theorem, typed lambda calculus, the strong normalization theorem, polymorphism, type inference, elements of domain theory, models of the lambda calculus, relating operational and denotational semantics, full abstraction. Reasoning about programs. Soundness and relative completeness of program logics.

Offered by: Computer Science

- Terms
- This course is not scheduled for the 2012-2013 academic year.

- Instructors
- There are no professors associated with this course for the 2012-2013 academic year.