ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The algorithm description language ALDES (report)
Full text PdfPdf (1.33 MB)
Source ACM SIGSAM Bulletin archive
Volume 10 ,  Issue 1  (February 1976) table of contents
Pages: 14 - 38  
Year of Publication: 1976
ISSN:0163-5824
Author
Rüdiger G. K. Loos  Universität, Postfach, W. Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Citation Count: 9
Additional Information:

abstract   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1093390.1093395
What is a DOI?

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.


CITED BY  9
Wolfgang Küchlin, On the multi-threaded computation of integral polynomial greatest common divisors, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.333-342, July 15-17, 1991, Bonn, West Germany
Hoon Hong, Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination, Papers from the international symposium on Symbolic and algebraic computation, p.177-188, July 27-29, 1992, Berkeley, California, United States
B. Kutzler , S. Stifter, Automated geometry theorem proving using Buchberger's algorithm, Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, p.209-214, July 21-23, 1986, Waterloo, Ontario, Canada
Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
R-M di Scala, SYPAC: a pascal based computer algebra system for micro-computers, ACM SIGSAM Bulletin, v.16 n.3, p.7-10, August 1982
Wolfgang Küchlin, Some reduction strategies for algebraic term rewriting, ACM SIGSAM Bulletin, v.16 n.4, p.13-23, November 1982
Jacques Calmet , Denis Lugiez, A knowledge-based system for computer algebra, ACM SIGSAM Bulletin, v.21 n.1, p.7-13, Feb. 1987
Lars Langemyr, Converting SAC-2 code to lisp, ACM SIGSAM Bulletin, v.20 n.4, p.11-13, Dec. 1986
Hoon Hong, Heuristic search and pruning in polynomial constraints satisfaction, Annals of Mathematics and Artificial Intelligence, v.19 n.3-4, p.319-334, 1997
Collaborative Colleagues:
Rüdiger G. K. Loos: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player