This paper presents the prototype design of an algebraic computation system that manipulates algebraic quantities as generic objects using order-sorted algebra as the underlying model. The resulting programs have a form that is closely related to the algorithmic description of a problem, but with th
On Coherence in Computer Algebra
β Scribed by Andreas Weber
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 435 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
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 requirement is that all coercions between two types coincide, a property which is called coherence.
We will prove a coherence theorem for a formal type system having several possibilities of cuercions covering many important examples. Moreover, we will give some informal reasoning why the formally defined restrictions can be satisfied by an actual system.
π SIMILAR VOLUMES
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
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