Skip to end of metadata
Go to start of metadata

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

Compare with Current View Page History

« Previous Version 8 Next »

COMP 311: Functional Programming (Fall 2017)

Instructors

Dr. Nick Vrvilo (2σ)

Dr. Corky Cartwright

Graduate TAs
  • Yao-Hsiang Yang
  • Weixi Zhu
Undergraduate TAs
  • Nate Kim

Lectures

MEL 251 (Mechanical Laboratories)

Lecture Times

4pm–5:15pm TR

Course Email?Online 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 .


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

Week

Day

Date

Topic

Work AssignedWork Due

1

Tu

Aug 22

Overview, Motivation

  
 ThAug 24What are Types, Core ScalaHwk 0 

2

Tu

Aug 29

Doubles, Programming with Intention, The Design Recipe

  
 ThursAug 31Functions on Ranges, Point Values, Compound Datatypes 

3

Tu

Sep 05

Methods, Grading, DrScala

  
 ThurSep 07Abstract Datatypes*Hwk 1

4

Tu

Sep 12

Subtyping of Arrow Types, Exceptions*

  

 

Th

Sep 14

Abstract Datatypes 2, Recursively Defined Types*

  

5

Tu

Sep 19

Recursively Defined Types 2, Functions as Values*

  

 

Th

Sep 21

Higher-Order Functions*

Hwk 2Hwk 1

6

Tu

Sep 26

Functions as Values, Parametric Types*

  

 

Th

Sep 28

Currying, Fold, Flatmap, and For Expressions*

  

7

Tu

Oct 04

For Expressions, Monads, The Environment Model* 

 

Th

Oct 06

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

Hwk 3Hwk 2

8

Tu

Oct 11

MIDTERM RECESS

  

 

Th

Oct 13

Scala Collections Classes, Traits*

  

9

Tu

Oct 18

Call-by-Name, Type Environments, Generative Recursion* 

 

Th

Oct 20

Strategies for Generative Recursion*

Hwk 4Hwk 3

10

Tu

Oct 25

Accumulators*

  

 

Th

Oct 27

Functional Data Structures*

  

11

Tu

Nov 01

Streams, State, Mutation*

  

 

Th

Nov 03

Mechanical Proof Checkin, The Curry-Howard Isomorphism*

Hwk 5Hwk 4

12

Tu

Nov 08

The State Monad*

  

 

Th

Nov 10

Additional Scala Features, Extractors, Parser Combinators*

  

13

Tu

Nov 15

More Parser Combinators, Actors and Concurrency*

  

 

Th

Nov 17

Tactical Theorem Proving*

Hwk 6Hwk 5
14TuesNov 22Project Fortress*  

 

Th

Nov 24

THANKSGIVING

  

15

Tu

Nov 28

Functional Distributed Computing*

  
 ThurDec 01Course Wrap Up Hwk 6

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

  • No labels