Blood-Clot
发表于 2025-3-30 11:52:13
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.
琐碎
发表于 2025-3-30 14:58:40
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
发表于 2025-3-30 16:47:19
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
发表于 2025-3-30 21:38:36
http://reply.papertrans.cn/27/2686/268570/268570_54.png
脊椎动物
发表于 2025-3-31 01:58:49
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
外面
发表于 2025-3-31 06:50:47
http://reply.papertrans.cn/27/2686/268570/268570_56.png
正式演说
发表于 2025-3-31 11:23:46
http://reply.papertrans.cn/27/2686/268570/268570_57.png
俗艳
发表于 2025-3-31 13:23:08
http://reply.papertrans.cn/27/2686/268570/268570_58.png
surrogate
发表于 2025-3-31 19:14:34
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
发表于 2025-4-1 00:22:31
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.