Author:
Bündgen Reinhard,Eckhardt Hasko
Reference17 articles.
1. Reinhard Bündgen and Wolfgang Küchlin. Computing ground reducibility and inductively complete positions. In Nachum Dershowitz, editor, Rewriting Techniques and Applications (LNCS 355), pages 59–75, Springer-Verlag, 1989.
2. Reinhard Bündgen. Applying term rewriting methods to finite groups. In H. Kirchner and W. Wechler, editors, Algebraic and Logic Programming (LNCS 463), Springer-Verlag, 1990.
3. Reinhard Bündgen. The ReDuX System Documentation. Technical Report 91-5, Wilhelm-Schickard-Institut, Universität Tübingen, D-7400 Tübingen, 1991.
4. Reinhard Bündgen. Term Completion Versus Algebraic Completion. PhD thesis, Universität Tübingen, D-7400 Tübingen, Germany, May 1991. (reprinted as report WSI 91-3).
5. Hubert Comon. An effective method for handling initial algebras. In J. Grabowski, P. Lescanne, and W. Welcher, editors, Algebraic and Logic Programming (LNCS 343), Springer-Verlag, 1988.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Reduce the redex → ReDuX;Rewriting Techniques and Applications;1993
2. Reduce the redex → ReDuX;Rewriting Techniques and Applications;1993