A pragmatic approach to extending provers by computer algebra - With applications to coding theory

Fundamenta Informaticae

Volumn 39, Issue 1-2, 1999, Pages 1-20

  Ballarin, Clemens ^a   Paulson, Lawrence C ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Coding theory; Combining systems; Computer algebra; Mechanised reasoning; Soundness of computer algebra systems; Specialisation problem

Indexed keywords

EID: 0003056403     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-391201     Document Type: Article

References (23)

1. Clemens Ballarin, Karsten Homann, and Jacques Calmet. Theorems and algorithms: An interface between Isabelle and Maple. In A. H. M. Levelt, editor, ISSAC '95: International symposium on symbolic and algebraic computation - July 1995, Montréal, Canada, pages 150-157. ACM Press, 1995.
2. Manual Bronstein. Sumit Reference Manual. Scientific Computation Institute, ETH Zürich, 1996. Available with the Sumit distribution at http://www.inria.fr/safir/WHOSWHO/Manuel.Bronstein/sumit.html.
3. Manuel Bronstein. Sumit - a strongly-typed embeddable computer algebra library. In Calmet and Limongelli [1996], pages 22-33.
4. J. Calmet and J. A. Campbell. A perspective on symbolic mathematical computing and artificial intelligence. Annals of Mathematics and Artificial Intelligence, 19(3-4):261-277, 1997.
5. Jacques Calmet and Carla Limongelli, editors. Design and Implementation of Symbolic Computation Systems: International Symposium, DISCO '96, Karlsruhe, Germany, September 18-20, 1996: proceedings, number 1128 in Lecture Notes in Computer Science. Springer-Verlag, 1996.
6. Edmund Clarke and Xudong Zhao. Analytica: A theorem prover for Mathematica. The Mathematica Journal, 3(1):56-71, 1993.
7. R. M. Corless and D. J. Jeffrey. The Turing factorization of a rectangular matrix. ACM SIGSAM Bulletin, 31(3):20-28, 1997.
8. Stéphane Dalmas, Marc Gaëtano, and Stephen Watt. An OpenMath 1.0 implementation. In Wolfgang W. Küchlin, editor, ISSAC 97: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation - July 21-23, 1997, Maui, Hawaii, USA, pages 241-248. ACM Press, 1997.
9. James Davenport. Is computer algebra the same as computer mathematics? Talk given at the British Colloquium for Theoretical Computer Science (BCTCS), St. Andrews, UK, 31 March-2 April 1998.
10. Keith O. Geddes, Stephen R. Czapor, and George Labahan. Algorithms for Computer Algebra. Kluwer Academic Publishers, 1992.
11. John Robert Harrison. Theorem proving with the real numbers. Technical Report 408, University of Cambridge, Computer Laboratory, November 1996.
12. D. G. Hoffman, D. A. Leonard, C. C. Lindner, K. T. Phelps, C. A. Rodger, and J. R. Wall. Coding Theory: The Essentials. Number 150 in Monographs and textbooks in pure and applied mathematics. Marcel Dekker, Inc., New York, 1991.
13. Karsten Homann. Symbolisches Lösen mathematischer Probleme durch Kooperation algorithmischer und logischer Systeme. Number 152 in Dissertationen zur Künstlichen Intelligenz, infix, St. Augustin, 1997.
14. Taneli Huuskonen. Re: Description of OpenMath. Private communication, 20 August 1997.
15. Nathan Jacobson. Basic Algebra, volume I. Freeman, 2nd edition, 1985.
16. Richard D. Jenks and Robert S. Sutor. AXIOM. The scientific computation system. Numerical Algorithms Group, Ltd. and Springer-Verlag, Oxford and New York, 1992.
17. Manfred Kerber, Michael Kohlhase, and Volker Sorge. Integrating computer algebra with proof planning. In Calmet and Limongelli [1996], pages 204-215.
18. Lawrence Paulson. A higher-order implementation of rewriting. Science of Computer Programming, 3:119-149, 1983.
19. Lawrence C. Paulson. Isabelle: a generic theorem prover. Number 828 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
20. Lawrence C. Paulson. ML for the Working Programmer. Cambridge University Press, 2nd edition, 1996.
21. David R. Stoutemyer. Crimes and misdemeanors in the computer algebra trade. Notices of the American Mathematical Society, 38(7):778-785, 1991.
22. Laurent Théry. A certified version of Buchberger's algorithm. In C. Kirchner and H. Kirchner, editors, Automated deduction, CADE-15: 15th International Conference on Automated Deduction, Lindau, Germany: proceedings, number 1421 in Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence, pages 349-364. Springer-Verlag, 1998.
23. Stephen M. Watt, Peter A. Broadbery, Samuel S. Dooley, Pietro Iglio, Scott C. Morrison, Jonathan M. Steinbach, and Robert S. Sutor. AXIOM Library Compiler User Guide. The Numerical Algorithms Group Limited, Oxford, 1994.