Versions Compared

Old Version 85

changes.mady.by.user Eric Allen

Saved on

compared with

New Version Current

changes.mady.by.user Ronnie Chatterjee

Saved on

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

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
  • Arghya "Ronnie" ChatterjeeYue Wang
  • Lechen Yu
Co-Instructor

Dr. Sağnak Taşırlar

Undergraduate TAs
  • Chris Brown
  • Cannon Lewis
  • Jake Nyquist

Lectures

GRB W212DCH 1075

Lecture Times

28:30PM 00AM - 39:45PM 15AM TR

Course Emailcomp311@ricecomp311_staff@rice.eduOnline DiscussionPiazza -- Rice Comp 311

 

Description

This class provides an introduction to concepts, principles, and approaches of functional programming. Functional programming is a style of programming in which the key means of computation is the application 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, multicore programming, and distributed computing. Course work consists of a series of programming assignments in the Scala programming language and various extensions.

Grading, Honor Code Policy, Processes, and Procedures
 

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.

 
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
EricBy Appointment--
Corky

Wednesday

Tuesday

4PM - 5PMDH 2062
RonnieFriday 1:30PM - 2:30PMDH 3002

, Thursday

2pm-4pm

9:15am-10:30am

DCH 3110

DCH 3104

SagnakThursday9:15am - 11:15amDCH 2062
LechenWednesday1pm - 2pmDCH 2069
ChrisTuesday1pm - 3pmDuncan Commons
CannonMonday3pm - 5pmJones Commons
JakeWednesday1:55pm - 3:55pmWill Rice CommonsYueThursday4PM - 5PMDH 3113
Textbooks
There is no required textbook. We will follow the pedagogic approach of "How to Design Programs" but in a typed context. We will also draw material from a variety of sources, including:
Online Videos
Development Environment

 

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

Thur 27The Nature of 2Tues 01Type Checking, Conditional FunctionsThurs 03, Tests, Binary Methods, OperatorsHwk 1 10Exceptions, OverloadingHwk 14 15 DatatypesThur 17FirstClass  5 22, CovarianceThurs 24Checking Variance, For-6Sep 29Translating -  01Lexical vs Dynamic Scoping, Call-by-Name, Traits 17 06Traits 2, Generative RecursionThurs 08More Generative Recursion8 13MIDTERM RECESS 15Functional Red-Black Trees9 20Tail Recursion and 22Stream Processing10Guest Lecture: Shams ImamVariable Assignment and Environments11 03Mutable Objects, Equality, Memoization 05Programs as Proofs and the Curry Howard Isomorphism 10 12Actors and Concurrency13 17Distributed Computing with Apache Spark 19Nov

Week

Day

Date

Topic

Work AssignedWork Due

1

Tues

Aug 2523

Overview, Motivation

  
 ThurAug 25What are Types, Core Scala Hwk 0  

2

Tues

Aug

30

Doubles, Programming with Intention, The Design Recipe

  
 ThursSep 01Functions on Ranges, Point Values, Compound Datatypes  

3

 

Tues

Sep

06

Methods, Grading, DrScala

  
3 TuesThurSep 08Abstract DatatypesHwk 1

4

Tues

Sep 13

Subtyping of Arrow Types, Exceptions

  

 

Thur

Sep

15

Abstract Datatypes 2, Recursively Defined Types

  

5

Tues

Sep

20

Recursively Defined

Types 2, Functions as Values

  

 

Thurs

Sep

22

Higher-

Order Functions

Hwk 2Hwk 1

6

Tues

Sep

27

Functions as Values, Parametric Types

  

 

Thur

Sep

29

Currying, Fold, Flatmap, and For Expressions

  

7

Tues

Oct 04

For Expressions, Monads, The Environment Model 

 

Thurs

Thur

Oct

06

"Growing a Language," Guy L. Steele, Jr.

Hwk 3Hwk 2

8

Tues

Oct

11

MIDTERM RECESS

  

 

Thur

Oct

13

Scala Collections Classes, Traits

  

9

Tues

Oct

18

Call-by-Name, Type Environments, Generative Recursion 

 

 

Thur

Oct

20

Strategies for Generative Recursion

Hwk 4Hwk 3

10

Tues

Oct

25

Accumulators

  

 

Thur

Oct

27

Functional Data Structures

  

11

Tues

Oct 27

Nov 01

Streams, State, Mutation 

  

 

Thur

Oct 29

Nov 03

Mechanical Proof Checkin, The Curry-Howard Isomorphism

Hwk 5Hwk 4

12

Tues

Nov

08

The State Monad

  

 

Thur

Nov

10

Additional Scala Features, Extractors, Parser Combinators

  12

13

Tues

Nov

15

More Parser Combinators, Actors and Concurrency

  

 

Thur

Nov

17

Tactical Theorem Proving

Hwk 6Hwk 5
14TuesNov 22Project Fortress  

 

Thur

Nov

Distributed Machine Learning

  14Tues

24

Guest Lecture (TBA)  

 

Thur

Nov 26

THANKSGIVING

  

15

Tues

Dec 01

Nov 28

Functional Distributed ComputingPipelines and SparkML

  
 ThurDec 0301Course Wrap Up Hwk 6