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

Compare with Current View Page History

« Previous Version 31 Next »

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

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, Thursday

Wednesday

8:30am–10:30am

1:00pm3:00pm

DCH 3104

DCH 3104

Teaching Assistants
Ryuichi

Monday

Tuesday, Thursday

11am-noon

noon-1pm

DCH 3109

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

Topic

Work AssignedWork Due

1

Tu

Aug 21

Overview, Motivation

  
 ThAug 23Computation by Reduction, TypesHomework 0 

2

Tu

Aug 28

Core Scala, Doubles, Error Conditions

  
 ThAug 30Programming with Intention, The Design Recipe  

3

Tu

Sep 04

Conditionals, Functions on Ranges & Point Values, Compound Data

  
 ThSep 06Methods, Objects, Grading Homework 0

4

Tu

Sep 11

Abstract Datatypes & DrScala

Homework 1 

 

Th

Sep 13

Abstract Datatypes (cont.), Recursively Defined Types

  

5

Tu

Sep 18

Recursively Defined Types (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 27

Exceptions, String Formatting, Generic Types*

  

7

Tu

Oct 02

Co- and Contra-variance, Currying, Fold, Flatmap*  

 

Th

Oct 04

Type Hierarchy, Overrides, Exceptions, Operators*

  

8

Tu

Oct 09

Midterm Recess (no classes)

  

 

Th

Oct 11

For Expressions, Monads, The Environment Model*

Homework 3Homework 2

9

Tu

Oct 16

Scala Collections Classes, Traits*  

 

Th

Oct 18

Generative Recursion*

  

10

Tu

Oct 23

Tentative:  Midterm Exam

  

 

Th

Oct 25

Strategies for Generative Recursion*

  

11

Tu

Oct 30

Accumulators*

Homework 4Homework 3

 

Th

Nov 01

Functional Data Structures*

  

12

Tu

Nov 06

Streams, State, Mutation*

  

 

Th

Nov 08

Mechanical Proof Checking, The Curry-Howard Isomorphism*

  

13

Tu

Nov 13

The State Monad*

Homework 5Homework 4

 

Th

Nov 15

Additional Scala Features, Extractors, Parser Combinators*

  
14TuNov 20More Parser Combinators, Actors and Concurrency*  

 

Th

Nov 22

Thanksgiving Holiday (no classes)

  

15

Tu

Nov 27

Functional Distributed Computing*

  
 ThNov 29Videos: What to Leave Implicit and Impromptu* Homework 5
16TuDec 04Study Day (no classes)  

 

?

???

Final Exam (awaiting date from registrar's office)

  

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

  • No labels