Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Reasoning about the reals: the marriage of HOL and maple

  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 698))

Abstract

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.

Supported by the SERC UK.

Supported by the SERC UK and the DSTO Australia.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  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 

Download references

Author information

Authors and Affiliations

  1. University of Cambridge Computer Laboratory, Pembroke Street, CB2 3QG, Cambridge, England

    John Harrison & Laurent Théry

Authors
  1. John Harrison
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Théry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harrison, J., Théry, L. (1993). Reasoning about the reals: the marriage of HOL and maple. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-56944-8_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56944-2

  • Online ISBN: 978-3-540-47830-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation