|COMS W4995 003
Parallel Functional Programming
Class meets Mondays, Wednesdays 5:40 - 6:55 PM in 417 Mathematics.
|Prof. Stephen A. Edwardsemail@example.com||By appt.||462 CSB|
|John Huifirstname.lastname@example.org||2-4 Mondays||TA Room, 1st Floor Mudd|
|Amanda Liuemail@example.com||2-4 Tuesdays||TA Room, 1st Floor Mudd|
|Pierre Tholoniatfirstname.lastname@example.org||10-12 Wednesdays||TA Room, 1st Floor Mudd|
Prerequisites: COMS 3157 Advanced Programming or the equivalent. Knowledge of at least one programming language and related development tools/environments required. Functional programming experience not required.
Functional programming in Haskell, with an emphasis on parallel programs.
The goal of this class is to introduce you to the functional programming paradigm. You will learn to code in Haskell; this experience will also prepare you to code in other functional languages. The first half the the class will cover basic (single-threaded) functional programming; the second half will cover how to code parallel programs in a functional setting.
|Wed Sep 4||Introduction
|Mon Sep 9||Types and Typeclasses
|Wed Sep 11||Basic Function Definitions
|Mon Sep 16|
|Wed Sep 18||Recursion and Higher Order Functions
|Mon Sep 23|
|Wed Sep 25||Using and Defining Modules
||Homework 1 .hs file|
|Mon Sep 30|
|Wed Oct 2||User-Defined Types
|Mon Oct 7|
|Wed Oct 9||I/O
|Fri Oct 11||(no lecture; turn in homework)
||Homework 2 .hs file|
|Mon Oct 14||(No lecture)
|Wed Oct 16||(No lecture)
|Mon Oct 21|
|Wed Oct 23||Functors
|Fri Oct 25||(no lecture; turn in homework)
||Homework 3 .zip file|
|Mon Oct 28|
|Wed Oct 30||Monads
|Mon Nov 4||Election Day Holiday|
|Wed Nov 6|
|Mon Nov 11|
|Wed Nov 13||Lazy and Parallel Evaluation
|Mon Nov 18|
|Wed Nov 20||Strategies
|Fri Nov 22||(no lecture; turn in homework)
||Homework 4 .zip file Project Proposal|
|Mon Nov 25||MVars
|Wed Nov 27||Thanksgiving Holiday|
|Mon Dec 2|
|Wed Dec 4||Software Transactional Memory
|Mon Dec 9|
The project should be a parallel implementation of some algorithm/technique in Haskell. Marlow parallelizes a Sudoku solver and a K-means clustering algorithm in his book; these are baseline projects. I am looking for something more sophisticated than these, but not dramatically more complicated.
Do the project alone or in pairs. List all your names and UNIs in the proposal and final report
There are three deliverables:
Strive for a little well-written, well-tested program that handles everything gracefully rather than a large, feature-filled system. If you're short on time, drop a feature in preference to improving the code you have.
Other project ideas include any sort of map/reduce application, graphics rendering, physical simulation (e.g., particles), parallel grep or word count, a Boolean satisfiability solver, or your favorite NP-complete problem. If your program is algorithmically simple (e.g., word count or word frequency count), it need to scale to huge inputs. AI (as opposed to machine learning) applications, such as game playing algorithms, are generally a good idea. Algorithms that have a lot of matrix multiplication at their core (e.g., deep learning) are less suitable.
Feel free to ask the instructor or TAs for project advice or criticism