default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenda Li 0001
Person information
- affiliation: University of Edinburgh, UK
- affiliation: University of Cambridge, UK
Other persons with the same name
- Wenda Li — disambiguation page
- Wenda Li 0002
![[0000-0001-6617-9136]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-6617-9136")
— University of Dundee, Dundee, UK - Wenda Li 0003 — Zhejiang University, China
- Wenda Li 0004 — Nagoya University, Nagoya, Aichi, Japan
- Wenda Li 0005 — University of Michigan, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Xueliang Zhao, Wenda Li, Lingpeng Kong:
Subgoal-based Demonstration Learning for Formal Theorem Proving. ICML 2024- [c5]Manuel Eberl, Anthony Bordg, Lawrence C. Paulson, Wenda Li:
Formalising Half of a Graduate Textbook on Number Theory (Short Paper). ITP 2024: 40:1-40:7 - [d1]Manuel Eberl, Anthony Bordg, Lawrence C. Paulson, Wenda Li:
Formalising Half of a Graduate Textbook on Number Theory (Formal Proof Development). Zenodo, 2024
- 2023
- [i7]Xueliang Zhao, Wenda Li, Lingpeng Kong:
Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving. CoRR abs/2305.16366 (2023) - 2022
- [j5]Anthony Bordg, Lawrence C. Paulson, Wenda Li:
Simple Type Theory is not too Simple: Grothendieck's Schemes Without Dependent Types. Exp. Math. 31(2): 364-382 (2022) - [j4]Angeliki Koutsoukou-Argyraki, Wenda Li, Lawrence C. Paulson:
Irrationality and Transcendence Criteria for Infinite Series in Isabelle/HOL. Exp. Math. 31(2): 401-412 (2022) - 2021
- [j3]Anthony Bordg, Lawrence C. Paulson, Wenda Li:
Grothendieck's Schemes in Algebraic Geometry. Arch. Formal Proofs 2021 (2021) - [c4]Wenda Li, Lei Yu, Yuhuai Wu, Lawrence C. Paulson:
IsarStep: a Benchmark for High-level Mathematical Reasoning. ICLR 2021 - [i6]Angeliki Koutsoukou-Argyraki, Wenda Li, Lawrence C. Paulson:
Irrationality and Transcendence Criteria for Infinite Series in Isabelle/HOL. CoRR abs/2101.05257 (2021) - [i5]Anthony Bordg, Lawrence C. Paulson, Wenda Li:
Simple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Types. CoRR abs/2104.09366 (2021) - 2020
- [j2]Wenda Li, Lawrence C. Paulson:
Evaluating Winding Numbers and Counting Complex Roots Through Cauchy Indices in Isabelle/HOL. J. Autom. Reason. 64(2): 331-360 (2020) - [i4]Wenda Li, Lei Yu, Yuhuai Wu, Lawrence C. Paulson:
Modelling High-Level Mathematical Reasoning in Mechanised Declarative Proofs. CoRR abs/2006.09265 (2020)
2010 – 2019
- 2019
- [j1]Wenda Li, Grant Olney Passmore, Lawrence C. Paulson:
Deciding Univariate Polynomial Problems Using Untrusted Certificates in Isabelle/HOL. J. Autom. Reason. 62(1): 69-91 (2019) - [c3]Wenda Li, Lawrence C. Paulson:
Counting polynomial roots in isabelle/hol: a formal proof of the budan-fourier theorem. CPP 2019: 52-64 - 2018
- [i3]Wenda Li, Lawrence C. Paulson:
Evaluating Winding Numbers and Counting Complex Roots through Cauchy Indices in Isabelle/HOL. CoRR abs/1804.03922 (2018) - [i2]Wenda Li, Lawrence C. Paulson:
Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem. CoRR abs/1811.11093 (2018) - 2016
- [c2]Wenda Li, Lawrence C. Paulson:
A modular, efficient formalisation of real algebraic numbers. CPP 2016: 66-75 - [c1]Wenda Li, Lawrence C. Paulson:
A Formal Proof of Cauchy's Residue Theorem. ITP 2016: 235-251 - 2015
- [i1]Wenda Li, Grant Olney Passmore, Lawrence C. Paulson:
A Complete Decision Procedure for Univariate Polynomial Problems in Isabelle/HOL. CoRR abs/1506.08238 (2015)
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 2025-11-04 00:37 CET 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:
