Title: CS 6371: Advanced Programming Languages
Course Registration Number: 12219
Times: MW 4:00-5:15
Location: ECSS 2.203
Instructor: Dr. Kevin Hamlen (hamlen AT utdallas)
Instructor's Office Hours: ECSS 3.704, Fri 3:00-5:00
Teaching Assistant: Meera Sridhar (mxs072100 AT utdallas)
TA's Office Hours: EC Open Access Lab (ECSS 2.103 & 2.104), Th 5:00-7:00pm
Final exam and final course grades are released and are available via WebCT. (Final exam scores are out of 70 and are in the column labeled "Final Exam" and final course letter grades are in the column labeled "Final". If you would like to see your final exam, please email me for an appointment.
This course will cover functional and logic programming, concepts of programming language design, and formal reasoning about programs and programming languages. The following are the course learning objectives:
Through taking this course, students will learn the tradeoffs of imperative vs. non-imperative programming languages, issues involved in designing a programming language, the role of formal semantics and type-systems in reasoning about programs and languages, and proof techniques related to programming language design.
The course is open to Ph.D. students and Masters students. Interested undergraduates should see the instructor for permission to take the course.
Prerequisites: Discrete Structures (CS 3305/5333 or equivalent), Algorithm Analysis and Data Structures (CS 3345/5343 or equivalent), Automata Theory (CS 4384/5349 or equivalent). A solid background in all three of these areas will be heavily assumed throughout the course!
Although the early course lectures will include a brief survey of the OCaml programming language, students will be expected to learn most of OCaml on their own. Therefore, if you want to get a head start, I recommend downloading and installing OCaml, and walking yourself through some of the many online tutorial examples:
If you can't get OCaml to work on your personal machine, you can use OCaml on the UTD CS Dept. Linux servers. To do so:
OCaml is available on each of the following CS servers: cslinux2.utdallas.edu, cscomp.utdallas.edu, cscomp1.utdallas.edu, cscomp2.utdallas.edu, cscomp3.utdallas.edu. When connecting from off-campus, ssh to cs1.utdallas.edu or cs2.utdallas.edu first, and then ssh to one of the other machines from there.
Homework (40%): Homeworks will be assigned approximately once per 1.5 weeks, and will consist of a mix of programming assignments and written assignments. All programming assignments will be done in Ocaml or Prolog. Written assignments will typically involve discrete math proofs. Homeworks must be turned in at the start of class (i.e., by 4:05pm) on the due date. No late homeworks will be accepted.
Midterm (25%): There will be an in-class midterm exam on Wednesday, March 4. The exam will cover functional programming, operational semantics, denotational semantics, and fixpoints.
Final (35%): The final exam for the course is scheduled for 2:00pm Friday, May 8. The exam will be cumulative, covering all material in the course. Students will have 2 hours and 45 minutes to complete it.
All homework assignments in this course are to be completed INDIVIDUALLY. Submitting someone else's work as your own, whether it be a classmate's work, something you found in a book, or something you found in someone else's notes, is PLAGARISM and may result in an immediate failing grade for the course and/or expulsion from the computer science program. Therefore, please do not cheat! It is far better to get the problem wrong or not to turn in the assignment at all than to risk these severe penalties!
Students are encouraged to study together. This can include asking one another general questions about the course material (e.g., "How do you catch an exception in OCaml?") but NOT specific questions that reveal answers to homework problems (e.g., "How did you solve question 3?"). In general, if you are looking at or hearing someone else's answers to a homework you have not yet submitted, you are cheating.
The course has no required textbook, but we will make use of several online references:
|Functional Programming with OCaml||Pre-assignment: Download and install OCaml. Compile and execute the Fibonacci example|
|Course Introduction: Functional vs. Imperative programming, Type-safe languages, intro to OCaml
Lecture 1 OCaml Transcript
Lecture 1 Slides
|OCaml: Parametric Polymorphism
Lecture 2 OCaml Transcript
|Assignment 1 due
|Mon 1/19||No Class (Martin Luther King Day)|
|OCaml: List folding, tail recursion, standard libraries, exception-handling
Lecture 3 OCaml Transcript
|Large-step Semantics: Intro
(See assignment 2 for lecture notes.)
|Assignment 2 due
|Wed 1/28||Class Canceled due to University Closing|
|Large-step Semantics: Proof techniques
|Assignment 3 due
(See assignment 3, section 3.3 for notes)
|Denotational Semantics: Semantic Domains and Valuation Functions
|Denotational Semantics: Fixed Points|
|Assignment 4 due
|Fixpoints and CPO's
|Equivalence of Operational and Denotational Semantics|
Sample Midterm Exam
|Type Theory: Introduction
(See Assignment 5 for lecture notes.)
|Assignment 5 due
|Mon 3/16||No Class (Spring break)|
|Wed 3/18||No Class (Spring break)|
|Type theory: Progress & Subject Reduction
|Untyped Lambda Calculus
(See Assignment 6 for lecture notes.)
|Assignment 6 due
|Simply Typed Lambda Calculus
|Polymorphic Lambda Calculus: Polymorphic abstraction and polymorphic application|
|Polymorphic Lambda Calculus: Hindley-Milner Type-inference, Type-unification||Assignment 7 due
|Functions: Call-by-Value, Call-by-Reference, Call-by-Name, Call-by-Need|
|Formal Verification of Programs|
|Axiomatic Semantics: Hoare Logic
|Axiomatic Semantics: Loop Invariants, Weakest Precondition, Strongest Postcondition
|Assignment 8 due
|Logic Programming in Prolog|
|Logic Programming: Part I
|Logic Programming: Part II
(see lecture slides from 4/20)
|Assignment 9 due
|Logic Programming: Part III
(see lecture slides from 4/20)
|Final Review (cont.)|