Conferences in DBLP

Rewriting Techniques and Applications (RTA) (rta)
1987 (conf/rta/87)

1. Michael J. O'Donnell
   Term-Rewriting Implementation of Equational Logic Programming. [Citation Graph (0, 0)][DBLP]
   RTA, 1987, pp:1-12 [Conf]
   
2. Robert Strandh
   Optimizing Equational Programs. [Citation Graph (0, 0)][DBLP]
   RTA, 1987, pp:13-24 [Conf]
   
3. Stéphane Kaplan
   A Compiler for Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   RTA, 1987, pp:25-41 [Conf]
   
4. Ursula Martin
   How to Choose Weights in the Knuth Bendix Ordering. [Citation Graph (0, 0)][DBLP]
   RTA, 1987, pp:42-53 [Conf]
   
5. Paul Walton Purdom Jr.
   Detecting Looping Simplifications. [Citation Graph (0, 0)][DBLP]
   RTA, 1987, pp:54-61 [Conf]
   
6. Eric Sopena
   Combinatorial Hypermap Rewriting. [Citation Graph (0, 0)][DBLP]
   RTA, 1987, pp:62-73 [Conf]
   
7. 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]
   
8. 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]
   
9. 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]
   
10. 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]
    
11. 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]
    
12. 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]
    
13. Friedrich Otto
    Some Results about Confluence on a Given Congruence Class. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:145-155 [Conf]
    
14. Richard Göbel
    Ground Confluence. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:156-167 [Conf]
    
15. Zhenyu Qian
    Structured Contextual Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:168-179 [Conf]
    
16. 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]
    
17. Leo Bachmair, Nachum Dershowitz
    Completion for Rewriting Modulo a Congruence. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:192-203 [Conf]
    
18. 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]
    
19. Jean H. Gallier, Wayne Snyder
    A General Complete E-Unification Procedure. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:216-227 [Conf]
    
20. Pierre Réty
    Improving Basic Narrowing Techniques. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:228-241 [Conf]
    
21. Peter Padawitz
    Strategy-Controlled Reduction and Narrowing. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:242-255 [Conf]
    
22. 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]
    
23. R. Ramesh, I. V. Ramakrishnan
    Optimal Speedups for Parallel Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:274-285 [Conf]