Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

Instructor

Robert "Corky" Cartwright



Lectures

DCH 10641075

Lecture Times

9:25 am–10:40 am TuTh

Instructor Emailcork@rice.eduOnline DiscussionPiazza – Rice Comp 311

...

Office Hours


Instructor




Corky Cartwright

TuTh


3pm-4pm

By appointment

DCH 3104

TBA

Teaching Assistants

Eric Breyer

TBA

TBA

TBA


Textbooks and articles

There is no required textbook. We will follow the pedagogic approach of "How to Design Programs, First Edition" and extend it to other languages. The Second Edition of this book is the default at the website www.htdp.org but this web page contains a link to the first edition (at URL: https://htdp.org/2003-09-26/) at the bottom of the page.  The two editions are very similar but this course tracks the first edition. 

We will draw material from a variety of sources, focusing on the following:

Primary References:

Additional References:

Recommended Videos
Development Environments
  • DrRacket is recommended for all Racket homework assignments in this course. The interface is "textually transparent" as we will show in class.
  • DrJava is the supported IDE for Java in this course; it supports essentially the same textually transparent interface for Java that DrRacket does for Racket.  You are also welcome to use a "professional" IDE such as IntelliJ or Eclipse, which have important features (particularly with regard to program refactoring) that DrJava lacks.  On the other hand, DrJava is simpler and sufficient for the assignments in this class.
  • For students who want to explore Scala, a putative successor to Java that directly supports functional programming, there are multiple online IDEs and interpreters available.

...

Lecture Schedule (In Progress)


1

Tu

Aug

22

27

Motivation and the Elements (Constants) of Racket

Skim HTDP First Edition, Part 1 (
Ch
Sections 1-8), Part 2 (
Ch
Sections 9-10, 13)

ThAug
24
29Conditionals, Function Definitions, and Computation by Reduction

2

Tu
Aug 29

Sep 03

Conditionals, Function Definitions, and Computation by Reduction

Homework 1

Review Ch 8

HTDP Part 2 (Ch 9-10)

Sep
04
09
3Th
Aug 31
Sep 05

The Program Design Recipe for Racket, which focuses on using

recursion to process lists and natural numbers

Preface, 9.4

HTDP Part 2 (Ch 11-13)


4

Tu

Sep

05

10

Data Definitions, Data-driven Structural Recursion,

Homework 2

HTDP Part 3

Sep 11
5ThSep
07
12Mutually Recursive Definitions and Help FunctionsHTDP Ch 15-17

6

Tu

Sep

12

17

Local Definitions and Lexical Scope

Homework 3

HTDP Parts 5-6

Sep
18
23

7

Th

Sep

14

19

Lambda the Ultimate and Reduction Semantics

LawsOfEvaluation
Laws Of Evaluation

8

TuSep
19
24Functional Abstraction and Polymorphism

9

Th

Sep

21

26

Functions as Values

Homework 4
Sep 28
Oct 02

10

Tu
Sep 26

Oct 01

Generative (Non-structural) Recursion


Homework 5 (long)*Oct
11
16

11

Th
Sep 28

Oct 03

Lazy Evaluation and Non-strict Constructors



12

Tu

Oct

03

08

Techniques for Implementing Lazy Evaluation



13

Th

Oct

05

10

A Glimpse at Imperative Racket and Memoization

Sample Exam


Tu

Oct

10

15

Fall Recess

Sample Exam Key


14

Th

Oct

12

17

On to Java!

Midterm (Through Lecture 13 and HW 5) 7-10 pm

Homework 6

OO Design Notes

 

Oct 23

14

Tu

Oct 17

Adapting the HTDP Design Recipe to Java




15

Th

Oct 19

Higher-order Functional Programming in Java

Homework 7Oct 26

16

Tu

Oct 24

Four Key Idioms for Encoding FP in Java



17

Th

Oct 26

The Singleton and Visitor Patterns

Homework 8Nov 1

18

Tu

Oct 31

Java Generics and Their Role in FP in Java



19

Th

Nov 02

Reasoning About Functional Programs

Homework 9*Nov 8

20

Tu

Nov 07

First-order Programming Logic (an analog of ACL2 [UT Austin])



21

Th

Nov 09

Theorem Proving Strategies

Homework 10
Nov 15

22

Tu

Nov 14

Hoare Logic



23

Th

Nov 16

imperative Loop Invariants vs. Contracts for Help Functions


Homework 11Nov 27
24TuNov 21Reasoning About Procedure Calls

25TuNov 28Hoare Logic Applied to OO Code

26ThNov 30The Future of FP and Programming Logic

*Assignments marked with * are double assignments that count twice as much as regular assignments.

...