Skip to main content

Application of a structured LISP system to computer algebra

  • Applications And Systems
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

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

Included in the following conference series:

  • 151 Accesses

Abstract

A new LISP token-reader, interfaced with an hierarchical name-space organisation has been implemented and used as a structuring tool for large LISP applications which demand high speed execution. The potential of this approach for the improved implementation of REDUCE 3 will be discussed.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hearn, A.C. (ed) Reduce Users manual, Version 3.2, The Rand Corporation, Santa Monica, California, April 1983.

    Google Scholar 

  2. Smit, J. O. Herrmann, S.H. Gerez, R. Luchtmeijer, R.J. Mulder and L. Spaanenburg, “Syntactic and Semantic Definition of MoDL”, In: “The Integrated Circuit Design Book”, P. de Wilde, (Ed.), Delft University Press, The Netherlands, ISBN 90-6275-246-2.

    Google Scholar 

  3. J. Smit, J., B.J.F. van Beijnum, S.H. Gerez and R.J. Mulder, “Proving Correctness of Digital Designs in the Multidimen-sional Design Space”, Proceedings of the IFIP Working Conference: “From HDL Descriptions to Guaranteed Correct Circuit Designs”, North Holland, September 1986.

    Google Scholar 

  4. Steele, G.L. Common LISP Manual, Digital Press, Cambridge, Massatuchets.

    Google Scholar 

  5. Gutknecht, J., “Separate Compilation in Modula-2: An Approach to Efficient Symbol Files”, IEEE Software, Nov. 1986, pp 29–38.

    Google Scholar 

  6. Goldberg, A. and D. Robson, “Smalltalk-80 The Language and its implementation”. Addison-Wesley, Reading Mass., ISBN 0-201-11371-6, 1983.

    Google Scholar 

  7. Andelson-Velskii, G.M. and E.M. Landis, “Soviet Math. #3”, pp 1259–1263.

    Google Scholar 

  8. Abdali S.K., G.W. Cherry, N. Soiffer, “An object oriented approach to algebra system design”. Proc. of the 1986 Sympo-sium on Symbolic and Algebraic Computation, Symsac '86, July 21–23, Waterloo, Ontario, pp 100–106.

    Google Scholar 

  9. Bradford, R.J., A.C. Hearn, J.A. Padget and E. Schrufer, “Enlarging the REDUCE Domain of Computation”, Proc. of the 1986 Symposium on Symbolic and Algebraic Computation, Symsac '86, July 21–23, Waterloo, Ontario, pp 100–106.

    Google Scholar 

  10. Matula, D.W. and Kornerup, P. “Finite Precision Rational Arithmetic: Slash Number Systems”, IEEE Transactions on Computers, C-34, Vol. 1, No 1, January 1985, pp 3–18.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smit, J., Gerez, S.H., Mulder, R. (1989). Application of a structured LISP system to computer algebra. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics