Skip to main content

Retargeting OpenAxiom to Poly/ML: Towards an Integrated Proof Assistants and Computer Algebra System Framework

  • Conference paper
  • 634 Accesses

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

Abstract

This paper presents an ongoing effort to integrate the AXIOM family of computer algebra systems with Poly/ML-based proof assistants in the same framework. A long-term goal is to make a large set of efficient implementations of algebraic algorithms available to popular proof assistants, and also to bring the power of mechanized formal verification to a family of strongly typed computer algebra systems at a modest cost. Our approach is based on retargeting the code generator of the OpenAxiom compiler to the Poly/ML abstract machine.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbott, J., Díaz, A., Sutor, R.S.: A report on openmath: a protocol for the exchange of mathematical information. SIGSAM Bull. 30, 21–24 (1996)

    Article  Google Scholar 

  2. Adams, A., Dunstan, M., Gottliebsen, H., Kelsey, T., Martin, U., Owre, S.: Computer algebra meets automated theorem proving: Integrating maple and pvs. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 27–42. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Ballarin, C., Homann, K., Calmet, J.: Theorems and algorithms: an interface between isabelle and maple. In: Proceedings of the 1995 international symposium on Symbolic and algebraic computation, ISSAC 1995, pp. 150–157. ACM, New York (1995)

    Chapter  Google Scholar 

  4. Barendregt, H., Cohen, A.M.: Electronic communication of mathematics and the interaction of computer algebra systems and proof assistants. J. Symb. Comput. 32, 3–22 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Calmet, J., Homann, K.: Classification of communication and cooperation mechanisms for logical and symbolic computation systems. In: Frontiers of Combining Systems (FroCos), pp. 221–234 (1996)

    Google Scholar 

  6. Carette, J., Farmer, W.M., Wajs, J.: Trustable communication between mathematics systems. In: Proc. of Calculemus 2003, Aracne, pp. 58–68 (2003)

    Google Scholar 

  7. Crary, K., Weirich, S., Morrisett, G.: Intensional Polymorphism in Type-erasure Semantics. J. Funct. Program. 12, 567–600 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Davenport, J.H.: A New Algebra System. Technical report, IBM Research (1984)

    Google Scholar 

  9. Davenport, J.H.: Equality in Computer Algebra and Beyond. J. Symb. Comput. 34, 259–270 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Delahaye, D., Mayero, M.: Dealing with algebraic expressions over a field in coq using maple. J. Symb. Comput. 39, 569–592 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Harrison, J., Théry, L.: A skeptic’s approach to combining hol and maple. J. Autom. Reason. 21, 279–294 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Isabelle (2011), http://www.cl.cam.ac.uk/research/hvg/Isabelle/index.html

  13. Jenks, R.D., Sutor, R.S.: AXIOM: The Scientific Computation System. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  14. Li, Y., Reis, G.D.: A Quantitative Study of Reductions in Algebraic Libraries. In: PASCO 2010: Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, pp. 98–104. ACM, New York (2010)

    Google Scholar 

  15. Li, Y., Reis, G.D.: An Automatic Parallelization Framework for Algebraic Computation Systems. In: ISSAC 2011: Proceedings of the International Symposium on Symbolic and Algebraic Computation. ACM, New York (2011)

    Google Scholar 

  16. Maple. Maplesoft Inc., Canada (2011), http://www.maplesoft.com

  17. Matthews, D.C.J., Wenzel, M.: Efficient Parallel Programming in Poly/ML and Isabelle/ML. In: Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming, DAMP 2010, pp. 53–62. ACM, New York (2010)

    Chapter  Google Scholar 

  18. Monagan, M.B., Geddes, K.O., Heal, K.M., Labahn, G., Vorkoetter, S.M., McCarron, J., De Marco, P.: Maple Advanced Programming Guide, Maplesoft, Canada (2007)

    Google Scholar 

  19. OpenAxiom (2011), http://www.open-axiom.org

  20. Poly/ML (2011), http://www.polyml.org

  21. Watt, S.M.: Aldor Programming Language (December 2009), http://www.aldor.org

  22. Watt, S.M., Broadbery, P.A., Iglio, P., Morrison, S.C., Steinbach, J.M.: Foam: A first order abstract machine version 0.35. Technical report, IBM Thomas J. Watson Research Center (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dos Reis, G., Matthews, D., Li, Y. (2011). Retargeting OpenAxiom to Poly/ML: Towards an Integrated Proof Assistants and Computer Algebra System Framework. In: Davenport, J.H., Farmer, W.M., Urban, J., Rabe, F. (eds) Intelligent Computer Mathematics. CICM 2011. Lecture Notes in Computer Science(), vol 6824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22673-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22673-1_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22672-4

  • Online ISBN: 978-3-642-22673-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics