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.
|Name||Lecture Notes in Computer Science|
|Conference||Design and Implementation of Symbolic Computation Systems: International Symposium DISCO '90 |
|Period||9/04/90 → 11/04/90|