Reasoning about the reals: the marriage of HOL and maple
Computer algebra systems are extremely powerful and flexible, but often give results which require careful interpretation or are downright incorrect. By contrast, theorem provers are very reliable but lack the powerful specialized decision procedures and heuristics of computer algebra systems. In this paper we try to get the best of both worlds by careful exploitation of a link between a theorem prover and a computer algebra system.
Unable to display preview. Download preview PDF.
- 1.R. J. Boulton, On Efficiency in Theorem Provers which Fully Expand Proofs into Primitive Inferences, Technical Report 248, University of Cambridge 1992.Google Scholar
- 2.D. Clement, A Distributed Architecture for Programming Environment, Proceedings of ACM SIGSOFT'90 SDE-4, Software Engineering Notes, Vol 15, no. 6, Irvine Ca, 1990.Google Scholar
- 3.B. W. Char, K. O. Geddes, G. H. Gonnet, B. L. Leong, M. B. Monagan and S. M. Watt. A Tutorial Introduction to Maple V, Springer-Verlag, 1992.Google Scholar
- 4.A. Church, A Formulation of the Simple Theory of Types, Journal of Symbolic Logic 5 (1940) pp. 56–68.Google Scholar
- 5.M. Gordon, T. Melham, Introduction to HOL, Cambridge University Press 1993.Google Scholar
- 6.N.Kajler. Cas/Pi: A Portable and Extensible Interface for Computer Algebra Systems, Proceedings of ISSAC'92, ACM 1992.Google Scholar
- 7.M. Gordon, Private Communication.Google Scholar
- 8.J. R. Harrison, Constructing the Real Numbers in HOL, Proceedings of the 1992 International Workshop on the HOL Theorem Proving System and its Applications, North-Holland 1993.Google Scholar
- 9.R. Henstock, The General Theory of Integration, Clarendon Press, Oxford 1991.Google Scholar
- 10.J. Kurzweil, Generalized Ordinary Differential Equations and Continuous Dependence on a Parameter, Czechoslovak Mathematics Journal 7(82), pp. 418–446, 1958.Google Scholar
- 11.I. N. Pesin, Classical and modern integration theories, Academic Press, New York 1970.Google Scholar