Modern computer algebra systems (e.g. AXIOM) support a rich type system including parameterized data types and the possibility of implicit coercions between types. In such a type system it will be frequently the case that there are different ways of building coercions between types. An important req
Equality in Computer Algebra and Beyond
β Scribed by James H Davenport
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 284 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
Equality is such a fundamental concept in mathematics that, in fact, we seldom explore it in detail, and tend to regard it as trivial. When it is shown to be non-trivial, we are often surprised. As is often the case, the computerization of mathematical computation in computer algebra systems on the one hand, and mathematical reasoning in theorem provers on the other hand, forces us to explore the issue of equality in greater detail.
π SIMILAR VOLUMES
Computer-Algebra-Systeme erlauben die symbolische Umformung von Termen oder die Berechnung von Gleichungen ohne numerische Schritte. Eine offensichtliche Nutzung besteht etwa darin, lineare Gleichungssysteme, wie sie bei der Bilanzierung chemischer oder biotechnologischer Prozesse entstehen, algebra
September 12-16, 1983; at Gy6r, Hungary 'The J~nos Bolyai Mathematical Society intends to organize a "Colloquium on Algebra, Combinatorics and Logic in Computer Science" in the period 12-16, September 1983 at GySr (Hungary). The aim of the colloquium is to provide ground for the exchange of informat
This paper describes three algorithms for q-hypergeometric summation: β’ a multibasic analogue of Gosper's algorithm, β’ the q-Zeilberger algorithm, and β’ an algorithm for finding q-hypergeometric solutions of linear recurrences together with their Maple implementations, which is relevant both to pe