Category Theory for Programmers

Categorical structures occur in programming languages on different levels: (1) within programming languages, providing design principles and guidance on how to write modular and correct-by-design programmes (as demonstrated in the practical programming language Haskell) and (2) in the design and study of programming languages, as a guiding meta-theory. In particular, category theory provides a mathematical justification for recursion schemes for inductive datatypes. This course aims to provide solid foundations on both (1) and (2).

The final grade of the course consists of the following components:

• Individual project (weighting 100%)

Final grade calculation: 1 * Individual project

A passing final grade for this course is obtained when the final grade for the project is at least a 5.8.

Resit/ Repair opportunities:

In case of an insufficient final result, repair opportunities may be offered in accordance with TER Implementation Regulations Art 5, sub 5., for:

• Individual project: re-submit deliverable