Schedule

A week-by-week breakdown of the material.

Overview

• Introduction to Haskell and Fuctional Programming (1.1-1.14)
• Compiler and interpreter (2.1-2.7)
• Basic types (3.1-3.7)
• Designing and writing programs (4.1-4.8)
• Tuples and lists (5.1-5.7)
• More programming with lists (6.1-6.8)
• Defining functions over lists (7.1-7.6)
• Input and output in Haskell (8.1-8.6)
• Patterns of computation (10.1-10.5)
• Higher-order functions (11.1-11.5)
• Developing higher-order programs (12.1-12.7)
• Overloading and type-classes (13.1-13.8)
• Algebraic types (14.1-14.6)
• Case study: Huffman codes (15.1-15.7)
• Abstract data types (16.1-16.9)
• Lazy evaluation (17.1-17.8)
• I/O programming and Monads (18.1-18.6)

Week 1

Mon

• Reading: 1.1-1.11. Optional: 1.12-1.14
• Setting up
• Introduction to Haskell and Fuctional Programming

Wed

• Reading: 2.1-2.7
• Commands for GHCi interactive mode
• Practice with GHCi

Fri

• Reading: 3.1-3.7
• Standard Haskell values and types.
• Conditionals. Guarded Expressions.
• Assignment 0. Due Wed 01/15

Week 2

Mon

• Reading: 4.1-4.3, 4.8, 5.1-5.3
• Compound Types
• Type Aliases and Custom Types.

Wed

• Reading: 5.4-5.7
• Working with the GHC compiler and interpreter. Lists.
• List Comprehensions.
• Assignment 1. Due Mon 01/20

Fri

• Catchup/Practice

Week 3

Mon

• List comprehension practice: Book Library

Wed

• Reading: 6.1-6.3, 6.7
• Parametric polymorphism
• The supermarket billing example
• Assignment 2. Due Wed 1/29

Fri

• Reading: 7.1-7.4
• Pattern Matching.

Week 4

Mon

• Reading: 7.5-7.6
• More practice with Pattern Matching.

Wed

• Reading: 8.2-8.5
• Interactive Programming

Fri

• Practice with Interactive Programming
• Assignment 3. Due Fri 2/7

Week 5

Mon

• Reading: 10.1-10.2
• Higher-order functions

Wed

• Reading: 10.3-10.5
• Folding

Fri

• Reading: 11.2-11.3
• Types of recursion
• Anonymous Functions. Sections.

Week 6

Mon

• Reading: 11.1, 11.4
• Currying and partial application
• Function Composition

Wed

• Higher order functions practice: 12.5
• Assignment 4. Due Fri 3/6

Fri

• Random number generation in Haskell

Week 7

Mon

Sick day

Wed

• Shuffling a list

Fri

Midterm 1

Week 8

Mon

• Reading: 13.1-13.4
• Ad-hoc Polymorphism: Overloaded Types and Type Classes

Wed

• Reading: 13.5-13.8
• Defining type classes and type class instances

Fri

• The Maybe (Option) Type.

Week 9

Mon

• Reading: 14.1-14.4
• Recursive Types: Implementing Binary Search Trees

Wed

• Information hiding and abstraction with modules

Fri

• Expressing State in Haskell

Week 10

Mon

• Expressing State in Haskell (cont)

Wed

• Type classes over parametrized types: Foldables, Functors, Applicatives, Monads

Fri

• State Monad Revisited

Week 11

Mon

TBD

Wed

TBD

Fri

TBD

Week 12

Mon

TBD

Wed

TBD

Fri

TBD

Week 13

Mon

TBD

Wed

TBD

Fri

Final study guide

• Folding trees

Old links

• Functions as Values: Difference Lists, Composition (7.5)
• Testing
• Final Study Guide
• Version Control
• Overview of Software Development Practices