• to develop large Haskell programs, using a wide range of Haskell tools and libraries;
• to understand the theoretical underpinnings of FP, including topics such as lambda calculus, type systems, combinatory logic, Church encodings, etc.
• to design types carefully, guaranteeing certain invariants, and develop type-level programs to compute new types or derive new programs from type definitions
• to prove properties of programs using equational reasoning, and formalize these proofs in an interactive proof assistant such as Agda or Coq;
• to understand different evaluation strategies, and in particular, lazy evaluation and its impact on performance;
• to apply common design patterns and structures used in functional languages, such as monoids, functors, monads, applicative functors, etcetera.

Assessment
Your final mark for this course will consist of:

• marks for the assignments (20%)
• overall score for the large programming task (20%)
• written examination (50%)
• participation in discussion/joint reading (10%)

Assignments will consist of theoretical questions about the material covered in lecturers and of related programming assignments. All participants are expected to complete the assignments and hand in a solution to the practical assignment

The participants have to perform a (larger) programming task in a team of 2-4 students. The programming assignment will be explained in the beginning of the course. At the end a presentation has to be given about the project, and a short paper has to be written about the project.

The final exam is based on the topics of the lectures and assignments.

The weighted average of the grades should be at least 5.5, but none of the grades may be smaller than 4.0.

Not performing a certain task, such as not handing in an assignment, counts as 0.

The repair test requires at least a 4 for the original test.