A mode analyzing algebraic manipulation program

Authors:
Anthony C. Hearn
Affiliations:
University of Utah
Venue:
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
Year:
1974

Citing 6
Cited 1

The treatment of data types in EL1

Communications of the ACM
Extended polynomial algorithms

ACM '73 Proceedings of the ACM annual conference
REDUCE 2: A system and language for algebraic manipulation

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Algebraic algorithm descriptions as programs

ACM SIGSAM Bulletin
Informal introduction to ALGOL 68

Informal introduction to ALGOL 68
Chapter II: Notes on data structuring

Structured programming

Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new version of the REDUCE program for algebraic manipulation which performs a complete mode analysis of each command as a separate extension of the parse is presented. As a result, programs become more efficient and are easier to write and debug because the semantic error checking is more complete.