default search action
Floris van Doorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Floris van Doorn, Heather Macbeth
:
Integrals Within Integrals: A Formalization of the Gagliardo-Nirenberg-Sobolev Inequality. ITP 2024: 37:1-37:18 - 2023
- [c12]Floris van Doorn, Patrick Massot, Oliver Nash
Formalising the h-Principle and Sphere Eversion. CPP 2023: 121-134 - 2022
- [i10]Floris van Doorn:
Designing a general library for convolutions. CoRR abs/2210.07693 (2022) - [i9]Patrick Massot, Floris van Doorn, Oliver Nash:
Formalising the h-principle and sphere eversion. CoRR abs/2210.07746 (2022) - 2021
- [c11]Floris van Doorn:
Formalized Haar Measure. ITP 2021: 18:1-18:17 - [i8]Floris van Doorn:
Formalized Haar Measure. CoRR abs/2102.07636 (2021) - 2020
- [c10]Jesse Michael Han, Floris van Doorn:
A formal proof of the independence of the continuum hypothesis. CPP 2020: 353-366 - [c9]Kristina Sojakova, Floris van Doorn, Egbert Rijke:
Sequential Colimits in Homotopy Type Theory. LICS 2020: 845-858 - [c8]Floris van Doorn
Maintaining a Library of Formal Mathematics. CICM 2020: 251-267 - [i7]Floris van Doorn, Gabriel Ebner, Robert Y. Lewis:
Maintaining a Library of Formal Mathematics. CoRR abs/2004.03673 (2020) - [i6]Jeremy Avigad, Floris van Doorn:
Progress on a perimeter surveillance problem. CoRR abs/2008.04262 (2020)
2010 – 2019
- 2019
- [c7]Jesse Michael Han, Floris van Doorn:
A Formalization of Forcing and the Unprovability of the Continuum Hypothesis. ITP 2019: 19:1-19:19 - [i5]Jesse Michael Han, Floris van Doorn:
A formalization of forcing and the unprovability of the continuum hypothesis. CoRR abs/1904.10570 (2019) - 2018
- [c6]Ulrik Buchholtz
Higher Groups in Homotopy Type Theory. LICS 2018: 205-214 - [i4]Ulrik Buchholtz, Floris van Doorn, Egbert Rijke:
Higher Groups in Homotopy Type Theory. CoRR abs/1802.04315 (2018) - [i3]Floris van Doorn:
On the Formalization of Higher Inductive Types and Synthetic Homotopy Theory. CoRR abs/1808.10690 (2018) - 2017
- [c5]Floris van Doorn, Jakob von Raumer, Ulrik Buchholtz
Homotopy Type Theory in Lean. ITP 2017: 479-495 - [i2]Ulrik Buchholtz, Floris van Doorn, Jakob von Raumer:
Homotopy Type Theory in Lean. CoRR abs/1704.06781 (2017) - 2016
- [c4]Floris van Doorn:
Constructing the propositional truncation using non-recursive HITs. CPP 2016: 122-129 - 2015
- [c3]Leonardo Mendonça de Moura, Soonho Kong, Jeremy Avigad
The Lean Theorem Prover (System Description). CADE 2015: 378-388 - [i1]Floris van Doorn:
Propositional Calculus in Coq. CoRR abs/1503.08744 (2015) - 2014
- [c2]Cody Roux, Floris van Doorn:
The Structural Theory of Pure Type Systems. RTA-TLCA 2014: 364-378 - 2013
- [c1]Floris van Doorn, Herman Geuvers, Freek Wiedijk:
Explicit convertibility proofs in pure type systems. LFMTP 2013: 25-36
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: