Conferences in DBLP
Garrett Birkhoff Term Rewriting and Universal Algebra in Historical Perspective (Abstract of Invited Lecture). [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:1- [Conf ] Franz Baader Characterization of Unification Type Zero. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:2-14 [Conf ] Leo Bachmair Proof Normalization for Resolution and Paramodulation. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:15-28 [Conf ] Timothy B. Baird , Gerald E. Peterson , Ralph W. Wilkerson Complete Sets of Reductions Modulo Associativity, Commutativity and Identity. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:29-44 [Conf ] Hubert Bertling , Harald Ganzinger Completion-Time Optimization of Rewrite-Time Goal Solving. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:45-58 [Conf ] Reinhard Bündgen , Wolfgang Küchlin Computing Ground Reducability and Inductively Complete Positions. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:59-75 [Conf ] Hubert Comon Inductive Proofs by Specification Transformation. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:76-91 [Conf ] John Darlington , Yike Guo Narrowing and Unification in Functional Programming - An Evaluation Mechanism for Absolute Set Abstraction. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:92-108 [Conf ] Max Dauchet Simulation of Turning Machines by a Left-Linear Rewrite Rule. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:109-120 [Conf ] Conal Elliott Higher-order Unification with Dependent Function Types. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:121-136 [Conf ] Stephen J. Garland , John V. Guttag An Overview of LP, The Larch Power. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:137-151 [Conf ] Herbert Göttler Graph Grammars, A New Paradigma for Implementing Visual Languages. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:152-166 [Conf ] Dieter Hofbauer , Clemens Lautemann Termination Proofs and the Length of Derivations (Preliminary Version). [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:167-177 [Conf ] Stéphane Kaplan , Christine Choppy Abstract Rewriting with Concrete Operations. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:178-186 [Conf ] Mike Lai On How To Move Mountains 'Associatively and Commutatively'. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:187-202 [Conf ] Dallas Lankford Generalized Gröbner Bases: Theory and Applications. A Condensation. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:203-221 [Conf ] Dana May Latch , Ron Sigal A Local Termination Property for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:222-233 [Conf ] George F. McNulty An Equational Logic Sampler. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:234-262 [Conf ] Aart Middeldorp Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:263-277 [Conf ] Chilukuri K. Mohan Priority Rewriting: Semantics, Confluence, and Conditional. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:278-291 [Conf ] Chilukuri K. Mohan , Mandayam K. Srivas Negation with Logical Variables in Conditional Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:292-310 [Conf ] Tohru Naoi , Yasuyoshi Inagaki Algebraic Semantics and Complexity of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:311-325 [Conf ] Sanjai Narain Optimization by Non-Deterministic, Lazy Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:326-342 [Conf ] Tobias Nipkow Combining Matching Algorithms: The Rectangular Case. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:343-358 [Conf ] Friedrich Otto Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:359-370 [Conf ] Laurence Puel Embedding with Patterns and Associated Recursive Path Ordering. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:371-387 [Conf ] Uday S. Reddy Rewriting Techniques for Program Synthesis. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:388-403 [Conf ] R. C. Sekar , Shaunak Pawagi , I. V. Ramakrishnan Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:404-418 [Conf ] Wayne Snyder Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:419-433 [Conf ] Joachim Steinbach Extensions and Comparison of Simplification Orderings. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:434-448 [Conf ] Robert Strandh Classes of Equational Programs that Compile into Efficient Machine Code. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:449-461 [Conf ] Sophie Tison Fair Termination is Decidable for Ground Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:462-476 [Conf ] Yoshihito Toyama , Jan Willem Klop , Hendrik Pieter Barendregt Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:477-491 [Conf ] Sergei G. Vorobyov Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:492-512 [Conf ] Hantao Zhang , Deepak Kapur Consider Only General Superpositions in Completion Procedures. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:513-527 [Conf ] Habib Abdulrab , Jean-Pierre Pécuchet Solving Systems of Linear Diophantine Equations and Word Equations. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:530-532 [Conf ] Siva Anantharaman , Jieh Hsiang , Jalel Mzali SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:533-537 [Conf ] Jürgen Avenhaus , Jörg Denzinger , Jürgen Müller THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:538-541 [Conf ] Jürgen Avenhaus , Klaus Madlener , Joachim Steinbach COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:542-546 [Conf ] Michel Bidoit , Francis Capy , Christine Choppy ASSPEGIQUE: An Integrated Specification Environment. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:547- [Conf ] Maria Paola Bonacina , Giancarlo Sanna KBlab: An Equational Theorem Prover for the Macintosh. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:548-550 [Conf ] Jim Christian Fast Knuth-Bendix Completion: Summary. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:551-555 [Conf ] Max Dauchet , Aline Deruyver Compilation of Ground Term Rewriting Systems and Applications. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:556-558 [Conf ] Deepak Kapur , Hantao Zhang An Overview of Rewrite Rule Laboratory (RRL). [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:559-563 [Conf ] Hessam Khoshnevisan , K. M. Sephton InvX: An Automatic Function Inverter. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:564-568 [Conf ] Naomi Lindenstrauss A Parallel Implementation of Rewriting and Narrowing. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:569-573 [Conf ] John Pedersen Morphocompletion for One-Relation Monoids. [Citation Graph (0, 0)][DBLP ] RTA, 1989, pp:574-578 [Conf ]