## Jean-Pierre Jouannaud

*Proceedings of the First International Conference on Rewriting Techniques and Applications*

RTA, 1985.

@proceedings{RTA-1985, address = "Dijon, France", editor = "Jean-Pierre Jouannaud", isbn = "3-540-15976-2", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the First International Conference on Rewriting Techniques and Applications}", volume = 202, year = 1985, }

### Contents (23 items)

- RTA-1985-Buchberger #development
- Basic Features and Development of the Critical-Pair/Completion Procedure (BB), pp. 1–45.
- RTA-1985-ZhangR
- Contextual Rewriting (HZ, JLR), pp. 46–62.
- RTA-1985-Book #term rewriting
- Thue Systems as Rewriting Systems (RVB), pp. 63–94.
- RTA-1985-Otto #algebra #finite #monad
- Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
- RTA-1985-CosmadakisK #database #equation
- Two Applications of Equational Theories to Database Theory (SSC, PCK), pp. 107–123.
- RTA-1985-JonesSS #compilation #empirical #generative #partial evaluation
- An Experiment in Partial Evaluation: The Generation of a Compiler Generator (NDJ, PS, HS), pp. 124–140.
- RTA-1985-RetyKKL #algorithm #logic programming #named #unification
- NARROWER: A New Algorithm for Unification and Its Application to Logic Programming (PR, CK, HK, PL), pp. 141–157.
- RTA-1985-Ait-Kaci #equation #graph grammar
- Solving Type Equations by Graph Rewriting (HAK), pp. 158–179.
- RTA-1985-Dershowitz #termination
- Termination (ND), pp. 180–224.
- RTA-1985-Rusinowitch #composition #recursion #revisited
- Path of Subterms Ordering and Recursive Decomposition Ordering Revisited (MR), pp. 225–240.
- RTA-1985-BachmairP #order
- Associative Path Orderings (LB, DAP), pp. 241–254.
- RTA-1985-DetlefsF #automation #proving #set #termination
- A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules (DD, RF), pp. 255–270.
- RTA-1985-ChoppyJ #named #petri net #proving #term rewriting
- PETRIREVE: Proving Petri Net Properties with Rewriting Systems (CC, CJ), pp. 271–286.
- RTA-1985-PoratF #term rewriting
- Fairness in Term Rewriting Systems (SP, NF), pp. 287–300.
- RTA-1985-Hsiang #proving #term rewriting #theorem proving
- Two Results in Term Rewriting Theorem Proving (JH), pp. 301–324.
- RTA-1985-Fribourg
- Handling Function Definitions through Innermost Superposition and Rewriting (LF), pp. 325–344.
- RTA-1985-Kandri-RodyKN #algebra #approach #commutative #problem #unification
- An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras (AKR, DK, PN), pp. 345–364.
- RTA-1985-Yelick #algorithm #equation #unification
- Combining Unification Algorithms for Confined Regular Equational Theories (KAY), pp. 365–380.
- RTA-1985-Fortenbach #algebra #commutative #unification
- An Algebraic Approch to Unification Under Assoiativity and Commutativity (AF), pp. 381–397.
- RTA-1985-ArnborgT #problem #unification
- Unification Problems with One-Sided Distributivity (SA, ET), pp. 398–406.
- RTA-1985-PurdomB #algorithm #performance
- Fast Many-to-One Matching Algorithms (PWPJ, CAB), pp. 407–416.
- RTA-1985-BenanavKN #complexity #problem
- Complexity of Matching Problems (DB, DK, PN), pp. 417–429.
- RTA-1985-Zaionc #regular expression #set #λ-calculus
- The Set of Unifiers in Typed λ-Calculus as Regular Expression (MZ), pp. 430–440.

5 ×#unification

4 ×#term rewriting

3 ×#algebra

3 ×#algorithm

3 ×#equation

3 ×#problem

3 ×#proving

2 ×#commutative

2 ×#named

2 ×#set

4 ×#term rewriting

3 ×#algebra

3 ×#algorithm

3 ×#equation

3 ×#problem

3 ×#proving

2 ×#commutative

2 ×#named

2 ×#set