Skip to main content
SpringerLink
Log in

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

  • 12. Languages And Designs
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (EUROSAM 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 72))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Campbell, J.A., SIGSAM Bull. A.C.M. 10 (40), 46 (1976)

    Google Scholar 

  • Campbell, J.A., Programming Language Systems (eds. M.C. Newey, R.B. Stanton and G.L. Wolfendale), pp. 61–70. Australian National University Press, Canberra (1978)

    Google Scholar 

  • Fitch, J.P., Herbert, P. and Norman, A.C., Proc. 1976 A.C.M. Symposium on Symbolic and Algebraic Computation (ed. R.D. Jenks), pp. 185–188. Yorktown Heights, N.Y. (1976)

    Google Scholar 

  • Harrington, R., Celest. Mech. 1, 200 (1969)

    Google Scholar 

  • Knuth, D.E., The Art of Computer Programming, vol. 1: Fundamental Algorithms (second edition), p. 454. Addison-Wesley, Reading, Massachusetts (1975)

    Google Scholar 

  • Richards, M., The BCPL Language Compiler. Cambridge University Press (1979)

    Google Scholar 

  • Sloane, N.J.A., Handbook of Integer Sequences and Series. Academic Press, N.Y. (1973). A new edition is in an advanced stage of preparation.

    Google Scholar 

  • Sundblad, Y., SIGSAM Bull. A.C.M., nr. 24, 18 (1972)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Exeter, EX4 4QL, Exeter, England

    J. A. Campbell

  2. Department of Mathematics, University of Newcastle, 2308, New South Wales, Australia

    Simon

Authors
  1. J. A. Campbell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edward W. Ng

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Campbell, J.A., Simon (1979). Symbolic computing with compression of data structures: General observations, and a case study. In: Ng, E.W. (eds) Symbolic and Algebraic Computation. EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09519-5_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-09519-5_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09519-4

  • Online ISBN: 978-3-540-35128-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation