Conferences in DBLP

Rewriting Techniques and Applications (RTA) (rta)
1985 (conf/rta/1985)

1. Bruno Buchberger
   Basic Features and Development of the Critical-Pair/Completion Procedure. [Citation Graph (0, 0)][DBLP]
   RTA, 1985, pp:1-45 [Conf]
   
2. Hantao Zhang, Jean-Luc Remy
   Contextual Rewriting. [Citation Graph (0, 0)][DBLP]
   RTA, 1985, pp:46-62 [Conf]
   
3. Ronald V. Book
   Thue Systems as Rewriting Systems. [Citation Graph (0, 0)][DBLP]
   RTA, 1985, pp:63-94 [Conf]
   
4. Friedrich Otto
   Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
   RTA, 1985, pp:95-106 [Conf]
   
5. Stavros S. Cosmadakis, Paris C. Kanellakis
   Two Applications of Equational Theories to Database Theory. [Citation Graph (0, 0)][DBLP]
   RTA, 1985, pp:107-123 [Conf]
   
6. Neil D. Jones, Peter Sestoft, Harald Søndergaard
   An Experiment in Partial Evaluation: The Generation of a Compiler Generator. [Citation Graph (0, 0)][DBLP]
   RTA, 1985, pp:124-140 [Conf]
   
7. Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne
   NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. [Citation Graph (0, 0)][DBLP]
   RTA, 1985, pp:141-157 [Conf]
   
8. Hassan Aït-Kaci
   Solving Type Equations by Graph Rewriting. [Citation Graph (1, 0)][DBLP]
   RTA, 1985, pp:158-179 [Conf]
   
9. Nachum Dershowitz
   Termination. [Citation Graph (2, 0)][DBLP]
   RTA, 1985, pp:180-224 [Conf]
   
10. Michaël Rusinowitch
    Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:225-240 [Conf]
    
11. Leo Bachmair, David A. Plaisted
    Associative Path Orderings. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:241-254 [Conf]
    
12. David Detlefs, Randy Forgaard
    A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:255-270 [Conf]
    
13. Christine Choppy, Colette Johnen
    PETRIREVE: Proving Petri Net Properties with Rewriting Systems. [Citation Graph (1, 0)][DBLP]
    RTA, 1985, pp:271-286 [Conf]
    
14. Sara Porat, Nissim Francez
    Fairness in Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:287-300 [Conf]
    
15. Jieh Hsiang
    Two Results in Term Rewriting Theorem Proving. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:301-324 [Conf]
    
16. Laurent Fribourg
    Handling Function Definitions through Innermost Superposition and Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:325-344 [Conf]
    
17. Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran
    An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:345-364 [Conf]
    
18. Katherine A. Yelick
    Combining Unification Algorithms for Confined Regular Equational Theories. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:365-380 [Conf]
    
19. Albrecht Fortenbach
    An Algebraic Approch to Unification Under Assoiativity and Commutativity. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:381-397 [Conf]
    
20. Stefan Arnborg, Erik Tidén
    Unification Problems with One-Sided Distributivity. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:398-406 [Conf]
    
21. Paul Walton Purdom Jr., Cynthia A. Brown
    Fast Many-to-One Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:407-416 [Conf]
    
22. Dan Benanav, Deepak Kapur, Paliath Narendran
    Complexity of Matching Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:417-429 [Conf]
    
23. Marek Zaionc
    The Set of Unifiers in Typed Lambda-Calculus as Regular Expression. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:430-440 [Conf]