Versions Compared

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)

  times

Instructor

Dr. Eric Allen

Dr. Corky Cartwright

Graduate TAs
  • Arghya "Ronnie" Chatterjee
  • 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 Email comp311_staff@rice.eduOnline Discussionhttps://piazza.com/class/ibslot8j6un5p6

...

 

Description

This class provides an introduction to concepts, principles, and approaches of functional programming. Functional programming is a style of programming where 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 and computer science. It has become increasingly popular in recent years because it offers important advantages in designing, maintaining, and reasoning about programs in many modern contexts such as web services, multicore programming, and cluster 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, 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 Commons

General Information

 

Lectures
Tuesdays and Thursdays 2:30PM-3:45PM
Grading
Coursework will consist of a series of small weekly programming assignments in Scala
Office HoursDr. Eric Allen: Tuesdays 4PM-5PM DH 2161
SyllabusCourse Syllabus 
Homework SubmissionsSubmission Guide
Textbooks
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 Recursion

25Thurs 27  3Hwk 0 8Thurs 10 15Referential Transparency and the Substitution ModelThurs 17Tail RecursionHwk 1 22 24 29Programming with Options and Pattern Matching Hwk 3 6 8 13Thurs 15Contracts and Data IntegrityHwk 4 20Functional Leftist Heaps and Binomial HeapsThurs 22 27Strictness and Lazy EvaluationThurs 29Stream Processing and Incremental I/OHwk 6 3  5 10Domain-Specific Languages with Higher Order FunctionsThurs 12Parallelism and Functional ProgrammingHwk 8 17Thurs 19   24Guest Lecture (TBA)Thurs 26 Thurs 3

Week

Day

Date

Topic

SlidesWork AssignedWork Due

1

Tues

Aug

23

Overview and , Motivation

  
  ThurAug 25What are Types, Core ScalaHwk 0Course Tools and Setup   

2

Tues

Sep 1

Introduction to Scala

Aug 30

Doubles, Programming with Intention, The Design Recipe

  
 ThursSep

Programming with Intention

 01Functions on Ranges, Point Values, Compound Datatypes 

3

Tues

Sep

06

Methods, Grading, DrScalaTest-Driven Development

  
  ThurSep 08Abstract Datatypes

Defining and Using Functions and Recursion

 Hwk 1Hwk 0

4

Tues

Sep

13

Subtyping of Arrow Types, Exceptions

  

 

 

Thur

Sep

15

Abstract Datatypes 2, Recursively Defined Types

 Hwk 2 

5

Tues

Sep

20

Recursively Defined Types 2, Functions as ValuesLists and Functional Data Structures

  

 

 

Thurs

Sep

22

Higher-Order Functions

Hwk 2Hwk 1

Types, Type Systems, and Polymorphic Functions

 Hwk 3Hwk 2

6

Tues

Sep

27

Functions as Values, Parametric Types

  

 

Thur

Thurs

Oct 1

Map, Reduce, and Higher Order Functions

 Hwk 4

Sep 29

Currying, Fold, Flatmap, and For Expressions

  

7

Tues

Oct

04

For Expressions, Monads, The Environment Model

Comprehensions and flatMap

   

 

Thurs

Oct

06

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

Hwk 3Hwk 2

Programs as Proofs and the Curry-Howard Isomorphism

   

8

Tues

Oct

11

MIDTERM RECESS

  

 

 

Thur

Oct

13

Scala Collections Classes, Traits

 Hwk 5 

9

Tues

Oct

18

Call-by-Name, Type Environments, Generative Recursion 

 

 

 

Thur

Oct

20

Strategies for Generative Recursion

Hwk 4Hwk 3

Functional Red-Black Trees

 Hwk 6Hwk 5

10

Tues

Oct

25

Accumulators

  

 

 

Thur

Oct

27

Functional Data Structures

 Hwk 7 

11

Tues

Nov

01

ClosuresStreams, Effects, and the Environment ModelState, Mutation 

  

 

Thur

Thurs

Nov

03

Mechanical Proof Checkin, The Curry-Howard Isomorphism

Hwk 5Hwk 4

Programming with Continuations

 Hwk 8Hwk 7

12

Tues

Nov

08

The State Monad

  

 

 

Thur

Nov

10

Additional Scala Features, Extractors, Parser Combinators

 Hwk 9 

13

Tues

Nov

15

More Parser Combinators, Actors and Concurrency Big Data and Distributed Computing with Apache Spark

  

 

 

Thur

Nov

17

Tactical Theorem Proving

DataFrames and Spark SQL

Hwk 106Hwk 95
14TuesNov 22Project Fortress  

 

 

Thur

Nov

24

THANKSGIVING

  

15

Tues

Dec 1

Nov 28

Functional Distributed ComputingPipelines and SparkML (Machine Learning)

  
  ThurDec 01Course 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 at http://honor.rice.edu/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