A HOL theory of Euclidean space

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 114-129

  Harrison, John ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MATRIX ALGEBRA; VECTORS;

EUCLIDEAN SPACES; HOL TYPE SYSTEMS; INVERSE FUNCTIONS; MATRIX MULTIPLICATION;

THEOREM PROVING;

EID: 26844560473     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_8     Document Type: Conference Paper

References (17)

1. M. Blume. No-longer-foreign: Teaching an ML compiler to speak C "natively". In N. Benton and A. Kennedy, editors, BABEL'01: First workshop on multi-language infrastructure and interoperability, 2001. Available online via http://docs.msdnaa.net/ ark_new/Webflies/babel.htm
2. J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, 1998.
3. W. M. Farmer and F. J. Thayer. Two computer-supported proofs in metric space topology. Notices of the American Mathematical Society, 38:1133-1138, 1991.
4. L. Gårding. Some Points of Analysis and Their History, volume 11 of University Lecture Series. American Mathematical Society / Higher Education Press, 1997.
5. H. Geuvers, F. Wiedijk, and J. Zwanenburg. A constructive proof of the fundamental theorem of algebra without using the rationals. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Types for Proofs and Programs, Proceedings of the International Workshop, TYPES 2000, volume 2277 of Lecture Notes in Computer Science, pages 96-111. Springer-Verlag, 2001.
6. J. Harrison. Constructing the real numbers in HOL. In L. J. M. Claesen and M. J. C. Gordon, editors, Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications, volume A-20 of IFIP Transactions A: Computer Science and Technology, pages 145-164, IMEC, Leuven, Belgium, 1992. NorthHolland.
7. J. Harrison. Complex quantifier elimination in HOL. In R. J. Boulton and P. B. Jackson, editors, TPHOLs 2001: Supplemental Proceedings, pages 159-174. Division of Informatics, University of Edinburgh, 2001. Published as Informatics Report Series EDI-INF-RR-0046. Available on the Web at http://www. informatics. ed.ac.uk/publications/report/0046.html.
8. L. Hörmander. The Analysis of Linear Partial Differential Operators II, volume 257 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1983.
9. L. S. v. B. Jutting. Checking Landau's "Grundlagen" in the AUTOMATH System. PhD thesis, Eindhoven University of Technology, 1977. Useful summary in [13], pp. 701-732.
10. H. W. Kuhn. Some combinatorial lemmas in topology. IBM Journal of research and development, 4:518-524, 1960. Available on the Web from http://www.research.ibm.com/j ournal/rd/045/ibmrd0405K.pdf.
11. S. McLaughlin and J. Harrison. A proof-producing decision procedure for real arithmetic. To appear in proceedings of the 20th International Conference on Automated Deduction, 2005.
12. R. Milewski. Fundamental theorem of algebra. Journal of Formalized Mathematics, 12, 2000. See http://mizar.org/JFM/Vol12/polynom5.html.
13. R. P. Nederpelt, J. H. Geuvers, and R. C. d. Vrijer, editors. Selected Papers on Automath, volume 133 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1994.
14. P. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Available from the Web at citeseer.nj.nec.com/parrilo01semidefinite. html, 2001.
15. W. Rudin. Principles of Mathematical Analysis. McGraw-Hill, 3rd edition, 1976.
16. R. Solovay. Elimination of quantifiers I, II, III. Email messages to John Harrison, 9, 19, 20 and 27 November 2004, 2004.
17. H. J. Sussmann. Multidifferential calculus: chain rule, open mapping and transversal intersection theorems. In W. W. Hager and P. M. Pardalos, editors, Optimal control: theory, algorithms, and applications, pages 436-487. Kluwer, 1998.