default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNiels van der Weide
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Niels van der Weide
, Dan Frumin:
The Interval Domain in Homotopy Type Theory. Logics and Type Systems in Theory and Practice 2024: 241-256- [c11]Niels van der Weide, Nima Rasekh, Benedikt Ahrens, Paige Randall North:
Univalent Double Categories. CPP 2024: 246-259 - [c10]Benedikt Ahrens, Ralph Matthes, Niels van der Weide, Kobe Wullaert:
Displayed Monoidal Categories for the Semantics of Linear Logic. CPP 2024: 260-273 - [c9]Niels van der Weide:
Univalent Enriched Categories and the Enriched Rezk Completion. FSCD 2024: 4:1-4:19 - [i8]Niels van der Weide:
Univalent Enriched Categories and the Enriched Rezk Completion. CoRR abs/2401.11752 (2024) - 2023
- [j4]Benedikt Ahrens, Paige Randall North, Niels van der Weide:
Bicategorical type theory: semantics and syntax. Math. Struct. Comput. Sci. 33(10): 868-912 (2023) - [c8]Niels van der Weide:
The Formal Theory of Monads, Univalently. FSCD 2023: 6:1-6:23 - [c7]Niels van der Weide, Deivid Vale, Cynthia Kop:
Certifying Higher-Order Polynomial Interpretations. ITP 2023: 30:1-30:20 - [i7]Niels van der Weide, Deivid Vale, Cynthia Kop:
Certifying Higher-Order Polynomial Interpretations. CoRR abs/2302.11892 (2023) - [i6]Niels van der Weide, Nima Rasekh, Benedikt Ahrens, Paige Randall North:
Univalent Double Categories. CoRR abs/2310.09220 (2023) - 2022
- [c6]Benedikt Ahrens, Paige Randall North, Niels van der Weide:
Semantics for two-dimensional type theory. LICS 2022: 12:1-12:14 - [i5]Benedikt Ahrens, Paige Randall North, Niels van der Weide:
Semantics for two-dimensional type theory. CoRR abs/2201.10662 (2022) - [i4]Niels van der Weide:
The Formal Theory of Monads, Univalently. CoRR abs/2212.08515 (2022) - 2021
- [j3]Niccolò Veltri, Niels van der Weide:
Constructing Higher Inductive Types as Groupoid Quotients. Log. Methods Comput. Sci. 17(2) (2021) - [j2]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niccolò Veltri, Niels van der Weide:
Bicategories in univalent foundations. Math. Struct. Comput. Sci. 31(10): 1232-1269 (2021) - [i3]Deivid Vale, Niels van der Weide:
Formalizing Higher-Order Termination in Coq. CoRR abs/2112.05715 (2021) - 2020
- [c5]Niels van der Weide:
Constructing Higher Inductive Types as Groupoid Quotients. LICS 2020: 929-943 - [i2]Niels van der Weide:
Constructing Higher Inductive Types as Groupoid Quotients. CoRR abs/2002.08150 (2020)
2010 – 2019
- 2019
- [c4]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide:
Bicategories in Univalent Foundations. FSCD 2019: 5:1-5:17 - [c3]Niccolò Veltri, Niels van der Weide:
Guarded Recursion in Agda via Sized Types. FSCD 2019: 32:1-32:19 - [c2]Niels van der Weide, Herman Geuvers:
The Construction of Set-Truncated Higher Inductive Types. MFPS 2019: 261-280 - [i1]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide:
Bicategories in Univalent Foundations. CoRR abs/1903.01152 (2019) - 2018
- [c1]Dan Frumin, Herman Geuvers, Léon Gondelman, Niels van der Weide:
Finite sets in homotopy type theory. CPP 2018: 201-214 - 2017
- [j1]Henning Basold, Herman Geuvers, Niels van der Weide:
Higher Inductive Types in Programming. J. Univers. Comput. Sci. 23(1): 63-88 (2017)
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 22:21 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:
