Skip to main content
SpringerLink
Log in

Combinatory models and symbolic computation

  • Conference paper
  • First Online:
Book cover Design and Implementation of Symbolic Computation Systems (DISCO 1992)

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

  • 130 Accesses

Abstract

We introduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of algebraic computation and on an other level approximate computation is represented. Furthermore programs are themselves algebraic expressions. Therefore it is possible to algebraically manipulate programs of symbolic and numerical computation, thus providing symbolic computation with a firm semantic foundation and giving a natural model for mixed symbolic-numerical computation. We illustrate these facts with examples.

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

  1. Aberer, K. (1990). Normal Forms in Function Fields. Proceedings ISSAC '90, 1–7.

    Google Scholar 

  2. Aberer, K. (1991): Combinatory Differential Fields and Constructive Analysis. ETH-Thesis, 9357.

    Google Scholar 

  3. Aberer, K. (1991): Combinatory Differential Fields: An Algebraic Approach to Approximate Computation and Constructive Analysis. TR-91-061, International Computer Science Institute, Berkeley.

    Google Scholar 

  4. Aberer, K., Codenotti, B. (1992). Towards a Complexity Theory of Approximation. TR-92-012, International Computer Science Institute, Berkeley.

    Google Scholar 

  5. Barendregt, H. (1977): The type free lambda calculus. Handbook of Mathematical Logic, ed. Jon Barwise, North Holland.

    Google Scholar 

  6. [Blum et al., 1989] Blum, L., Shub, M., Smale, S. (1989). On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness. Recursive Functions and Universal Machines, Bulletin of AMS, Vol. 21, No. 1.

    Google Scholar 

  7. Buchberger, B., Collins, B., Loos, R. (1983). Computer Algebra-Symbolic and Algebraic Computation. Springer, Wien, New York.

    Google Scholar 

  8. Davenport, J.H., Siret, Y. and Tournier, (1988). Computer Algebra. Academic Press, N. Y..

    Google Scholar 

  9. di Primo, B., (1991). Nichtstandard Erweiterungen von Differentialkörpern. ETH-Thesis, 9582.

    Google Scholar 

  10. Engeler, E., (1981). Metamathematik der Elementarmathematik. Springer Verlag.

    Google Scholar 

  11. Engeler, E. (1981). Algebras and Combinators. Algebra Universalis, 389–392.

    Google Scholar 

  12. Engeler, E. (1988). A Combinatory Representation of Varieties and Universal Classes. Algebra Universalis, 24.

    Google Scholar 

  13. Engeler, E. (1990). Combinatory Differential Fields. Theoretical Computer Science 72, 119–131.

    Google Scholar 

  14. Fehlmann, T. (1981). Theorie und Anwendung des Graphmodells der kombinatorischen Logik. Berichte des Instituts für Informatik der ETH 41.

    Google Scholar 

  15. Kaplansky, I. (1957). An Introduction to Differential Algebra. Paris:Hermann.

    Google Scholar 

  16. Kaucher, E. (1983): Solving Function Space Problems with Guaranteed Close Bounds. In Kulisch, U. and Miranker, W.L.: A New Approach to Scientific Computation, Academic Press, New York, p 139–164.

    Google Scholar 

  17. Mäder, R. (1986). Graph Algebras, Algebraic and Denotational Semantics. ETH-Report 86-04.

    Google Scholar 

  18. Pour-El, E., Richards, I.J. (1989). Computability in Analysis and Physics. Springer.

    Google Scholar 

  19. Risch, R. (1969). The Problem of Integration in Finite Terms. Transactions AMS, Vol. 139, p. 167–189.

    Google Scholar 

  20. Stetter, H.J., (1988). Inclusion Algorithms with Functions as Data. Computing, Suppl. 6, p. 213–224.

    Google Scholar 

  21. Traub, J.F., Wasilkowski G.W., Wozniakowski H., (1988). Information Based Complexity. Academic Press, New York.

    Google Scholar 

  22. Weihrauch, K. (1980). Rekursionstheorie und Komplexitätstheorie auf effektiven CPO-S. Informatikberichte Fern Universität Hagen, 9/1980.

    Google Scholar 

  23. Weissinger, J. (1988). A Kind of Difference Methods for Enclosing Solutions of Ordinary Linear Boundary Value Problems. Computing, Suppl. 6, 23–32.

    Google Scholar 

  24. Wolfram, S. (1988). Mathematica. Addison-Wesley Publishing Company.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Computer Science Institute, 1947 Center Street, 94704, Berkeley, CA, USA

    Karl Aberer

Authors
  1. Karl Aberer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Fitch

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aberer, K. (1993). Combinatory models and symbolic computation. In: Fitch, J. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1992. Lecture Notes in Computer Science, vol 721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57272-4_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-57272-4_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57272-5

  • Online ISBN: 978-3-540-48031-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation