Contents of the Proceedings of the
6th International Conference on Rewriting Techniques and Applications.
Kaiserslautern, Germany, April 5-7, 1995.
Lecture Notes in Computer Science, Vol. 914, Springer Verlag.
Editor: Jieh Hsiang.
Regular Papers
- Y. Matiyasevich,
On Some Mathematical Logic Contributions to Rewriting Techniques:
Lost Heritage (Abstract)
(page 1).
- M. Marchiori,
Modularity of Completeness Revisited
(pages 2-10).
- J. Steinbach,
Automatic Termination Proofs With Transformation Orderings
(pages 11-25).
- O. Lysne and J. Piris,
A Termination Ordering for Higher Order Rewrite System
(pages 26-40).
- H. Zantema and A. Geser,
A Complete Characterization of Termination of 0p 1q -> 1r 0s
(pages 41-55).
- R. Nieuwenhuis,
On Narrowing, Refutation Proofs and Constraints
(pages 56-70).
- M. Kurihara, H. Kondo and A. Ohuchi,
Completion for Multiple Reduction Orderings
(pages 71-85).
- K. Schmid and R. Fettig,
Towards an Efficient Construction of Test Sets for Deciding Ground
Reducability
(pages 86-100).
- M. E. Stickel,
Term Rewriting in Contemporary Resolution Theorem Proving
(Abstract)
(page 101).
- A. Asperti,
delta o! Epsilon = 1: Optimizing Optimal lambda-Calculus
Implementations
(pages 102-116).
- P. Graf,
Substitution Tree Indexing
(pages 117-131).
- I. Alouini,
Concurrent Garbage Collection for Concurrent Rewriting
(pages 132-146).
- J. F. Th. Kamperman and H. R. Walters,
Lazy Rewriting and Eager Machinery
(pages 147-162).
- S. Anantharaman and G. Richard,
A Rewrite Mechanism for Logic Programs with Negation
(pages 163-178).
- T. Suzuki, A. Middeldorp and T. Ida,
Level-Confluence of Conditional Rewrite Systems with Extra Variables
in Right-Hand Sides
(pages 179-193).
- G. Sénizergues,
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue
Systems
(pages 194-209).
- W. Gehrke,
Problems in Rewriting Applied to Categorical Concepts by the Example
of a Computational Comonad
(pages 210-224).
- A. Corradini, F. Gadducci and U. Montanari,
Relating Two Categorial Models of Term Rewriting
(pages 225-240).
- S. Kahrs,
Towards a Domain Theory for Termination Proofs
(pages 241-255).
- T. Nipkow,
Higher-Order Rewrite Systems (Abstract)
(page 256).
- R. Kennaway, J. W. Klop, M. R. Sleep and F.-J. de Vries,
Infinitary Lambda Calculi and Böhm Models
(pages 257-270).
- J. Kuper,
Proving the Genericity Lemma by Leftmost Reduction is Simple
(pages 271-278).
- S. van Bakel and M. Fernández,
(Head-) Normalization of Typeable Rewrite Systems
(pages 279-293).
- P. Lescanne and J. Rouyer-Degli,
Explicit Substitutions with de Bruijn's Levels
(pages 294-308).
- R. J. Boulton,
A Restricted Form on Higher-Order Rewriting Applied to an HDL
Semantics
(pages 309-323).
- H. R. Walters and H. Zantema,
Rewrite Systems for Integer Arithmetic
(pages 324-338).
- H. Abdulrab and M. Maksimenko,
General Solution of Systems of Linear Diophantine Equations and
Inequations
(pages 339-351).
- F. Baader and K. U. Schulz,
Combination of Constraint Solving Techniques: An Algebraic Point of
View
(pages 352-366).
- F. Otto, P. Narendran and D. J. Dougherty,
Some Independent Results for Equational Unification
(pages 367-381).
- J. Burghardt,
Regular Substitution Sets: A Means of Controlling E-Unification
(pages 382-396).
System Description
- J. Avenhaus, J. Denzinger and M. Fuchs,
DISCOUNT: A System for Distributed Equational Deduction
(pages 397-402).
- F. Bellegarde,
ASTRE: Towards a Fully Automated Program Transformation System
(pages 403-407).
- R. Bündgen, M. Göbel and W. Küchlin,
Parallel ReDuX -> PaReDuX
(pages 408-413).
- T. Chen and S. Anantharaman,
STORM: A Many-to-One Associative-Commutative Matcher
(pages 414-419).
- J. Chazarain and S. Muller,
LEMMA: A System for Automated Synthesis of Recursive Programs in
Equational Theories
(pages 420-425).
- J. Giesl,
Generating Polynomial Orderings for Termination Proofs
(pages 426-431).
- M. R. Holmes,
Disguising Recursively Chained Rewrite Rules as Equational Theorems,
as Implemented in the Prover EFTTP Mark 2
(pages 432-437).
- H. Kirchner and P.-E. Moreau,
Prototyping Completion with Constraints Using Computational
Systems
(pages 438-443).
- A. Paccanaro,
Guiding Term Reduction Through a Neural Network: Some Prelimanary
Results for the Group Theory
(pages 444-449).
Problem Sets
- M. E. Stickel and H. Zhang,
Studying Quasigroup Identities by Rewriting Techniques: Problems and
First Results
(pages 450-456).
- N. Dershowitz, J.-P. Jouannaud and J. W. Klop,
Problems in Rewriting III
(pages 457-471).