Davenport, J. H. and Trager, B. M., 1990. Scratchpad's view of algebra I: Basic commutative algebra. In: Design and Implementation of Symbolic Computation Systems: International Symposium DISCO '90, 1990-04-09 - 1990-04-11, Capri. Berlin: Springer, pp. 40-54. (Lecture Notes in Computer Science; 429/1990)
While computer algebra systems have dealt with polynomials and rational functions with integer coefficients for many years, dealing with more general constructs from commutative algebra is a more recent problem. In this paper we explain how one system solves this problem, what types and operators it is necessary to introduce and, in short, how one can construct a computational theory of commutative algebra. Of necessity, such a theory is rather different from the conventional, non-constructive, theory. It is also somewhat different from the theories of Seidenberg  and his school, who are not particularly concerned with practical questions of efficiency.
|Item Type ||Conference or Workshop Items (UNSPECIFIED)|
|Creators||Davenport, J. H.and Trager, B. M.|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||Davenport_DISCO_1990.pdf: The original publication is available at www.springerlink.com|
Actions (login required)