• Eric Walkingshaw
• Teaching
• Advising
• Research
• Publications
• GitHub
• CV

CS 583: Advanced Functional Programming (Spring 2021)

Course Logistics

This webpage is a “living syllabus”. All information you need for the class is provided or linked here, and every effort will be made to keep that information up-to-date.

• Course Description – A brief overview of the content, goals, and philosophy of the course.

• Grading and Collaboration Policy – How grades will be computed and policy for collaboration in various aspects of the class.

• Community Statement – Every student should feel safe and welcome to contribute in this course. Please read this statement and let’s work together to make this a great environment for everyone.

• Haskell Links and Resources – How to install GHC and Haskell packages. Also includes several tutorials, freely available books, and other resources that you should use to supplement the content of this class.

• Hasklets – Describes the rationale and logistics for the small assignments we’ll use to practice concepts from the course and facilitate discussion.

• Functional Programming Project – Describes the rationale and logistics for the project that you will be working on throughout the term.

Course Content

All content for the course will be posted below. This will included required and optional readings, slides, and examples from lectures. I will often post an initial version of an example before lecture so that you can follow along more easily, then post the updated version after class.

• Course Introduction (Mar 30)

• How to FP (Mar 30–Apr 6)

  • Slides: 1.HowToFP.pdf
  • Code and examples:
    • NQueens.hs
    • Lazy.hs
    • Glob.hs
    • Hasklet1.solution.hs
  • Additional reading (optional):
    • John Hughes, Why Functional Programming Matters
    • Phil Wadler, Theorems for Free!

• Refactoring (Apr 8)

  • Slides: 2.Refactoring.pdf
  • Code and examples:
    • BinOp.1.hs
    • BinOp.2.hs
  • Additional reading (optional):
    • John Backus, Can Programming Be Liberated from the Von Neumann Style?
    • Richard Bird, Pearls of Functional Algorithm Design (free via OSU Library)

• Higher-Order Data (Apr 13–20)

  • Slides: 3.HigherOrderData.pdf
  • Code and examples:
    • BinOp.3.hs
    • BinOp.4.hs
    • MonoidDict.hs
    • SetOO.hs
    • Env.hs
    • HOAS.hs
    • Hasklet2.solution.hs
  • Additional reading (optional):
    • William Cook, On Understanding Data Abstraction, Revisited
    • Oleg Kiselyov’s web site

• Type Classes (Apr 20–22)

  • Slides: 4.TypeClasses.pdf
    • Time.hs
    • Sort.hs
    • ShapeData.hs
    • ShapeClass.hs
    • MonoidClass.hs
    • Cast.hs
    • Collection.hs
  • Additional reading (optional):
    • Phil Wadler, How to Make Ad Hoc Polymorphism Less Ad Hoc
    • Introduction to the Expression Problem

• Type Constructor Classes and Functors (Apr 27–29)

  • Slides: 5.Functors.pdf
  • Code and examples:
    • Applicative.hs
    • Hasklet3.solution.hs

• Monads (Apr 29–May 11)

  • Slides: 6.Monads.pdf
  • Code and examples:
    • Failure.hs
    • Logging.hs
    • State.hs
    • Hasklet4.solution.hs
  • Additional reading (optional):
    • Phil Wadler, Monads for Functional Programming

• Monad Transformers (May 18–20)

  • Slides: 7.MonadTransformers.pdf
  • Code and examples:
    • Password.hs
    • KitchenSink.hs
  • Additional reading (optional):
    • Sheng Liang, Paul Hudak, Mark Jones, Monad Transformers and Modular Interpreters

• Free Monads (May 20–25)

  • Code and examples:
    • FreeMonoid.hs
    • FreeMonad.hs

• Phantom Types (May 25)

  • Code and examples:
    • Sanitize.hs

• Generalized Algebraic Data Types (May 25–27)

  • Slides: 8.GADTs.pdf
  • Code and examples:
    • ExprGADT.hs
    • StackGADT.hs

• Purely Functional Data Structures (May 27–Jun 3)

  • Slides: 9.DataStructures.pdf
  • Code and examples:
    • RedBlack.hs
    • RedBlackGADT.hs
    • TreeZipper.hs
    • Queue.hs
  • Additional reading (optional):
    • Chris Okasaki, Purely Functional Data Structures

• Graph Reduction (Jun 3)

  • Slides: 10.GraphReduction.pdf
  • Additional reading (optional):
    • Graph Reduction, Haskell Wikibook
    • Laziness, Haskell Wikibook

• Bonus: Expression Problem

  • Additional reading (optional):
    • Modular Extensibility Unit from CS 589: Modularity

Deliverables

All deliverables will be posted as assignments in Canvas with direct links to the relevant pages. The table below is just a reference to make the course web page more self-contained.

All deadlines are “end of day” on the due date, that is, 11:59pm Pacific time unless otherwise noted.

Reach Out for Success

University students encounter setbacks from time to time. If you encounter difficulties and need assistance, it’s important to reach out. Consider discussing the situation with an instructor or academic advisor. Learn about resources that assist with wellness and academic success at https://oregonstate.edu/ReachOut. If you are in immediate crisis, please contact the Crisis Text Line by texting OREGON to 741-741 or call the National Suicide Prevention Lifeline at 1-800-273-TALK (8255).

Accommodations for Students with Disabilities

Accommodations for students with disabilities are determined and approved by Disability Access Services (DAS). If you, as a student, believe you are eligible for accommodations but have not obtained approval please contact DAS immediately at 541-737-4098 or at http://ds.oregonstate.edu. DAS notifies students and faculty members of approved academic accommodations and coordinates implementation of those accommodations. While not required, students and faculty members are encouraged to discuss details of the implementation of individual accommodations.