Skip to end of metadata
Go to start of metadata

COMP 311 / COMP 544: Functional Programming (Fall 2020)

Instructors

Robert "Corky" Cartwright

TA

TBA

Lectures

Online using Zoom

Lecture Times

9:25am–10:40am TR

Instructor Emailcork@rice.eduOnline DiscussionPiazza – Rice Comp 311

 

Description

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 (multicore) programming, and distributed computing. Course work consists of a series of programming assignments in the Racket and Java programming languages.

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.


General Information

 

Course Syllabus
Homework Submission Guide
Office Hours
Instructors
    
Corky

MWF

 

9:25-10:40am

 

Online via Zoom

Teaching Assistants

TBA

TBA

TBA

TBA

TBA

TBA

TBA

TBA

Textbooks
Online Videos
Development Environment

 

Lecture Schedule (Subject to Change Without Notice)

 

Week

Day

Date

Lecture Topic and Resources

Work AssignedWork Due

1

Tu

Aug 27

Overview, Motivation

  
 ThAug 29Computation by Reduction, Types, Core ScalaHomework 0 

2

Tu

Sep 03

Ints, Doubles, Error Conditions, Programming with Intention

  
 ThSep 05The Design Recipe
BeakerX Notebook: Source, PDF
  

3

Tu

Sep 10

Conditionals, Functions on Ranges & Point Values, Compound Data
BeakerX Notebook A: Source, PDF
BeakerX Notebook B: Source, PDF

  
 ThSep 12Methods, Objects, Grading  

4

Tu

Sep 17

Abstract Datatypes

Homework 1Homework 0

 

Th

Sep 19

Recursively Defined Types

  

5

Tu

Sep 24

Functions as Values

  

 

Th

Sep 26

1st-Class Functions, Imports

  

6

Tu

Oct 01

Named Arguments, Varargs, String Interpolation, Packages

Homework 2Homework 1

 

Th

Oct 03

Generic Types, Type Hierarchy, Variance
Supplement: Producers and Consumers

  

7

Tu

Oct 08

Type Hierarchy, Variance, Generic Map Function  

 

Th

Oct 10

Fold, Zip, Flatten, For Expressions

  

8

Tu

Oct 15

Midterm Recess (no classes)

  

 

Th

Oct 17

Scala Immutable Collections, Call by Name

Homework 3Homework 2

9

Tu

Oct 22

Monads, For-expression desugaring  

 

Th

Oct 24

Operators, Accumulators
BeakerX Notebook: Source, PDF

  

10

Tu

Oct 29

Video: Growing a Language, by Guy L. Steele, Jr.
Exam 1 at 7pm in DCH 1064

  

 

Th

Oct 31

Scala Parser Combinators

  

11

Tu

Nov 05

Lazy and Infinite Sequences

  

 

Th

Nov 07

Semantics of Exceptions

Homework 4Homework 3

12

Tu

Nov 12

Traits and Mixins
BeakerX Notebook A: MTG with Mixins – Source, PDF
BeakerX Notebook B: Stackable Mixins – Source, PDF

  

 

Th

Nov 14

Additional Scala Features

  

13

Tu

Nov 19

State Monad
BeakerX Notebook: Source, PDF

  

 

Th

Nov 21

Video: What to Leave Implicit, by Martin Odersky

Homework 5Homework 4
14TuNov 26No Class  

 

Th

Nov 28

Thanksgiving Holiday (no classes)

  

15

Tu

Dec 03

Course Wrap-Up

  
 ThDec 05Exam 2 (in class) Homework 5
16TuDec 10Study Day (no classes)  

 

Sat

Dec 14

Final exam/project date scheduled by university
(last day to to submit assignments for this course)

  

* Lectures slides not yet updated from last year are marked with an asterisk.

  • No labels