CPSC 429/529: Functional Programming

 

Instructor: Carsten Schürmann
Department of Computer Science
Yale University
Time: MWF 9:30-10:30
Room: AKW200

  Home
  Schedule
  Handouts
  Assignments
  Projects
  Links
 
  

News

Project Progress Report: Due 11/22/2003.

The old midterm. Midterm, Midterm Solutions.

Final project proposals: Due today 11/4/2002. Please send mail to me and Antony

Paper from class today: Hutton, Meijer. MonadicParserCombinators.pdf

Midterm: Friday, 11/8/2002, 9:00am, AKW200. This is a closed book exam.

Homework 5 is online.

Class cancelled Wednesday 10/23. I am sick!

Hoemwork 4 can be found on the assignment page.

Class canceled Monday 10/7/2002. Sorry for the short notice. Please send you code for the homework directly to Antony Courtney.

Homework 3 can be found on the assignment page. The new version of Homework 3 gives some hints on how to implement the type inference algorithm.

Here's the code from class.

Homework 3 can be found on the assignment page.

Homework 2 can be found on the assignment page. It is due next Monday in class.

A preliminary version of lecture notes for the first lecture are out Lecture 1. As homework 1 please solve Excercise 1.1.2. until Friday 9/13. Extra credit for students who attempt Excercise 1.3.1.

Antony Courtney (email: antony@apocalypse.org ) is the Teaching Assistant for this class. His office is 311 AKW, and his office hours are 11:00-12:00 Tuesdays and Thursdays (or by appointment).

Abstract

The objective of this course is to provide a firm foundation in the fundamental principles of programming languages in general and functional programming languages in particular. We are concerned with high-level programming principles. Students learn how to decompose and represent programming problems, how to compose the solutions into complete programs, and how to reason about the programs to ensure that they are correct.

The course is taught using the Haskell programming language and the Standard ML programming languages, both languages that support higher-order functions, exceptions, polymorphism, data abstraction, and modularity. We cover the following topics.

  • Induction and recursion, invariants.
  • Symbolic computation.
  • Data abstraction, representation invariants.
  • Higher-order functions, continuations.
  • Lazy programming techniques.
  • Monads.
  • Streams and demand-driven programming.
  • Assignment, mutable data structures.
  • Modularity, and the structure of large programs.
  • Exceptions, advanced control.
  • State encapsulation, objects.

Textbooks

We will be using two optional textbooks for the programming assignments in this class. Most of the lecture material does not appear in this textbook. Supplementary will be made available electronically.
  • Paul Hudak. The Haskell School of Expression. Cambridge University Press, 2000.
  • L.C. Paulson. ML for the Working Programmer, 2nd edition, Cambridge University Press, 1996.

Grades

Homework assignments are a critical part of the course work. A full understanding of the material in the textbooks and lectures can only be gained by applying it to solve problems.
  • Homework assignments: 40%
  • Midterm exam: 30%
  • Final project: 30%

Office Hours

My office hours are Wednesday and Friday 10:30-11:30 or by appointment.