標(biāo)題: Titlebook: Design and Implementation of Symbolic Computation Systems; International Sympos Alfonso Miola Conference proceedings 1993 Springer-Verlag B [打印本頁] 作者: 葉子 時間: 2025-3-21 18:20
書目名稱Design and Implementation of Symbolic Computation Systems影響因子(影響力)
書目名稱Design and Implementation of Symbolic Computation Systems影響因子(影響力)學(xué)科排名
書目名稱Design and Implementation of Symbolic Computation Systems網(wǎng)絡(luò)公開度
書目名稱Design and Implementation of Symbolic Computation Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Design and Implementation of Symbolic Computation Systems被引頻次
書目名稱Design and Implementation of Symbolic Computation Systems被引頻次學(xué)科排名
書目名稱Design and Implementation of Symbolic Computation Systems年度引用
書目名稱Design and Implementation of Symbolic Computation Systems年度引用學(xué)科排名
書目名稱Design and Implementation of Symbolic Computation Systems讀者反饋
書目名稱Design and Implementation of Symbolic Computation Systems讀者反饋學(xué)科排名
作者: Sciatica 時間: 2025-3-22 00:05
0302-9743 ntific exchangeamong academic, industrial and user communities.Besides invited talks by Buchberger, Monagan, OmodeoandHong, the volume contains 28 contributions, carefullyselected by a highly competent international programcommittee from a total of 56 submissions.978-3-540-57235-0978-3-540-47985-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 動物 時間: 2025-3-22 02:56 作者: 思想流動 時間: 2025-3-22 06:46
Die Schwangerschaftsver?nderungen general reduces models by a factor of two to three, compared to a direct representation in the Mathematica computer algebra language. Also, we found that multiple inheritance from orthogonal classes facilitates re-use and maintenance of application models.作者: MURKY 時間: 2025-3-22 09:45 作者: Derogate 時間: 2025-3-22 14:32
Integers, the IF and GOTO statements,ted on Macintosh (and will soon be transported on SUN workstations)..The system should also allow an easy integration of theorem provers with symbolic computation systems..Several running examples in classical and non-classical logics show evidence of the capabilities of the system. In particular, w作者: Derogate 時間: 2025-3-22 17:46
Design and Implementation of Symbolic Computation SystemsInternational Sympos作者: Paleontology 時間: 2025-3-22 21:15
Sketching concepts and computational model of TROLL light,ptions (or templates as they are called in TROLL .) we explain how single states of an object community are constructed. By parallel occurrence of a finite set of events the states of object communities change. The object community itself is regarded as a graph where the nodes are the object communi作者: 陪審團 時間: 2025-3-23 02:04 作者: 漂泊 時間: 2025-3-23 09:16 作者: Arctic 時間: 2025-3-23 10:38 作者: 細胞 時間: 2025-3-23 14:44
Design and Implementation of Symbolic Computation Systems978-3-540-47985-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: MOT 時間: 2025-3-23 21:12
Gelenknahe Osteoporose beim Rheumatikerle digits, enhanced condition for exiting the partial cosequence computation, and approximative GCD computation. The combined effect of these improvements is an experimentally measured speed-up by a factor of 2 over the currently used implementation.作者: verdict 時間: 2025-3-24 01:46
Libido, Orgasmus und Kohabitationd 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.作者: Ethics 時間: 2025-3-24 03:22
https://doi.org/10.1007/BFb0013162Algebraic Manipulation; Automatisches Schlie?en; Geometric Modelling; Geometrisches Modellieren; Hardwar作者: NOVA 時間: 2025-3-24 10:13 作者: 敲竹杠 時間: 2025-3-24 13:40
Klaus M. Peters,Dietmar P. K?nigion mark. The content of my talk is my personal answer to this question..We start from analyzing what it means to do mathematics and introduce what we call the “creativity spirale in mathematics”: “Doing mathematics”, in my view, is iterating the cycle “observation — proof — programming — applicatio作者: contrast-medium 時間: 2025-3-24 16:37 作者: Lipoprotein(A) 時間: 2025-3-24 21:38
https://doi.org/10.1007/978-3-7985-1825-4iscourse (UoD) as a system of concurrently existing and interacting objects, i.e., an object community..The first part of the present paper introduces the various language concepts offered by TROLL .. TROLL . objects have observable properties modeled by attributes, and the behavior of objects is de作者: 得體 時間: 2025-3-25 01:38 作者: 大廳 時間: 2025-3-25 04:58 作者: Defiance 時間: 2025-3-25 07:31 作者: 傳染 時間: 2025-3-25 12:47 作者: 哎呦 時間: 2025-3-25 18:45
Qualitative Comparative Analysis,ntegers modulo ., by substituting random numbers for variables, and mapping constants modulo .. This idea is exploited in specific algorithms in computer algebra systems, e.g. algorithms for polynomial greatest common divisors. It is also used as a heuristic to speed up other calculations. But none 作者: Basal-Ganglia 時間: 2025-3-25 20:08
Klaus Backhaus,Bernd Erichson,Rolf Weiberbetween types. In such a type system it will be frequently the case that there are different ways of building coercions between types. An important requirement is that all coercions between two types coincide, a property which is called ...We will prove a coherence theorem for a formal type system h作者: 拋物線 時間: 2025-3-26 03:58 作者: 大猩猩 時間: 2025-3-26 06:29
Klaus Backhaus,Bernd Erichson,Rolf Weibere for the design and systematic development of a system for symbolic computing. This paper describes ., a language for giving modular and well-structured specifications of such domains and particularly of “mathematical objects”. A novel framework for algebraic specification involving so-called “unif作者: Asymptomatic 時間: 2025-3-26 11:24 作者: lattice 時間: 2025-3-26 15:48
Die Schwangerschaftsver?nderungene 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作者: isotope 時間: 2025-3-26 18:11 作者: 努力趕上 時間: 2025-3-27 00:52 作者: Crayon 時間: 2025-3-27 02:37
Declarations and Specifications,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 作者: 發(fā)起 時間: 2025-3-27 05:23
Integers, the IF and GOTO statements,d developed from the Calculus of Constructions (Coquand and Huet)..Its abilities are independent of the logic and the calculus used. It is therefore possible to present and combine proofs coming from any theorem prover. The user may define the full graphic presentation of proofs, formulas,... he wis作者: prostatitis 時間: 2025-3-27 10:16
The COMMON and EQUIVALENCE statement, In this paper, we extend it to the domain .. of finite symbolic trees with real numbers as leaves, that is the integration of the domain of reals with the domain of finite Herbrand trees. In the extended language, a system of constraints over the new domain is decided by first decomposing equations作者: Aspirin 時間: 2025-3-27 16:54 作者: Banquet 時間: 2025-3-27 18:03 作者: medium 時間: 2025-3-28 00:27 作者: 擔(dān)心 時間: 2025-3-28 02:13 作者: 急急忙忙 時間: 2025-3-28 08:13 作者: ENDOW 時間: 2025-3-28 13:14
Mathematica: A system for doing mathematics by computer?,ion mark. The content of my talk is my personal answer to this question..We start from analyzing what it means to do mathematics and introduce what we call the “creativity spirale in mathematics”: “Doing mathematics”, in my view, is iterating the cycle “observation — proof — programming — applicatio作者: 補充 時間: 2025-3-28 16:44 作者: 陳腐思想 時間: 2025-3-28 19:23 作者: 難管 時間: 2025-3-29 01:46 作者: Erythropoietin 時間: 2025-3-29 04:10
Improving the multiprecision Euclidean algorithm,le digits, enhanced condition for exiting the partial cosequence computation, and approximative GCD computation. The combined effect of these improvements is an experimentally measured speed-up by a factor of 2 over the currently used implementation.作者: 的闡明 時間: 2025-3-29 09:50
Storage allocation for the Karatsuba integer multiplication algorithm,t). We give sharp upper and lower bounds for the amount of auxiliary storage required and discuss implementation issues. Since we must never allocate too few memory cells, an asymptotic formula is not sufficient. The bounds are 2(.?4 + 3?log.(.?3)?) and 2(.?6 + 2?log.(.?2)?), respectively. The formu作者: 過份好問 時間: 2025-3-29 15:12 作者: hardheaded 時間: 2025-3-29 17:47
Gauss: a parameterized domain of computation system with support for signature functions,ntegers modulo ., by substituting random numbers for variables, and mapping constants modulo .. This idea is exploited in specific algorithms in computer algebra systems, e.g. algorithms for polynomial greatest common divisors. It is also used as a heuristic to speed up other calculations. But none 作者: 愚蠢人 時間: 2025-3-29 21:45 作者: 玷污 時間: 2025-3-30 03:02
Subtyping inheritance in languages for symbolic computation systems,s problems still exist in object-oriented languages, due to the interaction between polymorphism and method redefinition. Here a mechanism of subtyping inheritance is presented, in order to propose a solution of these problems. A subtyping inheritance mechanism (.) is defined by deriving from the ch作者: 漫不經(jīng)心 時間: 2025-3-30 05:39 作者: Blood-Clot 時間: 2025-3-30 11:52
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
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
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 作者: 脊椎動物 時間: 2025-3-31 01:58
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 作者: 正式演說 時間: 2025-3-31 11:23 作者: 俗艷 時間: 2025-3-31 13:23 作者: surrogate 時間: 2025-3-31 19:14
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
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.作者: 吵鬧 時間: 2025-4-1 04:05
Declarations and Specifications,g a finite family of syntactic substitutions that generate the space of all solutions to .. In this sense, one has a unification algorithm. Concerning (2), a technique is provided for reducing it to a sub-problem of (1) for which a decomposition method is available.作者: 為現(xiàn)場 時間: 2025-4-1 06:21
Mathematica: A system for doing mathematics by computer?,tle in some simple forms of proof. However, Mathematica does not yet seem to be the right setting for proving in the broad sense of the word as understood by the mathematics community. We give some arguments for this and develop some ideas how a future system for doing mathematics might look like.作者: 莎草 時間: 2025-4-1 10:52 作者: 知道 時間: 2025-4-1 14:50 作者: 有角 時間: 2025-4-1 21:35 作者: 抱怨 時間: 2025-4-1 23:02
0302-9743 ), held in Gmunden,Austria, in September 1993.The growing importance of systems for symbolic computationhas greatly influenced the decision of organizing this thirdconference in the series: DISCO ‘93 focuses mainly on themost innovative methodological and technological aspects ofthe design and imple作者: 奇怪 時間: 2025-4-2 04:31 作者: 發(fā)起 時間: 2025-4-2 10:39
Klaus Backhaus,Bernd Erichson,Rolf Weiberquirement is that all coercions between two types coincide, a property which is called ...We will prove a coherence theorem for a formal type system having several possibilities of coercions covering many important examples. Moreover, we will give some informal reasoning why the formally defined restrictions can be satisfied by an actual system.作者: 碎片 時間: 2025-4-2 11:32
https://doi.org/10.1007/978-1-4471-3014-7he introduction of metaclasses, facilitates the task, by allowing the inference of type classes. By means of type classes and existential types we construct subtype relations without involving coercions.作者: Torrid 時間: 2025-4-2 18:40
Proving the correctness of algebraic implementations by the ISAR system,fication to be implemented, a concrete specification used as a basis for the implementation and an implementation construction. If all steps of the (interactive) proof procedure are performed the system has proved the correctness of the implementation step.作者: 裁決 時間: 2025-4-2 21:02 作者: 易彎曲 時間: 2025-4-3 01:46 作者: 玉米棒子 時間: 2025-4-3 07:19
Subtyping inheritance in languages for symbolic computation systems,aracteristics of a presented model of subtyping. As the base of the subtyping rule, the monotonic (or covariant) rule is chosen. Once it is supported by the programming language of a symbolic computation system, our mechanism allows for a safe treatment of polymorphism induced by inheritance.作者: 充滿人 時間: 2025-4-3 10:51
Extending RISC-CLP(,) to handle symbolic functions, into a tree-solved form produced by an adapted unification algorithm. Then, polynomial real constraints are decided by the partial cylindrical algebraic decomposition method and a solution to the original system is constructed.作者: 欺騙手段 時間: 2025-4-3 12:19 作者: 四溢 時間: 2025-4-3 16:49
