Conferences in DBLP
Michael J. O'Donnell Term-Rewriting Implementation of Equational Logic Programming. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:1-12 [Conf ] Robert Strandh Optimizing Equational Programs. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:13-24 [Conf ] Stéphane Kaplan A Compiler for Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:25-41 [Conf ] Ursula Martin How to Choose Weights in the Knuth Bendix Ordering. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:42-53 [Conf ] Paul Walton Purdom Jr. Detecting Looping Simplifications. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:54-61 [Conf ] Eric Sopena Combinatorial Hypermap Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:62-73 [Conf ] Craig C. Squier , Friedrich Otto Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:74-82 [Conf ] Jos C. M. Baeten , Jan A. Bergstra , Jan Willem Klop Term Rewriting Systems with Priorities. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:83-94 [Conf ] Max Dauchet , Francesco De Comité A Gap Between Linear and Non Linear Term-Rewriting Systems (1). [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:95-104 [Conf ] Annie Despland , Monique Mazaud , Raymond Rakotozafy Code Generator Generation Based on Template-Driven Target Term Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:105-120 [Conf ] M. Benois Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:121-132 [Conf ] Klaus Madlener , Friedrich Otto Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:133-144 [Conf ] Friedrich Otto Some Results about Confluence on a Given Congruence Class. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:145-155 [Conf ] Richard Göbel Ground Confluence. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:156-167 [Conf ] Zhenyu Qian Structured Contextual Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:168-179 [Conf ] Hélène Kirchner Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:180-191 [Conf ] Leo Bachmair , Nachum Dershowitz Completion for Rewriting Modulo a Congruence. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:192-203 [Conf ] Hans-Jürgen Bürckert , Alexander Herold , Manfred Schmidt-Schauß On Equational Theories, Unification and Decidability. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:204-215 [Conf ] Jean H. Gallier , Wayne Snyder A General Complete E -Unification Procedure. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:216-227 [Conf ] Pierre Réty Improving Basic Narrowing Techniques. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:228-241 [Conf ] Peter Padawitz Strategy-Controlled Reduction and Narrowing. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:242-255 [Conf ] Christine Choppy , Stéphane Kaplan , Michèle Soria Algorithmic Complexity of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:256-273 [Conf ] R. Ramesh , I. V. Ramakrishnan Optimal Speedups for Parallel Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP ] RTA, 1987, pp:274-285 [Conf ]