This course teaches you to how to solve (programming) problems in a functional way. This includes:
- Writing programs in a functional style;
- Choosing and developing suitable data structures (data types and operations) for given problems, such as primitive types (Integer, Bool, …), predefined (recursive) lists (including list comprehensions, and generic list operations), trees, etc.
- Using and deploying FP concepts, like higher-order functions, polymorphism and classes.
- Applying predefined programming schemes instead of explicit recursion (map, fold, scan).
- Reasoning about functional programs (based on equational reasoning, structural induction, properties of programming schemes).
- Knowing and applying fundamental techniques for incorporating side-effects in FP (IO, Applicatives and Monads)
- Applying abstraction to obtain generic implementations of folds and traversables.
|
|
This course introduces you to the functional programming paradigm. It makes use of the programming language Haskell, in which programs can be viewed as mathematical functions. Haskell offers powerful concepts like higher-order functions, polymorphic datatypes and type classes. These concepts make it possible to easily write programs that would be significantly more complex or extensive when written in other languages. The mathematical foundations enable you to reason about functional programs using relatively simple mathematical techniques such as equational reasoning and induction.
Instructional Modes
|
|
|
|
|
The course is concluded with a written (digital) exam. To participate in the exam you must have seriously participated in the computer practical. This means that you must have completed all assignments or at least made a serious effort to do so. If you do not meet this requirement, you may take the written exam, but your final result for the course will be a maximum of 5.
|
|
|