Skip to main content
SpringerLink
Log in

An abstract data type development of graded rings

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

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

  • 123 Accesses

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. W.W. Adams and A. Boyle, “Some Resulta on Gröbner Bases over Commutative Rings.” Journal of Symbolic Computation, (1992) 13, 473–484.

    Google Scholar 

  2. W.W. Adams, A. Boyle, and P. Loustaunau, “Transitivity for Weak and Strong Gröbner Bases,” Journal of Symbolic Computation, to appear.

    Google Scholar 

  3. W.W. Adams, A. Boyle, and P. Loustaunau, “An Algorithm for Computing Gröbner Bases,” to appear in the Proceedings of the Tenth Army Conference on Applied Mathematics and Computing.

    Google Scholar 

  4. D. Bayer and M. Stillman, “A Theorem on Refining Division Orders by the Reverse Lexicographic Order,” Duke Mathematical Journal, 55 (1987), pp. 321–328.

    Google Scholar 

  5. J. H. Davenport and B. M. Trager, “Scratchpad's View of Algebra I: Basic Commutative Algebra,” Disco'90, LNCS 429, Springer-Verlag, pp. 40–54, 1990.

    Google Scholar 

  6. J. H. Davenport, P. Gianni, and B. M. Trager, “Scratchpad's View of Algebra II: A Categorical View of Factoization,” Proceedings of ISSAC'91, ed. S.M. Watt, ACM Press, pp. 32–38, 1991.

    Google Scholar 

  7. P. Gianni, B. Trager, and G. Zacharias, “Gröbner Basis and Primary Decomposition of Polynomial Ideals,” Journal of Symbolic Computation, 6 (1988), pp. 148–168.

    Google Scholar 

  8. I. Van Horebeek and J. Lewi, “Algebraic Specifications in Software Engineering,” Springer-Verlag, 1989.

    Google Scholar 

  9. R. Jenks and R. Sutor, “Type Inference and Coercion Facilities in the Scratchpad II Interpretor,” SIGPLAN '87 Symposium in Interpreters and Interpretive Techniques, Sigplan Notices, Vol.22, No. 7, ACM Press, pp. 56–63, July, 1987.

    Google Scholar 

  10. R. Jenks, R. Sutor and S. Watt “Scratchpad II: An Abstract Datatype System for Mathematical Computation,” Trends in Computer Algebra, LNCS 296, Springer-Verlag, 1988, pp. 12–37.

    Google Scholar 

  11. T. Mora, “An Introduction to the Tangent Cone Algorithm,” preprint.

    Google Scholar 

  12. D. Spear, “A Constructive Approach to Commutative Ring Theory,” Proceedings 1977 MACSYMA User's Conference, pp. 369–376.

    Google Scholar 

  13. R.H. Zippel, “The Weyl Computer Algebra Substrate Manual,” Cornell University, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, George Mason University, 22030, Fairfax, Va.

    A. Goodloe & P. Loustaunau

Authors
  1. A. Goodloe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Loustaunau
    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

Goodloe, A., Loustaunau, P. (1993). An abstract data type development of graded rings. 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_35

Download citation

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

  • 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