MKM from book to computer: A case study

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

Volumn 2594, Issue , 2003, Pages 17-29

  Davenport, James H ^a  

^a University of Bath   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ELEMENTARY TRANSCENDENTAL FUNCTIONS; MATHEMATICAL KNOWLEDGE;

ARTIFICIAL INTELLIGENCE;

EID: 33745639131     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36469-2_2     Document Type: Article

References (17)

1. Abbott, J.A., Díaz, A. & Sutor, R.S, OpenMath: A Protocol for the Exchange of Mathematical Information. SIGSAM Bulletin 30 (1996) 1 pp. 21-24.
2. Abramowitz, M. & Stegun, I., Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. US Government Printing Office, 1964. 10th Printing December 1972.
3. Aslaksen, H., Can your computer do complex analysis?. In: Computer Algebra Systems: A Practical Guide (M. Wester ed.), John Wiley, 1999. http://www.math.nus.edu.sg/aslaksen/helmerpub.shtml.
4. Beeson, M. & Wiedijk, F., The Meaning of Infinity in Calculus and Computer Algebra Systems. Artificial Intelligence, Automated Reasoning, and Symbolic Computation (ed. J. Calmet et al.), Springer Lecture Notes in Artificial Intelligence 2385, Springer-Verlag, 2002, pp. 246-258.
5. Bradford, R.J. & Davenport, J.H., Towards Better Simplification of Elementary Functions. Proc. ISSAC 2002 (ed. T. Mora), ACM Press, New York, 2002, pp. 15-22.
6. Bradford, R.J., Corless, R.M., Davenport, J.H., Jeffrey, D.J. & Watt, S.M., Reasoning about the Elementary Functions of Complex Analysis. Annals of Mathematics and Artificial Intelligence 36 (2002) pp. 303-318.
7. de Bruijn, N., The Mathematical Vernacular, a language for mathematics with type sets. Proc. Workshop on Programming Logic, Chalmers U., May 1987.
8. Corless, R.M., Davenport, J.H., Jeffrey, D.J., Litt, G. & Watt, S.M., Reasoning about the Elementary Functions of Complex Analysis. Artificial Intelligence and Symbolic Computation (ed. John A. Campbell & Eugenio Roanes-Lozano), Springer Lecture Notes in Artificial Intelligence Vol. 1930, Springer-Verlag 2001, pp. 115-126.
9. Corless, R.M., Davenport, J.H., Jeffrey, D.J. & Watt, S.M., "According to Abramowitz and Stegun". SIGSAM Bulletin 34 (2000) 2, pp. 58-65.
10. Corless, R.M. & Jeffrey, D.J., The Unwinding Number. SIGSAM Bulletin 30 (1996) 2, pp. 28-35.
11. Davenport, J.H., Table Errata - Abramowitz & Stegun. To appear in Math. Comp.
12. Davenport, J.H., "According to Abramowitz and Stegun" II. OpenMath Thematic Network Deliverable ???, 2002. http://www.monet.nag.co.uk/???/
13. Dewar, M.C., OpenMath: An Overview. ACM SIGSAM Bulletin 34 (2000) 2 pp. 2-5.
14. IEEE Standard 754 for Binary Floating-Point Arithmetic. IEEE Inc., 1985.
15. Kahan, W., Branch Cuts for Complex Elementary Functions. The State of Art in Numerical Analysis (ed. A. Iserles & M.J.D. Powell), Clarendon Press, Oxford, 1987, pp. 165-211.
16. Rich, A.D. and Jeffrey, D.J., Function evaluation on branch cuts. SIGSAM Bulletin 116(1996).
17. Stoutemyer, D., Crimes and Misdemeanors in the Computer Algebra Trade. Notices AMS 38 (1991) pp. 779-785.