International Symposium on Symbolic and Algebraic Manipulation

Symbolic and Algebraic Computation pp 503-513

Symbolic computing with compression of data structures: General observations, and a case study

  • J. A. Campbell
  • Simon
12. Languages And Designs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 72)

Abstract

Data structures used by large symbolic computing systems tend to be fixed in form, and unable to change to reflect special symmetries or properties of individual computations. We examine the consequences of the view that the first step in a symbolic computation can be the analysis of the problem to be solved, to determine what is the most compact practical data structure for that problem. General principles of such an analysis are presented, and are then applied to a particular problem in differentiation which has caused difficulties in storage to some traditional large systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1979

Authors and Affiliations

  • J. A. Campbell
    • 1
  • Simon
    • 2
  1. 1.Department of Computer ScienceUniversity of ExeterExeterEngland
  2. 2.Department of MathematicsUniversity of NewcastleAustralia

Personalised recommendations