A formal proof of Cauchy’s residue theorem
View / Open Files
Publication Date
2016-08-07Journal Title
Lecture Notes in Computer Science
ISSN
0302-9743
Publisher
Springer
Volume
9807
Pages
235-251
Language
English
Type
Article
This Version
AM
Metadata
Show full item recordCitation
Li, W., & Paulson, L. (2016). A formal proof of Cauchy’s residue theorem. Lecture Notes in Computer Science, 9807 235-251. https://doi.org/10.1007/978-3-319-43144-4_15
Abstract
We present a formalization of Cauchy’s residue theorem and two of its corollaries: the argument principle and Rouché’s theorem. These results have applications to verify algorithms in computer algebra and demonstrate Isabelle/HOL’s complex analysis library.
Sponsorship
China Scholarship Council
Identifiers
External DOI: https://doi.org/10.1007/978-3-319-43144-4_15
This record's URL: https://www.repository.cam.ac.uk/handle/1810/262370
Rights
Licence:
http://www.rioxx.net/licenses/all-rights-reserved