Title: CS 6371: Advanced Programming Languages
Course Registration Number: 25369/003641
Times: TR 1:00–2:15
Location: AD 2.216
Instructor: Dr. Kevin Hamlen (hamlen AT utdallas)
Instructor's Office Hours: TR 2:30–3:30 (ECSS 3.704)
This course covers 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. nonimperative programming languages, issues involved in designing a programming language, the role of formal semantics and typesystems in reasoning about programs and languages, and proof techniques related to formal, highassurance software validation.
The course is open to Ph.D. students and Masters students. Interested undergraduates should see the instructor for permission to take the course.
Prerequisites: Algorithm Analysis and Data Structures (CS 3345/5343 or equivalent), Automata Theory (CS 4384/5349 or equivalent). A solid background in each of these areas will be heavily assumed throughout the course!
The first three classes are extremely important for succeeding in the remainder of the course; students are therefore urged to participate in the course from the start, by attending the first three classes in person. These initial classes will cover functional programming in the OCaml programming language, which will introduce many concepts assumed throughout the rest of the course. As mandated by the CS Dept Attendance Policy, missing the first 3 classes will result in an automatic deduction of one letter grade, and missing the first 4 classes will result in an automatic failing grade for the course.
To better understand the inclass OCaml demos, you should do the following as preparation:
If you can't get OCaml to work on your personal machine, you can use OCaml on the UTD CS Department Linux servers. To do so:
Homework (25%): Homeworks will be assigned approximately once per 1.5 weeks, and will consist of a mix of programming assignments and written assignments. Programming assignments will be implemented 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 1:05pm) on the due date. To help students prepare for the next assignment, homework solutions will typically be revealed on each due date. Therefore, no late homeworks will be accepted.
Quizzes (15%): On indicated assignment due dates (see the course schedule below), students will solve one or two problems individually at the start of class as a quiz. The quiz problems are essentially extra homework problems solved individually in class without the help of the internet or collaboration with other students. The quizzes will be closedbook and closednotes.
Midterm (25%): There will be an inclass midterm exam in class on Thursday, March 9th. The exam will cover functional programming, operational semantics, denotational semantics, and fixpoints.
Final (35%): A final exam for the course will be scheduled by the university registrar. The exam will be cumulative, covering all material in the course. Students will have 2 hours and 45 minutes to complete it.
Students may work individually or together with other students presently enrolled in the class to complete the assignments, but they must CITE ALL COLLABORATORS AND ANY OTHER SOURCES OF MATERIAL that they consulted, even if those sources weren't copied wordforword. Copying or paraphrasing someone else's work without citing it is plagiarism, and may result in severe penalties such as an immediate failing grade for the course and/or expulsion from the computer science program. Therefore, please cite all sources!
Students may NOT consult solution sets from previous semesters of this course, or collaborate with students who have such solutions. These sources are offlimits because such "collaborations" tend to involve simply copying or reverseengineering someone else's answer to a similar homework problem, which does not prepare you for the quizzes and exams.
The course has no required textbook, but we will make use of several online references:
Date  Topic  Assignments  
Functional Programming  
No Class: Tue 1/16 
University closure (weather emergency)  Assignment 1 due 1/30 (OCaml Intro) 

Lecture 1: Thu 1/18 
Course Introduction: Functional vs. Imperative programming, typesafe languages, intro to OCaml Lecture Slides OCaml Transcript Lecture Notes 

Lecture 2: Tue 1/23 
OCaml: Parametric polymorphism OCaml Transcript Lecture Notes 

Lecture 3: Thu 1/25 
OCaml: List folding, tail recursion, exceptionhandling Lecture Notes 

Operational Semantics  
Lecture 4: Tue 1/30 
Largestep Semantics: Intro Lecture Slides 
Assignment 2 due 2/8 (SIMPL Interpreter) 

No Class: Thu 2/1 
Class canceled  
Lecture 5: Tue 2/6 
Largestep Semantics: Proof techniques Lecture Slides Structural Induction Proof Examples 

Lecture 6: Thu 2/8 
Smallstep Semantics Lecture Slides Smallstep Semantics Reference Quiz #1: OCaml Programming 
Assignment 3 due 2/20 (Operational Semantics) 

Denotational Semantics  
Lecture 7: Tue 2/13 
Denotational Semantics: Semantic domains and valuation functions Lecture Slides Denotational Semantics Reference 

Lecture 8: Thu 2/15 
Fixpoint Induction Lecture Slides Supplementary Notes on CPOs 

Lecture 9: Tue 2/20 
Fixpoint Induction: Theorem Generalization Quiz #2: Operational Semantics 
Assignment 4 due 2/29 (Denotational Semantics) 

Lecture 10: Thu 2/22 
Programproof Codevelopment: Intro to Coq Coq Transcript 

Lecture 11: Tue 2/27 
Semantic Equivalence Lecture Slides Coq Listing 

Type Theory  
Lecture 12: Thu 2/29 
Type Theory: Static Semantics Lecture Slides Quiz #3: Denotational Semantics 

Lecture 13: Tue 3/5 
Midterm Review Sample Midterm Exam w/Solutions 
Assignment 5 due 3/19 (SIMPL Typechecker) 

Midterm: Thu 3/7 
Midterm Exam  
No Class: Tue 3/12 
No Class: Spring break  
No Class: Thu 3/14 
No Class: Spring break  
Untyped & Simplytyped Lambda Calculus  
Lecture 14: Tue 3/19 
Untyped Lambda Calculus: History, Semantics, Completeness Lecture Slides 
Assignment 6 due 3/28 (Lambda calculus) 

Lecture 15: Thu 3/21 
Type Safety: Progress, Preservation, Subtyping Lecture Slides Supplementary Lecture Notes Coq Listing Quiz #4: Type Theory 

Logic Programming  
Lecture 16: Tue 3/26 
Logic Programming: Part I Lecture Slides 

Lecture 17: Thu 3/28 
Logic Programming: Part II Lecture Slides Quiz #5: Lambda Calculus 
Assignment 7 due 4/9 (Prolog) 

Lecture 18: Tue 4/2 
Logic Programming: Part III Lecture Slides 

System F  
Lecture 19: Thu 4/4 
System F: Syntax & Sematics Lecture Slides Lecture Notes 

Lecture 20: Tue 4/9 
CurryHoward Isomorphism: Typeinhabitation Lecture Slides Lecture Notes Quiz #6: Prolog 
Assignment 8 due 4/23 (Functional SIMPL) 

Lecture 21: Thu 4/11 
Summary/Comparison of Modern Language Features: HindleyMilner typeinference, type polymorphism Lecture Slides Lecture Notes 

Lecture 22: Tue 4/16 
Summary/Comparison of Modern Language Features: Weak vs. strong typing, typesafety, function evaluation strategies Lecture Slides 

Formal Verification  
Lecture 23: Thu 4/18 
Axiomatic Semantics: Hoare Logic Lecture Slides C.A.R. Hoare's original 1969 paper on Axiomatic Semantics (optional reading) 

Lecture 24: Tue 4/23 
Axiomatic Semantics: Loop invariants Lecture Slides 
Assignment 9 due 5/2 (Hoare Logic) 

Lecture 25: Thu 4/25 
Axiomatic Semantics: Weakest precondition, strongest postcondition Lecture Slides 

Lecture 26: Tue 4/30 
Final Review Lecture Slides Sample Final Exam w/Solutions 

Lecture 27: Thu 5/2 
Final Review Quiz #7: Axiomatic Semantics 

Final Exam Tue 5/7 
Final Exam: 2:00–4:45pm in ECSW 3.210 