A formal proof of Cauchy’s residue theorem
Accepted version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
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.
Description
Journal Title
Lecture Notes in Computer Science
Conference Name
Journal ISSN
0302-9743
1611-3349
1611-3349
Volume Title
9807
Publisher
Springer
Publisher DOI
Rights and licensing
Except where otherwised noted, this item's license is described as http://www.rioxx.net/licenses/all-rights-reserved
Sponsorship
China Scholarship Council