COMP 311 / COMP 544: Functional Programming (Fall 2020)
...
Syllabus | SVN Documentation | JavaGuide |
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)
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 0301 | Conditionals, Function Definitions and Computation by Reduction | Review Ch 8 HTDP Part 2 (Ch 9-10) | Sep 1008 | |||||||
3 | Th | Sep 0503 | The Program Design Recipe for Racket focusing on using recursion to process lists and natural numbers | Preface, 9.4 HTDP Part 2 (Ch 11-13) | Sep 1210 | ||||||
34 | Tu | Sep 1008 | Data Definitions, Data-driven Structural Recursion, | Homework 2Inductively Defined Data and Structural Templates HTDP Part 3 | Sep 1716 | ||||||
5 | Th | Sep 12 | Functions as Data and Customizers; Nameless Functions | Homework 2 | Sep 19 | 10 | Mutually Recursive Definitions and Help Functions | HTDP Ch 15-17 | Sep 17 | ||
64 | Tu | Sep 17 | Generative Recursion | 15 | Local Definitions and Lexical Scope | HTDP Parts 5-6 | Sep 2423 | ||||
Th | Sep 19 | Accumulators | 17 | Lambda the Ultimate and Reduction Semantics | LawsOfEval.pdfHomework 3* | Sep 26 | |||||
58 | Tu | Sep 19 24Macros | Functional Abstraction and Lazy EvaluationPolymorphism | ?Oct 6 | |||||||
9 |
| Th | Sep 2624 | Functions as ValuesAbstract Syntax and Term Rewriting | Homework 4* | Oct 5 | |||||
610 | Tu | Oct 01 | Functional Design Patterns in OOP | Sep 29 | Generative (Non-structural) Recursion | Oct 6 | |||||
11 | Th | Oct 03 | OOP as an Extension of FP | Homework 5 | 01 | Lazy Evaluation and Non-strict Constructors | |||||
12 | 7Tu | Oct | 08Typed Lambda Calculus | 06 | Techniques for Implementing Lazy Evaluation | Homework 5* | Oct 14 | ||||
13 |
| Th | Oct 10 | Polymorphic Lambda Calculus | 08 | A Glimpse at Imperative Racket and Memoization | |||||
8 | Tu | Oct 15 | Midterm Recess (no classes) | 13 | Racket Review | ||||||
13 | Th | Oct 17 | Homework 3 | Homework 2 | 15 | On to Java! | OO Design Notes | ||||
Fri | Oct 16 | Midterm | |||||||||
149 | Tu | Oct 22 | Monads, For-expression desugaring | Adapting the HTDP Design Recipe to Java | Homework 6 | Oct 27 | |||||
15 | Th | Oct 24 | Operators, Accumulators | Higher-order Functional Programming in Java | |||||||
16 | 10 | Tu | Oct 29 | Video: Growing a Language, by Guy L. Steele, Jr. | Four Key Idioms for Encoding FP in Java | Homework 7 | Nov 6 | ||||
17 | Th | Oct 31 | The Singleton and Visitor Patterns | ||||||||
1811 | Tu | Nov 0503 | |||||||||
| Th | Nov 07 | Homework 4 | Homework 3 | |||||||
12 | Tu | Nov 12 | Traits and Mixins | ||||||||
Java Generics and Their Role in FP in Java | Homework 8* | Nov 16 | |||||||||
19 | Th | Nov | 1405 | The Strategy Pattern: Functions as Arguments in Java | |||||||
20 | 13Tu | Nov | 19State Monad | 10 | Core Haskell (call-by-name, lazy constructors) (Agnishom) | ||||||
21 | Th | Nov | 21Video: What to Leave Implicit, by Martin Odersky | Homework 5 | Homework 4 | 12 | Haskell Pattern Matching (Agnishom) | Homework 9 | Nov 19 | ||
22 | 14Tu | Nov | 26No Class | ||||||||
| Th | Nov 28 | Thanksgiving Holiday (no classes) | ||||||||
15 | Tu | Dec 03 | Course Wrap-Up | ||||||||
Th | Dec 05 | Exam 2 (in class) | Homework 5 | ||||||||
16 | Tu | Dec 10 | Study Day (no classes) | ||||||||
| Sat | Dec 14 | Final exam/project date scheduled by university | ||||||||
17 | Haskell Type Classes (Agnishom) | Dec 16 | |||||||||
23 | Th | Nov 19 | Haskell Monads (Agnishom) | Final Project** |
*Assignments marked with * are double assignments that count twice as much as regular assignments. **indicates the project in lieu of a final examination* Lectures slides not yet updated from last year are marked with an asterisk.