Reasoning about the reals: The marriage of HOL and Maple

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 698 LNAI, Issue , 1993, Pages 351-353

  Harrison, John ^a   Théry, Laurent ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING; THEOREM PROVING;

COMPUTER ALGEBRA SYSTEMS; DECISION PROCEDURE; THEOREM PROVERS;

ALGEBRA;

EID: 84949512872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56944-8_68     Document Type: Conference Paper

References (11)

1. R. J. Boulton, On Efficiency in Theorem Provers which Fully Expand Proofs into Primitive Inferences, Technical Report 248, University of Cambridge 1992.
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.
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.
4. A. Church, A Formulation of the Simple Theory of Types, Journal of Symbolic Logic 5 (1940) pp. 56–68.
5. M. Gordon, T. Melham, Introduction to HOL, Cambridge University Press 1993.
6. N. Kajler. Cas/Pi: A Portable and Extensible Interface for Computer Algebra Systems, Proceedings of ISSAC’92, ACM 1992.
7. M. Gordon, Private Communication.
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.
9. R. Henstock, The General Theory of Integration, Clarendon Press, Oxford 1991.
10. J. Kurzweil, Generalized Ordinary Differential Equations and Continuous Dependence on a Parameter, Czechoslovak Mathematics Journal 7(82), pp. 418–446, 1958.
11. I. N. Pesin, Classical and modern integration theories, Academic Press, New York 1970.