Abstract
This paper presents the prototype design of an algebraic computation system that manipulates algebraic quantities as generic objects using order-sorted algebra as the underlying model. The resulting programs have a form that is closely related to the algorithmic description of a problem, but with the security of full type checking in a compact, natural style.
This work was supported in part by the U.S. National Science Foundation under Grant No. CCR-8910826.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S.K. Abdali, G.W. Cherry, N. Soiffer, An Object Oriented Approach to Algebra System Design, Proc. 1986 Sym. on Symbolic and Algebraic Computation, pp. 24–30, ACM (1986)
G. Birkhoff and J.D. Lipson, Heterogeneous Algebras, Journal of Combinatorial Theory, 8:115–133, 1970
R.J. Bradford, A.C. Hearn, J.A. Padget, E. Schrüfer, Enlarging the Reduce Domain of Computation, Proc. 1986 Sym. on Symbolic and Algebraic Computation, pp. 100–106, ACM (1986)
R. J. Fateman, Advances and Trends in the Design and Construction of Algebraic Manipulation Systems, Proc. International Sym. on Symbolic and Algebraic Computation, Tokyo, pp. 60–67, ACM (1990)
A. Fortenbacher, Efficient Type Inference and Coercion in Computer Algebra, Proc. International Sym. DISCO '90, pp. 56–60, Springer, Lecture Notes in Computer Science, vol. 429
J. Meseguer and J. Goguen, Order-sorted Algebra Solves the Constructor-selector, Multiple Representation and Coercion Problems, Technical Report SRI-CSL-90-06, SRI International, Computer Science Laboratory, 1990
J.A. Goguen, D.A. Wolfram, On Types and FOOPS, in W.K.R. Meersman, S. Khosla (editors), Object Oriented Databases: Analysis, Design and Construction, pp. 1–22, North Holland (1991), Proc, IFIP TC2 Conference, Windermere, UK
J.A. Goguen, J. Meseguer, Order-sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations, Theoretical Computer Science (1992), vol. 105, no.2, pp. 217–274
A.C. Hearn, A Mode Analyzing Algebraic Manipulation Program, Proc. ACM '74, pp. 722–724, ACM (1974)
R. Jenks, R. Sutor, AXIOM The Scientific Computation System, Springer (1992)
D. E. Monarchiand G. I. Puhr, A Research Topology for Object-oriented Analysis and Design, Comm. ACM, 35(9):35–47, September 1992
D.A. Wolfram, J.A. Goguen, A Sheaf Semantics for FOOPS Expressions, Proc. ECOOP'91 Workshop on Object-based Concurrent Computation Springer (1992), Lecture Notes in Computer Science, vol. 612
R. E. Zippel. The Weyl Computer Algebra Substrate, Technical Report 90-1077, Dept. Computer Science, Cornell University, Ithaca, NY, 1990
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hearn, A.C., Schrüfer, E. (1993). An order-sorted approach to algebraic computation. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013174
Download citation
DOI: https://doi.org/10.1007/BFb0013174
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57235-0
Online ISBN: 978-3-540-47985-7
eBook Packages: Springer Book Archive