SINGULAR is a computer algebra system for
polynomial computations in commutative algebra,
algebraic geometry, and singularity theory. Its
main computational objects are ideals and modules
over a large variety of baserings. The baserings
are polynomial rings over a field (eg. finite
fields, the rationals, floats, algebraic
extensions, transcendental extensions), or
localizations thereof, or quotient rings with
respect to an ideal. It features fast and general
implementations for computing Groebner and
standard bases, including Buchberger's algorithm
and Mora's Tangent Cone algorithm. Its interactive
shell and C-like programming language can be
extended by libraries written in the SINGULAR
programming language.
