Functional Data Structures

Dr. Peter Lammich, Prof. Tobias Nipkow, Summer semester 2017

The course introduces students to the design and analysis of data structures for functional programming languages. It assumes that the students are familiar with functional programming and with running time analysis of algorithms. The course covers a range of functional data structures with an emphasis on their precise analysis. Proofs of both functional correctness and complexity will be a core part of the course. Proofs are carried out with the help of a computer-based proof assistant Isabelle. An introduction to Isabelle is part of the course.

This course is brand new and the syllabus is still evolving. There is likely to be an emphasis on search trees and priority queues.

At the end of the course students should be familiar with a number of efficient functional data structures and algorithms and should be able able to prove both functional and complexity properties about them with the theorem prover Isabelle.

On this page: News Lecture and Exercises Homework Important notice Literature



Material will be provided via a bitbucket repository, such that you can easily keep up to date.

Lectures (and tutorial) will be recorded using the TTT tool. The recordings can be downloaded on the TTT Recordings Website (as soon as they have been processed and uploaded).



Homework is the heart and soul of this course and most homework needs to be carried out with Isabelle.

Important notice


There is currently no book that covers the material of the course. However, this is the canonical reference to functional data structures: