COMP 311 / COMP 544: Functional Programming (Fall 2020)
Instructors | Robert "Corky" Cartwright | TA | TBA |
---|---|---|---|
Lectures | Online using Zoom | Lecture Times | 9:40am–11:00am TR |
Instructor Email | cork@rice.edu | Online Discussion | Piazza – Rice Comp 311 |
Brief Description
Grading will be based on your performance on weekly programming assignments and two exams: a midterm and a final. All work in this class is expected to be your own, and you are expected not to post your solutions or share your work with other students, even after you have taken the course. Please read the Comp 311 Honor Code Policy for more details on how you are expected to work on your assignments. There will also be a final exam, as described in the syllabus.
All students will be held to the standards of the Rice Honor Code, a code that you pledged to honor when you matriculated at this institution. If you are unfamiliar with the details of this code and how it is administered, you should consult the Honor System Handbook. This handbook outlines the University's expectations for the integrity of your academic work, the procedures for resolving alleged violations of those expectations, and the rights and responsibilities of students and faculty members throughout the process.
Students with disabilities are encouraged to contact me during the first two weeks of class regarding special needs. Students with disabilities should also contact Disabled Student Services in the Ley Student Center and the Rice Disability Support Services.
General Information
Office Hours |
| ||||||||||||||||||||
Textbooks | There is no required textbook. We will follow the pedagogic approach of "How to Design Programs" and extend it to other languages. We will also draw material from a variety of sources, including:
| ||||||||||||||||||||
Recommended Videos | |||||||||||||||||||||
Development Environment |
|
Lecture Schedule (In Progress)
Homework 5
Week | Day | Date | Lecture Topic and Resources | Work Assigned | Work Due |
---|---|---|---|---|---|
Tu | Aug 27 | Motivation and the Elements (Constants) of Racket | HTDP Part 1 (Ch 1-8) | Sep 03 | |
Th | Aug 29 | [Canceled for Hurricane Laura] | Sep 05 | ||
Tu | Sep 01 | Conditionals, Function Definitions and Computation by Reduction | Review Ch 8 HTDP Part 2 (Ch 9-10) | Sep 08 | |
3 | Th | Sep 03 | The Program Design Recipe for Racket focusing on recursion on processing lists and natural numbers | Preface, 9.4 HTDP Part 2 (Ch 11-13) | Sep 10 |
Tu | Sep 08 | Data Definitions, Data-driven Structural Recursion, | HTDP Part 3 | Sep 16 | |
5 | Th | Sep 10 | Mutually Recursive Definitions and Help Functions | HTDP Ch 15-17 | Sep 17 |
Tu | Sep 15 | Local Definitions and Lexical Scope | HTDP Parts 5-6 | Sep 23 | |
Th | Sep 17 | Lambda the Ultimate and Reduction Semantics | LawsOfEval.pdf | Sep 26 | |
8 | Tu | Sep 19
| Functional Abstraction and Polymorphism | Oct 6 | |
9 | Th | Sep 24 | Functions as Values | Homework 4 | Oct 5 |
10 | Tu | Sep 29 | Generative (Non-structural) Recursion
| Oct 6 | |
11 | Th | Oct 01 | Lazy Evaluation and Non-strict Constructors | ||
12 | Tu | Oct 06 | Techniques for Implementing Lazy Evaluation | Homework 5 | Oct 14 |
13 | Th | Oct 08 | A Glimpse at Imperative Raceket and Memoization | ||
| Tu | Oct 13 | Racket Review | ||
13 | Th | Oct 15 | Java Design Recipe & Functional Design Patterns in OOP | OO Design Notes | |
Fri | Oct 16 | Midterm | |||
14 | Tu | Oct 22 | Data-driven Structural Recursion in Java | Homework 7 | Oct 29 |
15 | Th | Oct 24 | Anonymous class instances vs anonymous functions | ||
16 | Tu | Oct 29 | Functional Java & OOP as an Extension of FP | Homework 8* | Nov 12 |
17 | Th | Oct 31 | Pure Lambda Calculus; Call-by-value vs call-by-name | ||
18 | Tu | Nov 05 | Typed Lambda Calculus | Homework 9# | Nov 12 |
19 | Th | Nov 07 | Polymorphic Lambda Calculus & Implicitly Polymorphic Lambda Calculus | ||
20 | Tu | Nov 12 | Core Haskell (call-by-name) | Homework 10 | Nov 19 |
21 | Th | Nov 14 | Haskell Pattern Matching | ||
22 | Tu | Nov 19 | Haskell Type Classes | Homework 11 | Dec 16 |
23 | Th | Nov 21 | Racket letcc; Semantics of Haskell Exceptions |
*Assignments marked with * are double assignments that count twice as much as regular assignments.