MACSYMA - the fifth year

ABSTRACT

MACSYMA is a large symbolic and algebraic manipulation system which has been under development at Project MAC, M.I.T. since 1969. We first discuss some of the design decisions, such as multiple representations, that led to the current system. We then give a brief description of the facilities of MACSYMA by dividing the system into seven packages: language and interactive facilities, general representation, rational function representation and related algorithms, the integration subsystem, the power series subsystem, the MACLISP system, and miscellaneous facilities.

REFERENCES

• 1: Berlekamp, E. R., "Factoring Polynomials over Large Finite Fields," Math. of Comp. vol. 24, no. 111, July 1970.
• 2: Bogen, R. A., et al, "MACSYMA Reference Manual," version 6, Project MAC, M.I.T., Cambridge, MA. Jan. 1974.
• 3: Bonneau, R. "Fast Polynomial Operations Using the Fast Fourier Transform," Project MAC, M.I.T., (to appear).
• 4: W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM (JACM), v.18 n.4, p.478-504, Oct. 1971 [doi>10.1145/321662.321664]
• 5: Brown, W. S., The ALTRAN User's Manual, Bell Telephone Labs, Murray Hill, N.J., 1973.
• 6: George E. Collins, The Calculation of Multivariate Polynomial Resultants, Journal of the ACM (JACM), v.18 n.4, p.515-532, Oct. 1971 [doi>10.1145/321662.321666]
• 7: Datamation, May, 1973.
• 8: Dowson, M., "How to get on the MAC/AI System," Memo 215, A. I. Lab, M.I.T., April, 1971.
• 9: Carl Engelman, The legacy of MATHLAB 68, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.29-41, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806265]
• 10: Richard J. Fateman, The user-level semantic matching capability in MACSYMA, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.311-323, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806300]
• 11: R. J. Fateman, ESSAYS IN ALGEBRAIC SIMPLIFICATION, Massachusetts Institute of Technology, Cambridge, MA, 1972
• 12: Fateman, R. J., "On the Computation of powers of sparse polynomials," Studies in Applied Mathematics (to appear).
• 13: Fateman, R. J., "On the multiplication of Poisson Series," Celestial Mechanics (to appear).
• 14: Genesereth, M. R., "A Grammar Primer for MACSYMA," Project MAC, M.I.T., July 1973.
• 15: W. M. Gentleman , S. C. Johnson, Analysis of algorithms, a case study: Determinants of polynomials, Proceedings of the fifth annual ACM symposium on Theory of computing, p.135-141, April 30-May 02, 1973, Austin, Texas, United States [doi>10.1145/800125.804044]
• 16: Hearn, A. C., "Reduce-2 User's Manual," Report UCP-19, University of Utah, March 1973.
• 17: Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
• 18: Lipson, J. D. "Symbolic Methods for the Computer Solution of Linear Equations with Applications to Flow Graphs," Proc. of the 1968 Summer Institute on Symbolic Math. Conf., R. Tobey (ed.) IBM, June 1969.
• 19: William A. Martin, Computer input/output of mathematical expressions, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.78-89, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806270]
• 20: W. A. Martin , R. J. Fateman, The MACSYMA system, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.59-75, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806267]
• 21: Millen, J. K., "CHARYBDIS: A LISP Program to Display Mathematical Expression on Typewriter-like Devices," Interactive Systems for Experimental Applied Mathematics, Academic Press, 1968, pp. 155--163.
• 22: Moon, D. et al. "MACLISP Reference Manual," Project MAC, M.I.T., 1974.
• 23: Joel Moses, Algebraic simplification: a guide for the perplexed, Communications of the ACM, v.14 n.8, p.527-537, Aug. 1971 [doi>10.1145/362637.362648]
• 24: Joel Moses, Symbolic integration: the stormy decade, Communications of the ACM, v.14 n.8, p.548-560, Aug. 1971 [doi>10.1145/362637.362651]
• 25: Moses, J., "Symbolic Integration," Technical Report 47, Project MAC, M.I.T., Dec. 1967.
• 26: Joel Moses, The integration of a class of special functions with the Risch algorithm, ACM SIGSAM Bulletin [doi>10.1145/1086780.1086781]
• 27: Moses, J., "MACSYMA Primer," Project MAC, M.I.T., 1973.
• 28: Joel Moses , David Y. Y. Yun, The EZ GCD algorithm, Proceedings of the annual conference, p.159-166, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805698]
• 29: Vaughan R. Pratt, Top down operator precedence, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.41-51, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512931]
• 30: Risch, R. H., "The Problem of Integration in Finite Terms," Trans. AMS, vol. 139, Mar. 1969, pp. 167--189.
• 31: Paul S. Wang, Automatic computation of limits, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.458-464, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806315]
• 32: Paul S. Wang , L. Preiss Rothschild, Factoring multivariate polynomials over the integers, ACM SIGSAM Bulletin [doi>10.1145/1086814.1086819]
• 33: P. S. Wang, EVALUATION OF DEFINITE INTEGRALS BY SYMBOLIC MANIPULATION, Massachusetts Institute of Technology, Cambridge, MA, 1971
• 34: Yun, D. Y. Y., "The Hensel Lemma in Symbolic Manipulation," Tech. Report, Project MAC, M.I.T. (to appear).
• 35: David Y. Y. Yun, On algorithms for solving systems of polynomial equations, ACM SIGSAM Bulletin [doi>10.1145/1086809.1086811]