The algorithm description language ALDES (report)

Authors:
Rüdiger G. K. Loos
Affiliations:
Universität, Postfach, W. Germany
Venue:
ACM SIGSAM Bulletin
Year:
1976

Citing 0
Cited 11

Converting SAC-2 code to lisp

ACM SIGSAM Bulletin
On the application of Buchberger's algorithm to automated geometry theorem proving

Journal of Symbolic Computation
A knowledge-based system for computer algebra

ACM SIGSAM Bulletin
Automated geometry theorem proving using Buchberger's algorithm

SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
An algebraic approach to unification under associativity and commutativity

Journal of Symbolic Computation
On the multi-threaded computation of integral polynomial greatest common divisors

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Heuristic search and pruning in polynomial constraints satisfaction

Annals of Mathematics and Artificial Intelligence
Cited References

Computer algebra handbook
SYPAC: a pascal based computer algebra system for micro-computers

ACM SIGSAM Bulletin
Some reduction strategies for algebraic term rewriting

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.01

Visualization

Abstract

ALDES is a formalization of the method to describe algorithms used in Knuth's books. The largest documentation of algebraic algorithms, Collins' SAC system for Computer Algebra, is written in this language. In contrast to PASCAL it provides automatic storage deallocation. Compared to LISP equal emphasis was placed on efficiency of arithmetic, list processing, and array handling. To allow the programmer full control of efficiency all mechanisms of the system are accessible to him. Currently ALDES is available as a preprocessor to ANSI Fortran, using no additional primitives.