May 2025: Together with Leonardo de Moura, Soonho Kong, Jeremy Avigad and Jakob von Raumer I received the Skolem award for the paper The Lean Theorem Prover (System Description). The Skolem award is awarded to the paper that has passed the test of time, by being a most influential paper in the field.
October 2024: Maria, Michael and Arend joined the formalization group in Bonn.
June 2024: I’m launching the formalization of Carleson’s theorem. Take a look at the project webpage, or the introductory presentation. If you know some Lean, you are welcome to join the project.
I am a professor at the mathematical institute of the university of Bonn and leading the Formalized Mathematics workgroup. My interest is to make it viable to formalize research mathematics in proof assistants that can check the correctness of such proofs for you. Currently, it still takes a lot of work to write the proof down in great detail.
I am interested in formalized mathematics, tools and automation for formalization and (homotopy) type theory. I also enjoy thinking about combinatorial problems, solving puzzles and playing board games and video games.
Short CV
2023 - present: Professor at the University of Bonn
Formalizing sphere eversion using Lean’s mathematical library, June 2023. Special session on Machine-checked mathematics, CALCO 2023 & MFPS XXXIX, Bloomington, Indiana, USA. (slides)
Formalized Spectral Sequences in Homotopy Type Theory, September 2017. Algebra, Combinatorics, and Geometry seminar, University of Pittsburgh. (slides talk 1, slides talk 2)
Carleson operators on doubling metric measure spaces, Lars Becker, Floris van Doorn, Asgar Jamneshan, Rajula Srivastava, Christoph Thiele. Preprint (arXiv).
A blueprint for the formalization of Carleson’s theorem on convergence of Fourier series, Lars Becker, María Inés de Frutos-Fernández, Leo Diedering, Floris van Doorn, Sébastien Gouëzel, Asgar Jamneshan, Evgenia Karunus, Edward van de Meent, Pietro Monticone, Jasper Mulder-Sohn, Jim Portegies, Joris Roos, Michael Rothgang, Rajula Srivastava, James Sundstrom, Jeremy Tan, Christoph Thiele. Blueprint for a Lean formalization (arXiv, Github).
Designing a general library for convolutions, Floris van Doorn. Preprint (arXiv).
On the Formalization of Higher Inductive Types and Synthetic Homotopy Theory, Floris van Doorn. Dissertation. Committee: Jeremy Avigad, Steve Awodey, Ulrik Buchholtz, and Mike Shulman.
Logic and Proof, Jeremy Avigad, Robert Y. Lewis, Floris van Doorn. Lecture notes for the course Logic and Mathematical Inquiry (Interactive version).
The Lean Theorem Prover, Floris van Doorn. Blog post of the HoTT Blog, December 2015. (Link).
Constructing the Propositional Truncation using Nonrecursive HITs, Floris van Doorn. Blog post of the HoTT Blog, July 2015. (Link).
Short notes on the Applications of the Serre Spectral Sequence, November 2015.
Propositional Calculus in Coq, Floris van Doorn. (arXiv:1503.08744), May 2014.
Explicit Convertibility Proofs in Pure Type Systems, Floris van Doorn. Master thesis (pdf, Coq formalization). Advisor: Freek Wiedijk.
Fall 2016: TA for Differential and Integral Calculus (21-120) with Russ Walker.
Fall 2015: TA for Logic and Mathematical Inquiry (80-211) with Jeremy Avigad. Also co-author of the lecture notes together with Jeremy Avigad and Rob Lewis.
Spring 2015: TA for Game Theory (80-405/80-705) with Adam Bjorndahl.