Conferences in DBLP

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

1. José Meseguer
   Rewriting Logic and Maude: Concepts and Applications. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:1-26 [Conf]
   
2. Sophie Tison
   Tree Automata and Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:27-30 [Conf]
   
3. Nikolaj Bjørner, César Muñoz
   Absolute Explicit Unification. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:31-46 [Conf]
   
4. Frédéric Blanqui
   Termination and Confluence of Higher-Order Rewrite Systems. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:47-61 [Conf]
   
5. Eduardo Bonelli, Delia Kesner, Alejandro Ríos
   A de Bruijn Notation for Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:62-79 [Conf]
   
6. Evelyne Contejean, Antoine Coste, Benjamin Monate
   Rewriting Techniques in Theoretical Physics. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:80-94 [Conf]
   
7. Daniel J. Dougherty, Claudio Gutiérrez
   Normal Forms and Reduction for Theories of Binary Relations. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:95-109 [Conf]
   
8. Katrin Erk, Joachim Niehren
   Parallelism Constraints. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:110-126 [Conf]
   
9. Philippe de Groote
   Linear Higher-Order Matching Is NP-Complete. [Citation Graph (0, 0)][DBLP]
   RTA, 2000, pp:127-140 [Conf]
   
10. Felix Joachimski, Ralph Matthes
    Standardization and Confluence for a Lambda Calculus with Generalized Applications. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:141-155 [Conf]
    
11. Jordi Levy, Mateu Villaret
    Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:156-171 [Conf]
    
12. Markus Lohrey
    Word Problems and Confluence Problems for Restricted Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:172-186 [Conf]
    
13. Reinhard Pichler
    The Explicit Representability of Implicit Generalizations. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:187-202 [Conf]
    
14. Richard Statman
    On the Word Problem for Combinators. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:203-213 [Conf]
    
15. Georg Struth
    An Algebra of Resolution. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:214-228 [Conf]
    
16. Jürgen Stuber
    Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:229-245 [Conf]
    
17. Toshinori Takai, Yuichi Kaji, Hiroyuki Seki
    Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:246-260 [Conf]
    
18. Thomas Arts
    System Description: The Dependency Pair Method. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:261-264 [Conf]
    
19. Pierre-Etienne Moreau
    REM (Reduce Elan Machine): Core of the New ELAN Compiler. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:265-269 [Conf]
    
20. Enno Ohlebusch, Claus Claves, Claude Marché
    TALP: A Tool for the Termination Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:270-273 [Conf]