default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st RTA 1985: Dijon, France
- Jean-Pierre Jouannaud:
Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings. Lecture Notes in Computer Science 202, Springer 1985, ISBN 3-540-15976-2 - Bruno Buchberger:
Basic Features and Development of the Critical-Pair/Completion Procedure. 1-45 - Hantao Zhang, Jean-Luc Rémy:
Contextual Rewriting. 46-62 - Ronald V. Book:
Thue Systems as Rewriting Systems. 63-94 - Friedrich Otto:
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. 95-106 - Stavros S. Cosmadakis
, Paris C. Kanellakis:
Two Applications of Equational Theories to Database Theory. 107-123 - Neil D. Jones, Peter Sestoft, Harald Søndergaard:
An Experiment in Partial Evaluation: The Generation of a Compiler Generator. 124-140 - Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne:
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. 141-157 - Hassan Aït-Kaci:
Solving Type Equations by Graph Rewriting. 158-179 - Nachum Dershowitz:
Termination. 180-224 - Michaël Rusinowitch:
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. 225-240 - Leo Bachmair, David A. Plaisted:
Associative Path Orderings. 241-254 - David Detlefs, Randy Forgaard:
A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules. 255-270 - Christine Choppy, Colette Johnen:
PETRIREVE: Proving Petri Net Properties with Rewriting Systems. 271-286 - Sara Porat, Nissim Francez:
Fairness in Term Rewriting Systems. 287-300 - Jieh Hsiang:
Two Results in Term Rewriting Theorem Proving. 301-324 - Laurent Fribourg:
Handling Function Definitions through Innermost Superposition and Rewriting. 325-344 - Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran:
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. 345-364 - Katherine A. Yelick:
Combining Unification Algorithms for Confined Regular Equational Theories. 365-380 - Albrecht Fortenbacher:
An Algebraic Approch to Unification Under Assoiativity and Commutativity. 381-397 - Stefan Arnborg, Erik Tidén:
Unification Problems with One-Sided Distributivity. 398-406 - Paul Walton Purdom Jr., Cynthia A. Brown:
Fast Many-to-One Matching Algorithms. 407-416 - Dan Benanav, Deepak Kapur, Paliath Narendran:
Complexity of Matching Problems. 417-429 - Marek Zaionc:
The Set of Unifiers in Typed Lambda-Calculus as Regular Expression. 430-440
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-23 19:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
