Titlebook: Design and Implementation of Symbolic Computation Systems; International Sympos Alfonso Miola Conference proceedings 1993 Springer-Verlag B

Blood-Clot

An order-sorted approach to algebraic computation,d algebra as the underlying model. The resulting programs have a form that is closely related to the algorithmic description of a problem, but with the security of full type checking in a compact, natural style.

瑣碎

Variant handling, inheritance and composition in the ObjectMath computer algebra environment,e environment and integrates object-oriented constructs such as classes and single and multiple inheritance within a computer algebra language. In addition, composition of objects using the part-of relation and support for solution of systems of equations is provided. This environment is currently b

OFF

Matching and unification for the object-oriented symbolic computation system ,,c computation system . with pattern matching and unification facilities. The various pattern objects are organized in subclasses of the class of the composite expressions. This leads to a clear design and to a distributed implementation of the pattern matcher in the subclasses. New pattern object cl

certain

脊椎動物

Decision procedures for set/hyperset contexts,ch, although rather weak, suffices to make the following two problems decidable:.Concerning (1), an explicit decision algorithm is provided; moreover, significantly broad sub-problems of (1) are singled out in which a classification —named the ‘syllogistic decomposition’ of r — of all possible ways

外面

正式演說

俗艷

surrogate

https://doi.org/10.1007/978-3-658-42221-9on of a sparse linear system solver is used to compute the solution of sparse linear systems over finite fields. We are able to find the solution of a 100,000 by 100,000 linear system with about 10.3 million non-zero entries over the Galois field with 2 elements using 3 computers in about 54 hours CPU time.

Indolent

Klaus Backhaus,Bernd Erichson,Rolf Weiberm, unifying the notions of “parametric” and “inclusion” polymorphisms. Furthermore, the operational nature of the specification formalisms allows a straightforward transformation into an executable form.