NOTE: This page is for an old offering of the course. To find the latest course offering, please visit https://comp311.rice.edu/.
COMP 311: Functional Programming (Fall 20152016)
Instructor | Dr. Eric Allen Dr. Corky Cartwright | Graduate TAs |
|
---|---|---|---|
Co-Instructor | Dr. Sağnak Taşırlar | Undergraduate TAs |
|
Lectures | Lecture Times | 28:30PM 00AM - 39:45PM 15AM TR | |
Course Email | comp311@ricecomp311_staff@rice.edu | Online Discussion | Piazza -- Rice Comp 311 |
Description
Grading will be based on your performance on weekly programming assignments. 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.
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
Lecture Schedule (Subject to Change Without Notice)
Conditional Functions on Ranges, Point Values, and Compound Datatypes
Semantics of Type Checking, Binary Methods, Abstract Datatypes
For Expressions, Monads, The Environment Model of Reduction
Call-by-Name, Environment Model of Type Checking, Generative RecursionHomework Evaluation, DrScala, Tests, Objects, Binary Methods, Operators
Week | Day | Date | Topic | Work Assigned | Work Due | ||||
---|---|---|---|---|---|---|---|---|---|
1 | Tues | Aug 2523 | |||||||
Thur | Aug 27 | The Nature of Doubles, The Design Recipe | 25 | What are Types, Core Scala | Hwk 0 | ||||
2 | Tues | Sep 01 | Aug 30 | Doubles, Programming with Intention, The Design RecipeType Checking, Conditional Functions, Compound Datatypes | |||||
Thurs | Sep 0301 | Grading, DrScala, Tests, Binary Methods, Operators | Hwk 1 | Functions on Ranges, Point Values, Compound Datatypes | |||||
3 | Tues | Sep 0806 | Conditional FunctionsMethods, Abstract DatatypesGrading, Case ClassesDrScala | ||||||
Thur | Sep 1008 | Abstract DatatypesSyntax and Semantics of Core Scala | Hwk 2Hwk 1 | ||||||
4 | Tues | Sep 1513 | Subtyping of Arrow Types, ExceptionsPattern Matching, The Expression Problem | ||||||
| Thur | Sep 1715 | Options, Lists, The Natural Numbers | Hwk 3 | Hwk 2 | ||||
5 | Tues | Sep 22Binary Search Trees20 | |||||||
| Thurs | Sep 2422 | Higher-Order FunctionsComplexity Analysis | Hwk 42 | Hwk 31 | ||||
6 | Tues | Sep 2927 | Functions as Values, Polymorphic Functions, Call-by-NameParametric Types | ||||||
| Thur | Oct 01 | Referential Transparency, Exceptions and Continuations | Hwk 5 | Sep 29 | Hwk 4 | |||
7 | Tues | Oct 06Generative Recursion 104 | For Expressions, Monads, The Environment Model | ||||||
|
| Thurs | Oct 08 | Generative Recursion 2 | 06 | Hwk 3 | Hwk 2Hwk 5 | ||
8 | Tues | Oct 1311 | MIDTERM RECESS | ||||||
| Thur | Oct 15Guest Lecture (TBA)13 | |||||||
9 | Tues | Oct 20Tail Recursion and Accumulators18 | Call-by-Name, Type Environments, Generative Recursion | ||||||
|
| Thur | Oct 2220 | Strategies for Generative Recursion Comprehensions and flatMap | Hwk 64 | Hwk 3 | |||
10 | Tues | Oct 2725 | Accumulators Map, Reduce, Higher Order Functions | ||||||
| Thur | Oct 2927 | Functional Leftist Heaps and Binomial Heaps | Hwk 7 | Hwk 6 | ||||
11 | Tues | Nov 03Functional Red-Black Trees01 | |||||||
| Thur | Nov 05 | Programs as Proofs | Hwk 8 | 03 | Hwk 5 | Hwk 4Hwk 7 | ||
12 | Tues | Nov 1008 | The State MonadVariable Assignment and the Environment Model | ||||||
| Thur | Nov 12 | Mutable Objects, Equality | Hwk 9 | 10 | Hwk 8 | |||
13 | Tues | Nov 17Distributed Computing with Apache Spark15 | |||||||
| Thur | Nov 1917 | Tactical Theorem Proving Distributed Machine Learning | Hwk 106 | Hwk 95 | ||||
14 | Tues | Nov 2422 | Project FortressGuest Lecture (TBA) | ||||||
| Thur | Nov 2624 | THANKSGIVING | ||||||
15 | Tues | Dec 01 | Nov 28 | Functional Distributed ComputingPipelines and SparkML | |||||
Thur | Dec 0301 | Course Wrap Up | Hwk 10 |
Grading, Honor Code Policy, Processes and Procedures
Grading will be based on your performance on weekly programming assignments.
In this course, 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.
Homework Submissions: All submitted homework submissions and presentations are expected to be the result of your team’s effort. All essays are expected to be the result of your individual effort. You are free to discuss course material and approaches to problems with your other classmates, the teaching assistants and the professor, but you should never misrepresent someone else’s work as your own. If you use any material from external sources, you must provide proper attribution.
Accommodations for Students with Special Needs
...
6 |