Parameterized Type Definitions in Mathematica: Methods and Advantages

Details Parameterized Type Definitions in Mathematica: Methods and Advantages Parameterized Type Definitions in Mathematica: Methods and Advantages

2002-08-20

arxiv.org/abs/cs/0208031v1

Computer Science

Symbolic Computation

14 pages

Scientific paper

The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the utility of the parameterized categorical approach by deriving a multivariate polynomial category (over various coefficient domains), which is used by our Mathematica implementation of Buchberger's algorithms for determining the Groebner basis. These implementations are designed according to domain and category parameterization principles underlining their advantages: operation protection, inheritance, generality, easy extendibility. In particular, such an extension of Mathematica, a widely used symbolic computation system, with a new type system has a certain practical importance. The approach we propose for Mathematica is inspired from D. Gruntz and M. Monagan's work in Gauss, for Maple.

Affiliated with

Also associated with

No associations

Rating

Parameterized Type Definitions in Mathematica: Methods and Advantages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parameterized Type Definitions in Mathematica: Methods and Advantages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameterized Type Definitions in Mathematica: Methods and Advantages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465397