Title: CS 6371: Advanced Programming Languages
Course Registration Number: 22958
Times: TR 1:00–2:15
Location: CB 1.218
Instructor: Dr. Kevin Hamlen (hamlen AT utdallas)
Instructor's Office Hours: TR 2:15–3:15 in ECSS 3.704
Teaching Assistant: TBA
TA's Office Hours: TBA
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 formal, high-assurance 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: 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!
STUDENTS MUST ATTEND AT LEAST ONE OF THE FIRST THREE CLASSES. IF YOU MISS MORE THAN TWO OF THE FIRST THREE CLASSES (other than for excused absences—see below) THEN YOUR FINAL COURSE GRADE WILL AUTOMATICALLY BE REDUCED BY ONE FULL LETTER GRADE. The first three classes will cover logic programming in the Prolog programming language, which will introduce many concepts assumed throughout the rest of the course. Documented absences approved by university policy are exempted from this attendance requirement. These include illness with an accompanying doctor's note, and observance of religious holy days.
To better understand the in-class Prolog lectures at the start of the course, you should either install your own local version of SWI Prolog (preferred), or you can access the version installed on the UTD linux servers as follows:
To better understand the in-class OCaml demos starting in the second week of the course, 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 Prolog or OCaml. 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 closed-book and closed-notes.
Midterm (25%): There will be an in-class midterm exam in class on Thursday, March 2nd. The exam will cover functional programming, operational semantics, denotational semantics, and fixpoints.
Final (35%): A final exam for the course has been tentatively scheduled by the university registrar for Thursday, May 3rd at 2:00pm. 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 word-for-word. 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 off-limits because such "collaborations" tend to involve simply copying or reverse-engineering 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:
|Logic Programming: Part I||Assignment 1 due 1/25
|Logic Programming: Part II|
|Logic Programming: Part III|
|Course Introduction: Functional vs. Imperative programming, type-safe languages, intro to OCaml|
|OCaml: Parametric polymorphism|
|OCaml: List folding, tail recursion, exception-handling||Assignment 2 due 2/6
|Quiz #1: Logic Programming|
|Large-step Semantics: Intro|
|Large-step Semantics: Proof techniques||Assignment 3 due 2/13
Quiz #2: Functional Programming
|Denotational Semantics: Semantic domains and valuation functions||Assignment 4 due 2/22
|Denotational Semantics: Fixed points|
Quiz #3: Operational Semantics
|Semantic Equivalence||Assignment 5 due 3/8
|Type Theory: Introduction|
|Type Theory: Type-soundness, Progress and Preservation
Quiz #4: Denotational Semantics
|Assignment 6 due 3/22
|No Class: Spring break|
|No Class: Spring break|
|Untyped Lambda Calculus|
|Untyped Lambda Calculus: Introduction
Quiz #5: Type Theory
|Assignment 7 due 4/3
|Untyped Lambda Calculus: Encodings and reductions|
|Typed Lambda Calculus|
|Simply-typed Lambda Calculus|
|System F: Type-inhabitation, Curry-Howard Isomorphism
Quiz #6: Lambda Calculus
|Assignment 8 due 4/17
|Summary/Comparison of Modern Language Features: Weak vs. strong typing, type-safety, function evaluation strategies|
|Summary/Comparison of Modern Language Features: Hindley-Milner type-inference, type polymorphism|
|Axiomatic Semantics: Hoare Logic|
|Axiomatic Semantics: Loop invariants||Assignment 9 due 4/26
|Axiomatic Semantics: Weakest precondition, strongest postcondition|
Quiz #7: Axiomatic Semantics