Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1996: Rewriting Techniques and Applications pp 412–415Cite as

ReDuX 1.5: New facets of rewriting

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahlem Ben Cherifa and Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137–159, 1987.

    Article  Google Scholar 

  2. Leo Bachmair, Nachum Dershowitz, and David A. Plaisted. Completion without failure. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2 of Rewriting Techniques, chapter 1. Academic Press, 1989.

    Google Scholar 

  3. Reinhard Bündgen, Wolfgang Küchlin, and Werner Lauterbach. Verification of the Sparrow processor. In IEEE Symposium and Workshop on Engineering of Computer-Based Systems. IEEE Press, 1996.

    Google Scholar 

  4. Reinhard Bündgen and Werner Lauterbach. Experiments with partial evaluation domains for rewrite specifications. In 11th Workshop on Abstract Data Types, 1996. (Proc. WADT'95, Oslo, N, September 1995, to appear).

    Google Scholar 

  5. University of California, Berkeley, CA. Berkeley Logic Interchange Format (BLIF), July 1992.

    Google Scholar 

  6. Reinhard Bündgen. Reduce the redex → ReDuX. In Claude Kirchner, editor, Rewriting Techniques and Applications (LNCS 690). Springer-Verlag, 1993.

    Google Scholar 

  7. Reinhard Bündgen. On pots, pans and pudding or how to discover generalized critical pairs. In Alan Bundy, editor, 12th International Conference on Automated Deduction, (LNCS 814). Springer-Verlag, 1994.

    Google Scholar 

  8. Reinhard Bündgen. Combining computer algebra and rule based reasoning. In Integrating Symbolic Mathematical Computation and Artificial Intelligence. Springer-Verlag, 1995.

    Google Scholar 

  9. Reinhard Bündgen. Preserving confluence for rewrite systems with built-in operations. In Nachum Dershowitz and Naomi Lindenstrauss, editors, Conditional and Typed Rewriting Systems (LNCS 968). Springer-Verlag, 1995.

    Google Scholar 

  10. George E. Collins and Rüdiger G. K. Loos. Specification and index of SAC-2 algorithms. Technical Report 90-4, Wilhelm-Schickard-Institut für Informatik, Tübingen, 1990.

    Google Scholar 

  11. Wolfgang Küchlin. A generalized Knuth-Bendix algorithm. Technical Report 86-01, Mathematics, Swiss Federal Institute of Technology (ETH), CH-8092 Zürich, Switzerland, January 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, D-72076, Tübingen

    Reinhard Bündgen, Carsten Sinz & Jochen Walter

Authors
  1. Reinhard Bündgen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carsten Sinz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jochen Walter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Harald Ganzinger

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bündgen, R., Sinz, C., Walter, J. (1996). ReDuX 1.5: New facets of rewriting. In: Ganzinger, H. (eds) Rewriting Techniques and Applications. RTA 1996. Lecture Notes in Computer Science, vol 1103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61464-8_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-61464-8_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61464-7

  • Online ISBN: 978-3-540-68596-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation