Abstract is missing.
- Algebraic Semantics of Rewriting Terms and TypesKarl Meinke. 1-20
- Context RewritingStefan Kahrs. 21-35
- Explicit Cyclic SubstitutionsKristoffer Høgsbro Rose. 36-50
- Simple Type Inference for Term Graph Rewriting SystemsRichard Banach. 51-66
- Consistency and Semantics of Equational Definitions over Predefined AlgebrasValentin M. Antimirov, Anatoli Degtyarev. 67-81
- Completeness of Combinations of Conditional Constructor SystemsAart Middeldorp. 82-96
- Collapsed Tree Rewriting: Completeness, Confluence, and ModularityDetlef Plump. 97-112
- Combinations of Simplifying Conditional Term Rewriting SystemsEnno Ohlebusch. 113-127
- Sufficient Conditions for Modular Termination of Conditional Term Rewriting SystemsBernhard Gramlich. 128-142
- Termination of Combined (Rewrite and lambda-Calculus) SystemsCarlos Loría-Sáenz, Joachim Steinbach. 143-147
- Type Removal in Term RewritingHans Zantema. 148-154
- Termination of Term Rewriting by InterpretationHans Zantema. 155-167
- Path Orderings for Termination of Associative-Commutative RewritingNachum Dershowitz, Subrata Mitra. 168-174
- Generic Induction ProofsPeter Padawitz. 175-197
- A Constructor-Based Approach for Positive/Negative-Conditional Equational SpecificationsClaus-Peter Wirth, Bernhard Gramlich. 198-212
- Semantics for Positive/Negative Conditional Rewrite SystemsKlaus Becker. 213-225
- Inductive Theorem Proving by Consistency for First-Order ClausesHarald Ganzinger, Jürgen Stuber. 226-241
- Reduction Techniques for First-Order ReasoningFrançois Bronsard, Uday S. Reddy. 242-256
- Conditional Term Rewriting and First-Order Theorem ProvingDavid A. Plaisted, Geoffrey D. Alexander, Heng Chu, Shie-Jue Lee. 257-271
- Decidability of Regularity and Related Properties of Ground Normal Form LanguagesGregory Kucherov, Mohamed Tajine. 272-286
- Computing Linearizations Using Test SetsDieter Hofbauer, Maria Huber. 287-301
- Proving Group Isomorphism Theorems (Extended Abstract)Hantao Zhang. 302-306
- Semigroups Satisfying x:::m+n::: = x:::n:::Nachum Dershowitz. 307-314
- Could Orders Be Captured By Term Rewriting Systems?Sergei G. Vorobyov. 315-327
- A Categorical Formulation for Critical-Pair/Completion ProceduresKarel Stokkermans. 328-342
- Trace Rewriting SystemsYabo Wang, David Lorge Parnas. 343-356
- A Calculus for Conditional Inductive Theorem ProvingUlrich Fraus. 357-362
- Implementing Contextual RewritingHantao Zhang. 363-377
- Confluence of Terminating Membership Conditional TRSJunnosuke Yamada. 378-392
- Completeness and Confluence of Order-Sorted Term RewritingLars With. 393-407
- Completion for Constrained Term Rewriting SystemsCharles Hoot. 408-423
- Generalized Partial Computation using Disunification to Solve ConstraintsAkihiko Takano. 424-428
- Decidability of finiteness properties (Abstract)Leszek Pacholski. 429
- Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite SystemsHarald Ganzinger, Uwe Waldmann. 430-437
- Logic Programs with Polymorphic Types: A condition for static type checkingStaffan Bonnier, Jonas Wallgren. 438-447
- Normalization by Leftmost Innermost RewritingSergio Antoy. 448-457
- A Strategy to Deal with Divergent Rewrite SystemsPaola Inverardi, Monica Nesi. 458-467
- A New Approach to General E-Unification Based on Conditional Rewriting SystemsBertrand Delsart. 468-482
- An Optimal Narrowing Strategy for General Canonical SystemsAlexander Bockmayr, Stefan Krischer, Andreas Werner. 483-497
- Set-Of-Support Strategy for Higher-Order LogicWenchang Fang, Jung-Hong Kao. 498-501