Introduction
This course will cover the following topics:
- types and type-inference
- functors and monads
- parsing
- error handling
- concurrency
- system programming
- profiling
- functional data structures and algorithms
- ...
The course starts with a bit of theory on types,
but will mostly be practical.
Towards the end of the course, we will have
developed a fully automatic termination prover,
written in Haskell, that is able to parse the
problem files from the international termination
competition, and that performs in parallel the
search for a termination proof. For the latter,
also communication with externally running processes
is included.
Language
English
Literature
see slides
Prerequisites
basic knowledge of functional programming