Real Number Calculations and Theorem Proving-Reference-Cited by-同舟云学术

Real Number Calculations and Theorem Proving

Published:2008 Issue: Volume: Page:215-229
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Lester David R

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71067-7_19

Reference27 articles.

1. Akbarpour, B., Paulson, L.C.: Towards automatic proofs of inequalities involving elementary functions. In: PDPAR 2006: Pragmatics of Decision Procedures in Automated Reasoning, pp. 27–37 (2006)

2. Lecture Notes in Artificial Intelligence;B. Akbarpour,2007

3. Grundlehren der Mathematischen Wissenschaften;E. Bishop,1985

4. Bajard, J.-C., Ercegovac, M., Imbert, L., Rico, F.: Fast evaluation of elementary functions with combined shift-and-add and polynomial methods. In: 4th Conference on Real Numbers and Computers, pp. 75–87 (2000)

5. Bertot, Y.: Affine functions and series with co-inductive real numbers. Mathematical Structures in Computer Science 17(1) (2007)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Formalisation in HOL of the Fundamental Theorem of Linear Algebra and Its Application to the Solution of the Least Squares Problem;Journal of Automated Reasoning;2016-06-14

2. Fixed Precision Patterns for the Formal Verification of Mathematical Constant Approximations;Proceedings of the 2015 Conference on Certified Programs and Proofs;2015-01-13

3. Formalization of real analysis: a survey of proof assistants and libraries;Mathematical Structures in Computer Science;2015-01-02

4. Formal proofs for theoretical properties of Newton's method;Mathematical Structures in Computer Science;2011-07-01

5. Formal Verification of Exact Computations Using Newton’s Method;Lecture Notes in Computer Science;2009