Robert Moenck
Abstract
Virtually all algebraic manipulation systems are very large programs which can only be run on the largest computers, and even then press the limits of the machines resources [1]. I see this as the principal reason for the lack of popularity of algebraic manipulation; namely for many potential users the costs involved in running these programs do not outweigh their benefits. The motivation for this note is to stimulate discussion about the design of algebra systems, with a view to making them more economically viable.
- G. L. Steel, Jr.: Data Representations in PDP-10 MACLISP; Proc. 1977 MACSYMA Users Conf., NASA CP-2012, pp. 215--224.Google Scholar
- G. E. Collins: The SAC-1 Polynomial System; Tech Rept. #115, Computer Sciences Dept., Univ. Wisconsin, (March 1971).Google Scholar
- D. W. Clark & C. C. Green: An Empirical Study of List Structure in LISP; CACM, vol. 20, no. 2, (Feb. 1977), pp. 78--86. Google ScholarDigital Library
- Lauer & Saeman: Reference Count Overflow; SIGSAM Bulletin, vol. 10, no. 2 (May 1976), pp. 24--29. Google ScholarDigital Library
- D. E. Knuth: The Art of Computer Programming: Vol. I, Fundamental Algorithms, Addison-Wesley, Reading, Mass. pp. 348--349. Google ScholarDigital Library
- R. E. Griswold: The Macro Implementation of SNOBOL4; W. H. Freeman, San Francisco, Calif., 1972. Google ScholarDigital Library
Recommendations
Construction of quotient BCI(BCK)-algebra via a fuzzy ideal
The present paper gives a new construction of a quotient BCI(BCK)- algebra X/µ by a fuzzy ideal µ in X and establishes the Fuzzy Homomorphism Fundamental Theorem. We show that if µ is a fuzzy ideal (closed fuzzy ideal) of X. then X/µ is a commutative (...
Souslin algebra embeddings
AbstractA Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation theory ...
Comments