Electronic Communication of Mathematics and the Interaction of Computer Algebra Systems and Proof Assistants

Journal of Symbolic Computation

Volumn 32, Issue 1-2, 2001, Pages 3-22

  Barendregt, Henk ^a   Cohen, Arjeh M ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345978326     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2001.0455     Document Type: Article

References (30)

1. Adams W. W., Loustaunau P. An Introduction to Gröbner Bases. 1994;AMS, Oxford University Press.
2. Armando A., Smail A., Green I. Automatic synthesis of recursive programs: the proof-planning paradigm. Automated Software Engineering. 6:1999;329-356.
3. A. Armando, M. Kohlhase, S. Ranise, Eighth Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (CALCULEMUS-2000).
4. Barendregt H. The impact of the lambda calculus in logic and computer science. Bull. Symb. Logic. 3:1997;181-215.
5. Barendregt H., Barendsen E. Autarkic computations in formal proofs. J. Symb. Comput. (to appear). 2001.
6. Barendregt H., Geuvers H. Proof checking using dependent type systems. Voronkov A., Robinson A. Handbook of Automated Reasoning, (to appear). 2001;Elsevier, Amsterdam.
7. Buchberger B. Recent trends in multidimensional system theory. Bose N. K. Reidel, Chapter Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory. 1985;184-232.
8. Buchberger B., Winkler F. eds. Gröbner Bases and Applications. 1998;Cambridge University Press.
9. Caprotti O., Cohen A. On the role of OpenMath in interactive mathematical documents. J. Symb. Comput. (Special Issue on the Integration of Computer Algebra and Deduction Systems, to appear). 2001.
10. Caprotti O., Oostdijk M. Formal and efficient primality proofs by use of computer algebra oracles. J. Symb. Comput. (submitted). 2001.
11. Cohen A. M. Communicating mathematics across the web. Engquist B., Schmid W. Mathematics Unlimited - 2001 and beyond. 2000;283-300 Springer.
12. Cohen A. M., Cuypers H., Sterk H. eds. Some Tapas of Computer Algebra. 1999;Springer.
13. Cox D., Little J., O'Shea D. Ideals, Varieties, and Algorithms. 1992;Springer.
14. Eisenbud D. Commutative Algebra with a View Toward Algebraic Geometry. 1995;Springer.
15. Geuvers H., Poll E., Zwanenburg J. Safe proof checking in type theory with Y. Flum J., Rodriguez-Artalejo M. Computer Science Logic (CSL'99). 1999;439-452 Springer.
16. Harrison J. Proof style. Giménex E., Paulin-Mohring C. Types for Proofs and Programs: International Workshop TYPES'96. 1996;154-172 Springer-Verlag, Aussois, France.
17. G. L. Honaker.
18. Isabelle.
19. P. Jackson.
20. M. Jamnik, 1997, Morgan Kaufmann Publishers, San Francisco, p. 1541.
21. Klop J. W. Term Rewriting Systems, Handbook of Logic in Computer Science. 1992;Oxford University Press, New York. p. 1-116.
22. Kohlhase M. OMDoc: An infrastructure for openmath content dictionary information. Bulletin ACM Special Interest Group Symb. Automat. Math (SIGSAM). 34:2000a;43-48.
23. Kohlhase M. OMDoc: Towards an openmath representation of mathematical documents. Seki Report SR-00-02. 2000b;Fachbereich Informatik, Universität des Saarlandes. Available at URL: ¡http://www.mathweb.org/omdoc¿
24. Lam C. W. H. The search for a finite projective plane of order 10. Am. Math. Monthly. 98:1991;305-318.
25. P. Martin-Löf, Intuitionistic Type Theory, Studies in Proof Theory.
26. Nederpelt R. P., Geuvers J. H., de Vrijer R. eds. Selected Papers on Automath. 1994;North-Holland Publishing Co, Amsterdam.
27. Poincaré H. La Science et l'Hypothèse. 1902;Flamarion, Paris.
28. Ribenboim Paulo. My Numbers, My Friends, Popular Lectures on Number Theory. 2000;Springer-Verlag, New York.
29. Schütte Kurt. Syntactical and semantical properties of simple type theory. J. Symb. Logic. 25:1960;305-326.
30. Théry Laurent. A certified version of Buchberger's algorithm. Automated deduction - CADE-15 (Lindau, 1998). 1998;Springer, Berlin. p. 349-364.