Toward a formal implementation of computer algebra

ABSTRACT

We consider in this paper the task of synthesizing an algebraic system. Today the task is significantly simpler than in the pioneer days of symbol manipulation, mainly because of the work done by the pioneers in our area, but also because of the progress in other areas of Computer Science. There is now a considerable collection of algebraic algorithms at hand and a much better understanding of data structures and programming constructs than only a few years ago.

REFERENCES

• 1: Backus, J., IMB Report RJ 1245 (19774), S.J. 1973.
• 2: Jenka, R. D., Proc. SIGPLAN, (Mar. 1974).
• 3: Strassen, V., Acta Inform. 1, (1972), 320--335.
• 4: Taraki, A., et al. Undecidable Theories. NH. 1953.
• 5: Knuth, D. E., Math. Sys. Th. 2, (1969), 122--145.
• 6: Hoare, C. A. R. Recursive Data Structures Stan-CS-73-400, Stanford University.
• 7: Anthony C. Hearn , Rüdiger G. K. Loos, Extended polynomial algorithms, Proceedings of the annual conference, p.147-152, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805696]
• 8: Redei, L., Algebra 1, Leipzig 1959.