Advertisement

An order-sorted approach to algebraic computation

  • Anthony C. Hearn
  • Eberhard Schrüfer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 722)

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.

Keywords

Algebraic Computation Type Domain Default Representation Symbolic Mode Current Prototype 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    G. Birkhoff and J.D. Lipson, Heterogeneous Algebras, Journal of Combinatorial Theory, 8:115–133, 1970Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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. 429Google Scholar
  6. 6.
    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, 1990Google Scholar
  7. 7.
    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, UKGoogle Scholar
  8. 8.
    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–274CrossRefGoogle Scholar
  9. 9.
    A.C. Hearn, A Mode Analyzing Algebraic Manipulation Program, Proc. ACM '74, pp. 722–724, ACM (1974)Google Scholar
  10. 10.
    R. Jenks, R. Sutor, AXIOM The Scientific Computation System, Springer (1992)Google Scholar
  11. 11.
    D. E. Monarchiand G. I. Puhr, A Research Topology for Object-oriented Analysis and Design, Comm. ACM, 35(9):35–47, September 1992CrossRefGoogle Scholar
  12. 12.
    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. 612Google Scholar
  13. 13.
    R. E. Zippel. The Weyl Computer Algebra Substrate, Technical Report 90-1077, Dept. Computer Science, Cornell University, Ithaca, NY, 1990Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Anthony C. Hearn
    • 1
  • Eberhard Schrüfer
    • 2
  1. 1.RANDSanta Monica
  2. 2.GMDSankt AugustinGermany

Personalised recommendations