COMP 311 / COMP 544: Functional Programming (Fall 2023)
Robert "Corky" Cartwright
9:25 am–10:40 am TuTh
|Piazza – Rice Comp 311
This class provides an introduction to functional programming. Functional programming is a style of programming in which computations are solely expressed in terms of applications of functions to arguments (which themselves can be functions). This style of programming has a long history in computer science, beginning with the formulation of the Lambda Calculus as a foundation for mathematics. It has become increasingly popular in recent years because it offers important advantages in designing, maintaining, and reasoning about programs in modern contexts such as web services, parallel (multi-core) programming, and distributed computing. Coursework consists of a series of programming assignments in the Racket and Java programming languages followed by a discussion of frameworks for reasoning about functional and imperative programs supported by written homework assignments.
Grading, Honor Code Policy, Processes, and Procedures
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.
Accommodations for Students with Special Needs
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.
|Textbooks and articles
There is no required textbook. We will follow the pedagogic approach of "How to Design Programs, First Edition" and extend it to other languages. The Second Edition of this book is the default at the website www.htdp.org but this web page contains a link to the first edition (at URL: https://htdp.org/2003-09-26/) at the bottom of the page. The two editions are very similar but this course tracks the first edition.
We will draw material from a variety of sources, including:
Lecture Schedule (In Progress)
Motivation and the Elements (Constants) of Racket
|Skim HTDP First Edition, Part 1 (Ch 1-8), Part 2 (Ch 9-10)
|Conditionals, Function Definitions, and Computation by Reduction
Conditionals, Function Definitions, and Computation by Reduction
Review Ch 8
HTDP Part 2 (Ch 9-10)
The Program Design Recipe for Racket, which focuses on using
recursion to process lists and natural numbers
HTDP Part 2 (Ch 11-13)
Data Definitions, Data-driven Structural Recursion,
HTDP Part 3
|Mutually Recursive Definitions and Help Functions
|HTDP Ch 15-17
Local Definitions and Lexical Scope
HTDP Parts 5-6
Lambda the Ultimate and Reduction Semantics
|Functional Abstraction and Polymorphism
Functions as Values
Generative (Non-structural) Recursion
|Homework 5 (long)*
Lazy Evaluation and Non-strict Constructors
Techniques for Implementing Lazy Evaluation
A Glimpse at Imperative Racket and Memoization
On to Java!
Midterm (Through Lecture 13 and HW 5) 7-10 pm
Adapting the HTDP Design Recipe to Java
Higher-order Functional Programming in Java
Four Key Idioms for Encoding FP in Java
The Singleton and Visitor Patterns
Java Generics and Their Role in FP in Java
Reasoning About Functional Programs
First-order Programming Logic (an analog of ACL2 [UT Austin])
Theorem Proving Strategies
|imperative Loop Invariants vs. Contracts for Help Functions
|Reasoning About Procedure Calls
|Hoare Logic Applied to OO Code
|The Future of FP and Programming Logic
*Assignments marked with * are double assignments that count twice as much as regular assignments.
Write a comm