You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 15 Next »

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

 

 

Online Book

Racket HW Guide

HW Checklist

HW Grading

Java HW Guide

SVN Documentation



Instructors

Robert "Corky" Cartwright

TA

TBA

Lectures

Online using Zoom

Lecture Times

9:40am–11:00am TR

Instructor Emailcork@rice.eduOnline DiscussionPiazza – Rice Comp 311

 

Brief 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, Java, and Haskell programming languages plus occasional written homework assignments on underlying theory.

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
Instructor
    
Corky Cartwright

TuTh

 

1:30pm-2:30pm

By appointment

Online via Zoom

Online via Zoom

Teaching Assistants

Agnishom

Andrew Obler

Chunxiao Liao

TBA

TBA

TBA

TBA

TBA

TBA

Online via Zoom

Online via Zoom

Online via Zoom

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
  • DrRacket is recommended for all Racket homework assignments in this course. The interface is "textually transparent" as we will show in class.
  • DrJava is the supported IDE for Java in this course, but you are welcome to use any IDE such as IntellJ or Eclipse.
  • We are still evaluating IDEs for Haskell.

 

Lecture Schedule (In Progress)

 

Week

Day

Date

Lecture Topic and Resources

Work AssignedWork Due

1

Tu

Aug 27

Motivation and the Elements (Constants) of Racket

HTDP Part 1 (Ch 1-8)Sep 03
 ThAug 29[Canceled for Hurricane Laura] Sep 05

2

Tu

Sep 01

Conditionals, Function Definitions and Computation by Reduction

Homework 1

Review Ch 8

HTDP Part 2 (Ch 9-10)

Sep 08
3ThSep 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

4

Tu

Sep 08

Data Definitions, Data-driven Structural Recursion, and

Help Functions

Homework 2

HTDP Part 3

Sep 15
5ThSep 10Mutually Recursive DefinitionsHTDP Ch 15-17Sep 17

6

Tu

Sep 15

Generative Recursion

Homework 3

 HTDP Parts 5-6

Sep 22

7

Th

Sep 17

Accumulators and Tail Recursion

HTDP ?Sep 26

8

TuSep 19

 

Functions as Values and Anonymous FunctionsHomework 4!Oct 6

9

Th

Sep 24

Local Definitions and Lexical Scope

  

10

Tu

Sep 29

Abstracting Computational Patterns as Functions

Homework 5*

 

11

Th

Oct 01

Macros and Lazy Evaluation;Memoization; Review; Functional Design Patterns in OOP

  

12

Tu

Oct 06

Java Design Recipe: OOP as an Extension of FPHomework 6Oct

 

Th

Oct 08

Functional Java

Mid-term [Oct 09[] 

 

Tu

Oct 13

Midterm Recess (no classes)

  

13

Th

Oct 15

Core Haskell

 Homework 2

9

Tu

Oct 22

Haskell Pattern MatchingHomework 8 

 

Th

Oct 24

Haskell Exceptions and Compehensions

  

10

Tu

Oct 29

Haskell Type Classes

  

 

Th

Oct 31

 

  

11

Tu

Nov 05

Haskell Stream Processing

  

 

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