Abstract specification of structures and methods in symbolic mathematical computation (Q1199931)

Specification and treatment of mathematical objects (e.g. functions, relations, logical formulas, and general data structures) are considered and an object-oriented programming approach to support the design and implementation of a symbolic computation system is presented. The features of the symbolic computation are enlarged by the manipulation of logical properties of the data structure. Classification of algebraic data structures (semigroup, monoid, group, Abelian group, ring, etc.; sorts are not specified, only symbolic computations can be performed), parametric structures (e.g. matrices, polynomials, power series; partial sorts, additional operations and properties), and ground structures (completely specified, both symbolic and numerical computations are allowed) are carried out. The main features of the object-oriented programming can be expressed by the scheme Object \(+\) Class \(+\) Inheritance (e.g. group is obtained by inheritance from monoid, etc.). Examples of structure and method abstraction are discussed. A partial implementation (by Loglan language) of the abstract class ring, the parametric class matrix and the ground class integer-number is shown. The Hensel lifting algorithm is listed.