Abstract
The ReDuX-system is a work-bench for programming and experimenting with term rewriting systems. It is focused towards the implementation of completion procedures with special emphasis on inductive completion. From the programmer's point of view ReDuX provides a large library of data types and algorithms (over 450) which allows for high level programming. The experimentalist also finds a collection of ready-to-run programs (see Table 1, and [WB91]). ReDuX has been developed as an extension of the TC- and IC-sytems [Küc82a, Bün87] and has been used as a research tool over the last years. For the last two years it has also been employed as a tutorial system for courses on term rewriting systems at the University of Tübingen.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Reinhard Bündgen and Hasko Eckhardt. A fast algorithm for ground normal form analysis. In H. Kirchner and G. Levi, editors, Algebraic and Logic Programming, pages 291–305, 1992.
Reinhard Bündgen and Wolfgang Küchlin. Computing ground reducibility and inductively complete positions. In Nachum Dershowitz, editor, Rewriting Techniques and Applications, pages 59–75. Springer-Verlag, 1989.
Reinhard Bündgen. Design, implementation, and application of an extended ground-reducibility test. Master's thesis, Computer and Information Sciences, University of Delaware, Newark, DE 19716, 1987.
Reinhard Bündgen. Applying term rewriting methods to finite groups. In H. Kirchner and W. Wechler, editors, Algebraic and Logic Programming. Springer-Verlag, 1990.
Reinhard Bündgen. Completion of integral polynomials by AC-term completion. In Stephen M. Watt, editor, International Symposium on Symbolic and Algebraic Computation, pages 70–78, 1991.
Reinhard Bündgen. The ReDuX system documentation. Technical Report 91-5, Wilhelm-Schickard-Institut, Universität Tübingen, D-7400 Tübingen, 1991.
Reinhard Bündgen. Simulating Buchberger's algorithm by Knuth-Bendix completion. In Ronald V. Book, editor, Rewriting Techniques and Applications, pages 386–397. Springer-Verlag, 1991.
Reinhard Bündgen. Term Completion Versus Algebraic Completion. PhD thesis, Universität Tübingen, D-7400 Tübingen, Germany, May 1991.
Reinhard Bündgen. Test sets for AC-ground reducibility. Unpublished manuscript, Universität, Tübingen, 1992.
G. E. Collins. ALDES and SAC-2 now available. SIGSAM Bull., 12(2):19, 1980.
Gérard Huet and Jean-Marie Hullot. Proofs by induction in equational theories with constructors. In Proc. 21st FoCS, pages 96–107, Los Angeles, CA, 1980.
Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra. Pergamon Press, 1970.
D. Kapur, P. Narendran, and G. Sivakumar. A path ordering for proving termination of term rewriting systems. In Mathematical Foundation of Software Developement, pages 173–187. Springer-Verlag, 1985.
Deepak Kapur, Paliath Narendran, and Hantao Zhang. Proof by induction using test sets. In J. Siekmann, editor, 8th International Conference on Automated Deduction, pages 99–117. Springer-Verlag, 1986.
Wolfgang Küchlin. An implementation and investigation of the Knuth-Bendix completion algorithm. Master's thesis, Informatik I, Universität Karlsruhe, D-7500 Karlsruhe, W-Germany, 1982.
Wolfgang Küchlin. Some reduction strategies for algebraic term rewriting. ACM SIGSAM Bull., 16(4):13–23, November 1982.
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.
Wolfgang Küchlin. Inductive completion by ground proof transformation. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2 of Rewriting Techniques, chapter 7. Academic Press, 1989.
Rüdiger G. K. Loos and George E. Collins. Revised report on the algorithm description language ALDES. Technical Report 92-14, Wilhelm-Schickard-Institut für Informatik, Tübingen, 1992.
Pierre Lescanne. Completion procedures as transition rules + control. In M. Diaz and F. Orejas, editors, TOPSOFT '89, pages 21–41. Springer-Verlag, 1989.
G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:223–264, 1981.
Jochen Walter and Reinhard Bündgen. The ReDuX user guide. Technical Report 91-9, Wilhelm-Schickard-Institut, Universität Tübingen, D-7400 Tübingen, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bündgen, R. (1993). Reduce the redex → ReDuX. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-662-21551-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56868-1
Online ISBN: 978-3-662-21551-7
eBook Packages: Springer Book Archive