Abstract data types in computer algebra

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The theory of abstract data types was developed in the late 1970s and the 1980s by several people, including the “ADJ” group, whose work influenced the design of Axiom. One practical manifestation of this theory was the OBJ-3 system. An area of computing that cries out for this approach is computer algebra, where the objects of discourse are mathematical, generally satisfying various algebraic rules. There have been various theoretical studies of this in the literature: [36,42,45] to name but a few. The aim of this paper is to report on the practical applications of this theory within computer algebra, and also to outline some of the theoretical issues raised by this practical application. We also give a substantial bibliography.

Cite

CITATION STYLE

APA

Davenport, J. H. (2000). Abstract data types in computer algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1893, pp. 21–35). Springer Verlag. https://doi.org/10.1007/3-540-44612-5_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free