Contents of the Proceedings of the
3rd International Workshop on Conditional Term Rewriting Systems.
Pont-à-Mousson, France, July 8-10, 1992.
Lecture Notes in Computer Science, Vol. 656, Springer Verlag.
Editors: Jean-Luc Rémy and Michael Rusinowitch.
- K. Meinke,
Algebraic Semantics of Rewriting Terms and Types
(invited talk)
(pages 1-20).
- S. Kahrs,
Context Rewriting
(pages 21-35).
- K. H. Rose,
Explicit Cycling Substitutions
(pages 36-50).
- R. Banach,
Simple Type Inference for Term Graph Rewriting Systems
(pages 51-66).
- V. M. Antimirov and A. I. Degtyarev,
Consistency and Semantics of Equational Definitions over Predefined
Algebras
(pages 67-81).
- A. Middeldorp,
Completeness of Combinations of Conditional Constructor Systems
(pages 82-96).
- D. Plump,
Collapsed Tree Rewriting: Completeness, Confluence, and Modularity
(pages 97-112).
- E. Ohlebusch,
Combinations of Simplifying Conditional Term Rewriting Systems
(pages 113-127).
- B. Gramlich,
Sufficient Conditions for Modular Termination of Conditional Term
Rewriting Systems
(pages 128-142).
- C. Loria-Saenz and J. Steinbach,
Termination of Combined (Rewrite and lambda-Calculus) Systems
(pages 143-147).
- H. Zantema,
Type Removal in Term Rewriting
(pages 148-154).
- H. Zantema,
Termination of Term Rewriting by Interpretation
(pages 155-167).
- N. Dershowitz and S. Mitra,
Path Orderings for Termination of Associative-Commutative
Rewriting
(pages 168-174).
- P. Padawitz,
Generic Induction Proofs
(invited talk)
(pages 175-197).
- C.-P. Wirth and B. Gramlich,
A Constructor-Based Approach for Positive/Negative-Conditional
Equational Specifications
(pages 198-212).
- K. Becker,
Semantics for Positive/Negative Conditional Rewrite Systems
(pages 213-225).
- H. Ganzinger and J. Stuber,
Inductive Theorem Proving by Consistency for First-Order Clauses
(pages 226-241).
- F. Bronsard and U. S. Reddy,
Reduction Techniques for First-Order Reasoning
(pages 242-256).
- D. Plaisted, G. Alexander, H. Chu and S.-J. Lee,
Conditional Term-Rewriting and First-Order Theorem Proving
(invited talk)
(pages 257-271).
- G. Kucherov and M. Tajine,
Decidability of Regularity and Related Properties of Ground Normal
Form Languages
(pages 272-286).
- D. Hofbauer and M. Huber,
Computing Linearizations Using Test-Sets
(pages 287-301).
- H. Zhang,
Proving Group Isomorphism Theorems
(pages 302-306).
- N. Dershowitz,
Semigroups Satisfying $x^{m+n}=x^n$
(pages 307-314).
- S. Vorobyov,
Could Orders Be Captured By Term Rewriting Systems?
(pages 315-327).
- K. Stokkermans,
A Categorical Formulation for Critical-Pair/Completion Procedures
(pages 328-342).
- Y. Wang and D. L. Parnas,
Trace Rewriting Systems
(pages 343-356).
- U. Fraus,
A Calculus for Conditional Inductive Theorem Proving
(pages 357-362).
- H. Zhang,
Implementing Contextual Rewriting
(pages 363-377).
- J. Yamada,
Confluence of Terminating Membership Conditional TRS
(pages 378-392).
- L. With,
Completeness and Confluence of Order-Sorted Term Rewriting
(pages 393-407).
- C. Hoot,
Completion for Constrained Term Rewriting Systems
(pages 408-423).
- A. Takano,
Generalized Partial Computation using Disunification to Solve
Constraints
(pages 424-428).
- L. Pacholski,
Decidability of Finiteness Properties
(invited talk)
(page 429).
- H. Ganzinger and U. Waldmann,
Termination Proofs of Well-Moded Logic Programs Via Conditional
Rewrite Systems
(pages 430-437).
- S. Bonnier and J. Wallgren,
Logic Programs with Polymorphic Types: A Condition for Static Type
Checking
(pages 438-447).
- S. Antoy,
Normalization by Leftmost Innermost Rewriting
(pages 448-457).
- P. Inverardi and M. Nesi,
A Strategy to Deal with Divergent Rewrite Systems
(pages 458-467).
- B. Delsart,
A New Approach tO general E-Unification Based on Conditional
Rewriting Systems
(pages 468-482).
- A. Bockmayr, S. Krischer and A. Werner,
An Optimal Narrowing Strategy for General Canonical Systems
(pages 483-497).
- W. Fang and J.-H. Kao,
Set-Of-Support Strategy for Higher-Order Logic
(pages 498-501).