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 16 Next »

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

Instructors

Dr. Nick Vrvilo (2σ)

Dr. Corky Cartwright

TA

Ryuichi Sai

ryuichi@rice.edu

Lectures

Duncan Hall 1075

Lecture Times

4pm–5:15pm TR

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 Ley Student Center and the Rice Disability Support Services.


General Information

 

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

Tuesday, Wednesday

Thursday

8:30-10:30am

1:30-3:00pm

DCH 3104

DCH 3104

Teaching Assistants
Ryuichi

Monday

Wednesday

11:30am-noon

After 5pm by appointment only

DCH 3113

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

Week

Day

Date

Lecture Topic and Resources

Work AssignedWork Due

1

Tu

Aug 27

Overview, Motivation

  
 ThAug 29Computation by Reduction, Types, Core ScalaHomework 0 

2

Tu

Sep 03

Ints, Doubles, Error Conditions, Programming with Intention

  
 ThSep 05The Design Recipe
BeakerX Notebook: Source, PDF
  

3

Tu

Sep 10

Conditionals, Functions on Ranges & Point Values, Compound Data
BeakerX Notebook A: Source, PDF
BeakerX Notebook B: Source, PDF

  
 ThSep 12Methods, Objects, Grading* Homework 0

4

Tu

Sep 17

Abstract Datatypes*

Homework 1 

 

Th

Sep 19

Abstract Datatypes (cont.), Recursively Defined Types*

  

5

Tu

Sep 24

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

  

 

Th

Sep 26

1st-Class Functions, Imports*

  

6

Tu

Oct 01

Variable Arity, Named Arguments, Exceptions, Format Strings*

Homework 2Homework 1

 

Th

Oct 03

Exceptions, String Formatting, Generic Types*

  

7

Tu

Oct 08

Type Hierarchy, Variance, Generic Map Function*  

 

Th

Oct 10

Fold, Zip, Flatten, For Expressions*

  

8

Tu

Oct 15

Midterm Recess (no classes)

  

 

Th

Oct 17

Operators*

Homework 3Homework 2

9

Tu

Oct 22

Accumulators*  

 

Th

Oct 24

Call-by-Name/Value, Scala Immutable Collections*

  

10

Tu

Oct 29

Growing a Language, by Guy L. Steele, Jr.*
Midterm Exam**

  

 

Th

Oct 31

Call by Name, Traits, Mixins*

  

11

Tu

Nov 05

Scala Parser Combinators*

  

 

Th

Nov 07

Streams*

Homework 4Homework 3

12

Tu

Nov 12

Monads, For-expression desugaring*

  

 

Th

Nov 14

...

  

13

Tu

Nov 19

Additional Scala Features*

  

 

Th

Nov 21

Semantics of Exceptions*

Homework 5Homework 4
14TuNov 26Videos: What to Leave Implicit and Impromptu*  

 

Th

Nov 28

Thanksgiving Holiday (no classes)

  

15

Tu

Dec 03

State Monad*

  
 ThDec 05Course Wrap-up Homework 5
16TuDec 10Study Day (no classes)  

 

??

Dec ??

Final Exam**

  

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

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

  • No labels