Versions Compared

Old Version 2

changes.mady.by.user Nick Vrvilo

Saved on

compared with

New Version Current

changes.mady.by.user Nick Vrvilo

Saved on

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: add final exam room

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

—

Instructors

Dr. Nick Vrvilo (2σ)

Dr. Corky Cartwright

Graduate TAsTA
—
Undergraduate TAs

Ryuichi Sai

ryuichi@rice.edu

Lectures

Duncan Hall 1075

Lecture Times

4pm–5:15pm TR

Course Instructor Email{nick.vrvilo,cork}@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. 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 the Ley Student Center and and the Rice Disability Support Services.


General Information

 

Course Syllabus
Homework Submission Guide
Office Hours
Instructors
NickTuesday, ThursdayAvailable after class——
CorkyWednesday

Tuesday, Thursday

2pm–4pmWednesday

98:15am–1030am–10:30am

1:00pm–3:00pm

DCH 3104DCH 3110

DCH 3104

Teaching Assistants
Ryuichi

Monday

Tuesday, Thursday

11am-noon

noon-1pm

DCH 3109

TAs———

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

 

...

Doubles, *4Tu 12, DrScala* 5Tu 19 2*6Tu 26, Variable & Named Args*

Week

Day

Date

Topic

Work AssignedWork Due

1

Tu

Aug 2221

Overview, Motivation*

  
 ThAug 24What are Types, Core Scala*23Computation by Reduction, TypesHomework Hwk 0 

2

Tu

Aug 29—*28

Core Scala, Doubles, Error Conditions

  
 ThAug 31—*  

3

Tu

Sep 05

30Programming with Intention, The Design Recipe  
 

3

ThTu

Sep

07

04

Conditionals, Functions on Ranges

,

& Point Values, Compound

Datatypes*

Data

  
 ThSep 06Methods, Objects, Grading Homework 0

 4

ThTu

Sep 1411

Static Type Checking, Abstract Datatypes* & DrScala

Hwk Homework 1 

 

Th

Sep

13

Abstract Datatypes

(cont.), Recursively Defined Types

  

 5

ThTu

Sep 2118

Recursively Defined Types 2(cont.), Functions as Values*

  

 

Th

Sep

20

1st-Class Functions, Imports

  

6

Tu

Sep 25

Variable Arity, Named Arguments, Exceptions, Format Strings

Homework 2Homework 1  

 

Th

Sep 2827

Exceptions, String Formatting, Generic Types*

Hwk 2 Hwk 1 

7

Tu

Oct 0302

Type Hierarchy, Variance, Generic Map FunctionCovariance and Contravariance, ...*  

 

Th

Oct 0504

Fold, Zip, Flatten, For Expressions... Currying, Fold, Flatmap, and For Expressions*

  

8

Tu

Oct 10MIDTERM RECESS*09

Midterm Recess (no classes)

  

 

Th

Oct 12

Type Hierarchy, Overrides, Exceptions, Operators*

Hwk 3

11

Operators

Homework 3Homework Hwk 2

9

Tu

Oct 1716

Accumulators For Expressions, Monads, The Environment Model* 

 

Th

Oct 1918

Call-by-Name/Value, Scala Immutable CollectionsScala Collections Classes, Traits*

  

10

Tu

Oct 24Generative Recursion*23

Growing a Language, by Guy L. Steele, Jr.
Midterm Exam: 7–10pm in DH1075

  

 

Th

Oct 26

Strategies for Generative Recursion*

Hwk 4

25

Call by Name, Traits, Mixins

  Hwk 3

11

Tu

Oct 3130

Scala Parser CombinatorsAccumulators*

  

 

Th

Nov 02

Functional Data Structures*

 

01

Streams

Homework 4Homework 3 

12

Tu

Nov 0706

Streams, State, Mutation*Monads, For-expression desugaring

  

 

Th

Nov 09

Mechanical Proof Checkin, The Curry-Howard Isomorphism*

Hwk 5

08

...

  Hwk 4

13

Tu

Nov 1413

Additional Scala FeaturesThe State Monad*

  

 

Th

Nov 16

Additional Scala Features, Extractors, Parser Combinators*

Hwk 5

15

Semantics of Exceptions

Homework 5Homework 4 
14TuNov 21More Parser Combinators, Actors and Concurrency*20Videos: What to Leave Implicit and Impromptu Hwk 6 (Optional) 

 

Th

Nov 23THANKSGIVING*22

Thanksgiving Holiday (no classes)

  

15

Tu

Nov 2827

State MonadFunctional Distributed Computing*

  
 ThNov 3029Course Wrap-upVideos: What to Leave Implicit and Impromptu* Hwk Homework 5 & 6
16TuDec 0504Study Days Day (no classes)*  

 

?F

Dec 07???

Final Exam: 2–5pm in Duncan Hall 1075

  

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

** The place and time of the final exam is set by the registrar. The current scheduling details are available on the registrar's page for this course.