...
Week | Day | Date | Topic | Work Assigned | Work Due |
|---|---|---|---|---|---|
1 | Tues | Aug 23 | |||
| Thur | Aug 25 | What are Types, Core Scala | Hwk 0 | ||
2 | Tues | Aug 30 | Type Checking, Conditional Functions, Compound DatatypesDoubles, Programming with Intention, The Design Recipe | ||
| Thurs | Sep 01 | Grading, DrScala, Tests, Binary Methods, Operators | Hwk 1 | Hwk 0 | |
3 | Tues | Sep 06 | Abstract Datatypes, Exceptions | ||
| Thur | Sep 08 | Exceptions, Overloading | |||
4 | Tues | Sep 13 | Recursively Defined Datatypes | ||
| Thur | Sep 15 | First-Class Functions | Hwk 2 | Hwk 1 |
5 | Tues | Sep 20 | Functions as Values, Parametric Types, Covariance | ||
| Thurs | Sep 22 | Checking Variance, For-Expressions | ||
6 | Tues | Sep 27 | Translating For-Expressions, The Environment Model | ||
| Thur | Sep 29 | Lexical vs Dynamic Scoping, Call-by-Name, Traits 1 | Hwk 3 | Hwk 2 |
7 | Tues | Oct 04 | Traits 2, Generative Recursion | ||
| Thurs | Oct 06 | More Generative Recursion, Accumulators | ||
8 | Tues | Oct 11 | MIDTERM RECESS | ||
| Thur | Oct 13 | More Accumulators, Tail Recursion | Hwk 4 | Hwk 3 |
9 | Tues | Oct 18 | Leftist Heaps, Functional Red-Black Trees | ||
| Thur | Oct 20 | Red Black-Trees Continued, Stream Processing | ||
10 | Tues | Oct 25 | Guest Lecture: TBD | ||
| Thur | Oct 27 | Variable Assignment and Environments | ||
11 | Tues | Nov 01 | Mutable Objects, Equality, Memoization | ||
| Thur | Nov 03 | The State Monad, Mechanical Proof Checking | Hwk 5 | Hwk 4 |
12 | Tues | Nov 08 | Programs as Proofs and the Curry Howard Isomorphism | ||
| Thur | Nov 10 | Additional Scala Features, Extractors, Parser Combinators | ||
13 | Tues | Nov 15 | More Parser Combinators, Actors and Concurrency | ||
| Thur | Nov 17 | Tactical Theorem Proving | Hwk 6 | Hwk 5 |
| 14 | Tues | Nov 22 | Guest Lecture: TBD | ||
| Thur | Nov 24 | THANKSGIVING | ||
15 | Tues | Nov 28 | Functional Distributed Computing | ||
| Thur | Dec 01 | Course Wrap Up | Hwk 6 |