Rewriting Techniques and Applications: 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5 - 7, 1995. Proceedings / Edition 1

by Jieh Hsiang

Overview

This volume presents the proceedings of the Sixth International Conference on Rewriting Techniques and Applications, RTA-95, held in Kaiserslautern, Germany in April 1995.

The 27 full revised papers were selected from a total of 87 submissions. In addition there are 9 system descriptions and two problem sets, one contributed by Mark E. Stickel and Hantao Zhang and another by Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop.

The volume addresses all current aspects of rewriting techniques and their applications and thus defines the state-of-the-art in this active field of research.

Product Details

ISBN-13:	9783540592006
Publisher:	Springer Berlin Heidelberg
Publication date:	04/26/1995
Series:	Lecture Notes in Computer Science , #914
Edition description:	1995
Pages:	480
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

On some mathematical logic contributions to rewriting techniques: Lost heritage.- Modularity of completeness revisited.- Automatic termination proofs with transformation orderings.- A termination ordering for higher order rewrite systems.- A complete characterization of termination of 0p 1q → 1r 0s.- On narrowing, refutation proofs and constraints.- Completion for multiple reduction orderings.- Towards an efficient construction of test sets for deciding ground reducibility.- Term rewriting in contemporary resolution theorem proving.-δο!∈=1 Optimizing optimal λ-calculus.- Substitution tree indexing.- Concurrent garbage collection for concurrent rewriting.- Lazy rewriting and eager machinery.- A rewrite mechanism for logic programs with negation.- Level-confluence of conditional rewrite systems with extra variables in right-hand sides.- A polynomial algorithm testing partial confluence of basic semi-Thue systems.- Problems in rewriting applied to categorical concepts by the example of a computational comonad.- Relating two categorical models of term rewriting.- Towards a domain theory for termination proofs.- Higher-order rewrite systems.- Infinitary lambda calculi and böhm models.- Proving the genericity lemma by leftmost reduction is simple.- (Head-)normalization of typeable rewrite systems.- Explicit substitutions with de bruijn's levels.- A restricted form of higher-order rewriting applied to an HDL semantics.- Rewrite systems for integer arithmetic.- General solution of systems of linear diophantine equations and inequations.- Combination of constraint solving techniques: An algebraic point of view.- Some independence results for equational unification.- Regular substitution sets: A means of controlling E-unification.- DISCOUNT: A system fordistributed equational deduction.- ASTRE: Towards a fully automated program transformation system.- Parallel ReDuX— PaReDuX.- STORM: A many-to-one associative-commutative matcher.- LEMMA: A system for automated synthesis of recursive programs in equational theories.- Generating polynomial orderings for termination proofs.- Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2.- Prototyping completion with constraints using computational systems.- Guiding term reduction through a neural network: Some preliminary results for the group theory.- Studying quasigroup identities by rewriting techniques: Problems and first results.- Problems in rewriting III.