Abstract is missing.
- Conditional Rewriting in FocusFrançois Bronsard, Uday S. Francois. 2-13
- A Maximal-Literal Unit Strategy for Horn ClausesNachum Dershowitz. 14-25
- Extended Term Rewriting SystemsJan Willem Klop, Roel C. de Vrijer. 26-50
- A Proof System for Conditional Algebraic SpecificationsEmmanuel Kounalis, Michaël Rusinowitch. 51-63
- Conditional Rewriting Logic: Deduction, Models and ConcurrencyJosé Meseguer. 64-91
- Equivalences of Rewrite ProgramsChilukuri K. Mohan. 92-97
- On Finite Representations of Infinite Sequences of TermsHong Chen, Jieh Hsiang, Hwa-Chung Kong. 100-114
- Infinite Terms and Infinite RewritingsYiyun Chen, Michael J. O Donnell. 115-126
- Testing Confluence of Nonterminating Rewriting SystemsYiyun Chen, Michael J. O Donnell. 127-136
- A Survey of Ordinal Interpretations of Type epsilon::0::for Termination of Rewriting SystemsBernard R. Hodgson, Clement F. Kent. 137-142
- Meta-rule Synthesis from Crossed Rewrite SystemsHélène Kirchner, Miki Hermann. 143-154
- An Application of Automated Equational Reasoning to Many-valued LogicSiva Anantharaman, Maria Paola Bonacina. 156-161
- Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract)Leo Bachmair, Harald Ganzinger. 162-180
- Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and ParamodulationHubert Bertling. 181-193
- Proof by Consistency in Conditional Equational TheoriesEddy Bevers, Johan Lewi. 194-205
- Completion Procedures as Semidecision ProceduresMaria Paola Bonacina, Jieh Hsiang. 206-232
- Linear CompletionHervé Devie. 233-245
- Clausal RewritingRobert Nieuwenhuis, Fernando Orejas. 246-258
- Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization PreservedFranco Barbanera. 260-271
- On Sufficient Completeness of Conditional SpecificationsWadoud Bousdira, Jean-Luc Remy. 272-286
- FPL: Functional Plus Logic Programming: An Integration of the FP and Prolog LanguagesN. Lichtenstein, Stéphane Kaplan. 287-294
- Confluence of the Disjoint Union of Conditional Term Rewriting SystemsAart Middeldorp. 295-306
- Implementing Term Rewriting by Graph Reduction: Termination of Combined SystemsDetlef Plump. 307-317
- Compiling Concurrent Rewriting onto the Rewrite Rule MachineHitoshi Aida, Joseph A. Goguen, José Meseguer. 320-332
- Design Strategies for Rewrite RulesSergio Antoy. 333-341
- A Simplifier for Untyped Lambda ExpressionsLouis Galbiati, Carolyn L. Talcott. 342-353
- Parallel Graph Rewriting on Loosely Coupled Machine ArchitecturesMarko C. J. D. van Eekelen, Marinus J. Plasmeijer, J. E. W. Smetsers. 354-369
- Typed Equivalence, Type Assignment, and Type ContainmentRoberto M. Amadio. 372-382
- A Fixed-Point Semantics for Feature Type SystemsMartin C. Emele, Rémi Zajac. 383-388
- Unique-Sort Order-Sorted Theories: A Description as Monad MorphismsJohn G. Stell. 389-400
- Equational Logics (Birkhoff s Method Revisited)Yong Sun. 401-406
- Compatibility of Order-Sorted Rewrite RulesUwe Waldmann. 407-416
- An Universal Termination Condition for Solving Goals in Equational LanguagesG. Aguzzi, U. Modigliani, M. Cecilia Verri. 418-423
- Constrained Equational DeductionJohn Darlington, Yike Guo. 424-435
- Higher-Order Unification, Polymorphism, and Subsorts (Extended Abstract)Tobias Nipkow. 436-447
- Second-Order Unification in the Presence of Linear Shallow Algebraic Equations (Extended Abstract)Zhenyu Qian. 448-453
- An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of EqualityWayne Snyder, Christopher Lynch. 454-461