Course "Introduction to Functional Programming" SS 2016

This course is mandatory for BSc Computer Science.

Students of other curricula may choose this course; please check your curriculum.


  • Lecturer: Prof. Dr. Ralf Lämmel
  • Lab assistant: Marcel Heinz <ed.znelbok-inu|znieh#ed.znelbok-inu|znieh>
  • Assignment assistant: Matthias Paul <ed.znelbok-inu|luapm#ed.znelbok-inu|luapm>
  • 101wiki assistant: Kevin Klein <ed.znelbok-inu|nielkk#ed.znelbok-inu|nielkk>

Synopsis and format

See the official (timeless) synopsis for this module in the curriculum. The following text is closely tied to the specific edition. See the general course site for additional material, e.g., pointers to applicable textbooks for those interested. The course introduces the functional programming paradigm with the Haskell programming language as the primary language throughout the course. The course covers basics of functional programming (functions, datatypes, list processing, higher-order functions, etc.), functional design of data structures and algorithms, more advanced, mathematically influenced concepts (such as monoids, monads, and functors), selected programming techniques around data processing (e.g., generic programming) and basic software engineering methods for functional programs (e.g., modularization, documentation, testing, and packaging). The course is heavily sample- and wiki-based while the chrestomathy of the 101companies:Project provides many of the underlying resources. Links to extra resources such as Wikipedia, the Haskell wiki, and online textbooks are provided.



See lecture material on 101wiki.

Some lectures may be covered by code transcripts on the public svn.

Date Topic
14.04.2016 First steps
21.04.2016 Basic software engineering
28.04.2016 Searching and sorting
12.05.2016 Basic data modeling
02.06.2016 Higher-order functions
09.06.2016 Type-class polymorphism
16.06.2016 Functors and friends
23.06.2016 Functional data structures
30.06.2016 Unparsing and parsing
07.07.2016 Monads
14.07.2016 Exam preparation
21.07.2016 Final


Date Topic
15.04.2016 Kickoff
22.04.2016 Prelude/Simple functions
29.04.2016 Binary search/Binary search trees
13.05.2016 Abstract Data Types
03.06.2016 Higher Order Functions
10.06.2016 Type classes
17.06.2016 Functors and Friends
24.06.2016 Functional data structures
01.07.2016 Parsing and Unparsing
08.07.2016 Monads
15.07.2016 Exam Preparation
??.??.2016 Post-exam review

"Regular labs" go through solutions for previously completed assignments and discuss briefly the upcoming assignments.


The assignments are designed to help understand all material covered in the lecture. Also, the assignments support effective preparation for the exam. Issued assignments may be discussed briefly in the lecture or the lab. Completed assignments are discussed in detail in the lab. Students may be asked to present their solutions. The assignment assistant checks submitted solutions. Each student has a folder at (You are notified once your folder was created.) Each assignment possibly offers multiple options. The text of the assignment for each option is part of a source file providing a skeleton for the solution. These files are put into the student folders on the date of issue and have to be completed and committed by the deadline (End of Day). If there are multiple options for an assignment your score will be the maximum of your scores for each of the individual options.

No. Date of issue Deadline
1 22.04.2016 28.04.2016
2 29.04.2016 12.05.2016
3 13.05.2016 02.06.2016
4 03.06.2016 09.06.2016
5 10.06.2016 16.06.2016
6 17.06.2016 23.06.2016
7 24.06.2016 30.06.2016
8 01.07.2016 07.07.2016
9 08.07.2016 14.07.2016

Exam admission rules

Students need to pass homework assignments as follows:

  • Successful exam admission from the previous editions implies admission this time around.
  • Students submit individual submissions for the assignments.
  • Submission must arrive by the deadline (End of Day). Late submissions are not graded.
  • 6 submissions need to receive a score 1 or better.
  • 4 submissions need to receive a score 2.
  • Students need to register for exam via KLIPS.

Scores: Missing or useless or late submissions receive score 0. Submissions which are essentially correct and complete and meet essentially all additional software engineering requirements (e.g., regarding testing), modulo smaller problems, receive score 2. Submissions which show the noteworthy beginning of a solution in a proper manner but are definitely incorrect or incomplete or violate software engineering requirements receive score 1.