Yannick Forster

Saarland University Computer Science

About me

I am a PhD student at the Saarbrücken Graduate School of Computer Science and the Programming Systems Lab.

I did my Bachelor's Thesis on formal and constructive computability theory and a Research Immersion Lab on verified extraction from Coq at the chair. I obtained my Master's degree from the University of Cambridge with a thesis on the expressive power of effect handlers and monadic reflection.

Currently, we are trying to establish the strong invariance thesis for a certain kind of lambda calculus with the long-term goal of using this calculus as a formal basis for Complexity theory. In order to do so, I am working on a formalisation of Turing machines in Coq.

Yannick Forster


The strong invariance thesis for a lambda-calculus
Yannick Forster, Fabian Kunze, Marc Roth
LOLA 2017, Reykjavik, Iceland, 2017.

Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq (pdf)
Yannick Forster and Gert Smolka
ITP 2017, Brasilia, Brazil, 2017.

On the Expressive Power of User-Defined Effects: Effect Handlers,
Monadic Reflection, Delimited Control

Yannick Forster, Ohad Kammar, Sam Lindley, Matija Pretnar
ICFP 2017, Oxford, 2017.

Verified Extraction from Coq to a Lambda-Calculus (pdf) (slides)
Yannick Forster and Fabian Kunze
Coq Workshop 2016, ITP 2016, Nancy, 2016.

On the expressive power of effect handlers and monadic reflection (pdf)
Yannick Forster
Master's Thesis, Robinson College, University of Cambridge, 2016.

A Formal and Constructive Theory of Computation (pdf)
Yannick Forster
Bachelor's Thesis, Programming Systems Lab, Saarland University, 2014.

Supervised Students

Edith Heiter, 2017, Bachelor's thesis (in progress)
Undecidability of PCP in Coq, co-supervised with Gert Smolka

Maximilian Wuttke, 2017, Bachelor's thesis (in progress)
Formalising Turing machines in Coq


Summer 2017 TA
Introduction to Computational Logic
Core course, Programming Systems Lab.
Summer 2017 Advisor
Category Theory
Seminar, Programming Systems Lab.
Winter 2016 Advisor
Funktionale Programmierung
Proseminar, Programming Systems Lab.
Summer 2016 Lecturer, Coach and Organiser
Mathematics Precourse
Saarland University.
Summer 2015 Part of the organisation team
Mathematics Precourse
Saarland University.
Winter 2014/2015 Organiser
Didactic Seminar for Re-exam Student TAs
Reactive Systems Group.
Winter 2014/2015 Supervision Student TA
Programming 1
Basic course, Reactive Systems Group.
Summer 2014 Student TA
Introduction to Computational Logic
Core course, Programming Systems Lab.
Winter 2013/2014 Student TA
Programming 1
Basic course, Dependent Systems Group.
Summer 2013 Student TA
Mathematics Precourse
Saarland University.


Mail: forster at ps.uni-saarland.de
Adress: Saarland University,
Saarland Informatics Campus E1 3, Rm 523
66123 Saarbr├╝cken
Phone: +49 (0)681 / 302-5626