Floris van Doorn

Orcid: 0000-0003-2899-8565

According to our database1, Floris van Doorn authored at least 16 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Formalising the h-Principle and Sphere Eversion.
Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2023

2022
Designing a general library for convolutions.
CoRR, 2022

2021
Formalized Haar Measure.
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

2020
Progress on a perimeter surveillance problem.
CoRR, 2020

Maintaining a Library of Formal Mathematics.
Proceedings of the Intelligent Computer Mathematics - 13th International Conference, 2020

Sequential Colimits in Homotopy Type Theory.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

A formal proof of the independence of the continuum hypothesis.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019
A Formalization of Forcing and the Unprovability of the Continuum Hypothesis.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
On the Formalization of Higher Inductive Types and Synthetic Homotopy Theory.
CoRR, 2018

Higher Groups in Homotopy Type Theory.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Homotopy Type Theory in Lean.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

2016
Constructing the propositional truncation using non-recursive HITs.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2015
Propositional Calculus in Coq.
CoRR, 2015

The Lean Theorem Prover (System Description).
Proceedings of the Automated Deduction - CADE-25, 2015

2014
The Structural Theory of Pure Type Systems.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013
Explicit convertibility proofs in pure type systems.
Proceedings of the Eighth ACM SIGPLAN International Workshop on Logical Frameworks & Meta-languages: Theory & Practice, 2013


  Loading...