Formalizing O notation in Isabelle/HOL

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3097, Issue , 2004, Pages 357-371

  Avigad, Jeremy ^a   Donnelly, Kevin ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; THEOREM PROVING; AUTOMATION; COMPUTATION THEORY;

AUTOMATED REASONER; FORMALIZATION; HOL INSTANTIATION; PROOF ASSISTANT; ISABELLE/HOL;

FORMAL LOGIC; THEOREM PROVING;

EID: 9444284435     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25984-8_27     Document Type: Conference Paper

References (12)

1. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete mathematics: a foundation for computer science. Addison-Wesley Publishing Company, Reading, MA, second edition, 1994.
2. F. Kammüller, M. Wenzel, and L. C. Paulson. Locales - a sectioning concept for Isabelle. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Proceeding of Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs'99, Nice, France, September 14-17, volume 1690 of LNCS, 1999.
3. Richard Krueger, Piotr Rudnicki, and Paul Shelley. Asymptotic notation. Part I: theory. Journal of Formalized Mathematics, Volume 11, 1999. http://mizar.org/JFM/Vol11/asympt_0.html.
4. Richard Krueger, Piotr Rudnicki, and Paul Shelley. Asymptotic notation. Part II: examples and problems. Journal of Formalized Mathematics, Volume 11, 1999. http://mizar.org/JFM/Vol11/asympt_1.html.
5. Melvyn B. Nathanson. Elementary Methods in Number Theory. Springer, New York, 2000.
6. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL. A proof assistant for higher-order logic, volume 2283 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 2002.
7. Harold N. Shapiro. Introduction to the theory of numbers. Pure and Applied Mathematics. John Wiley & Sons Inc., New York, 1983. A Wiley-Interscience Publication.
8. Markus Wenzel. Using axiomatic type classes in Isabelle, 1995. http://www.cl.cam.ac.uk/Research/HVG/Isabelle/docs.html.
9. Type classes and overloading in higher-order logic. In E. Gunther and A. Felty, editors, Proceedings of the 10th international conference on thoerem provings in higher-order logic (TPHOLs '97), pages 307-322, Murray Hill, New Jersey, 1997.
10. Markus Wenzel and Gertrud Bauer. Calculational reasoning revisited (an Isabelle/Isar experience). In R. J. Boulton and P. B. Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001, Proceedings, volume 2152 of Lecture Notes in Computer Science, pages 75-90, 2001.
11. The Coq proof assistant. Developed by the LogiCal project. http://pauillac.inria.fr/coq/coq-eng.html.
12. The Isabelle theorem proving environment. Developed by Larry Paulson at Cambridge University and Tobias Nipkow at TU Munich. http://www.cl.cam.ac.uk/ Research/HVG/Isabelle/index.html.