Conditional and Typed Rewriting Systems: 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13 - 15, 1994. Proceedings / Edition 1

by Nachum Dershowitz, Naomi Lindenstrauss

Overview

This book presents throroughly revised full versions of the 21 papers accepted for the Fourth International Workshop on Conditional and Typed Rewriting Systems, CTRS-94, held in conjunction with ICALP '94 in Jerusalem, Israel, in July 1994.

The volume reports the research advances in the area of rewriting in general achieved since the predecessor workshop held in July 1992. Among the topics addressed are conditional term rewriting, typed systems, higher-order rewriting, graph rewriting, combinator-based languages, and constrained rewriting.

Product Details

ISBN-13:	9783540603818
Publisher:	Springer Berlin Heidelberg
Publication date:	10/27/1995
Series:	Lecture Notes in Computer Science , #968
Edition description:	1995
Pages:	384
Product dimensions:	6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Associative-commutative superposition.- A calculus for rippling.- Equation solving in geometrical theories.- LSE narrowing for decreasing conditional term rewrite systems.- Preserving confluence for rewrite systems with built-in operations.- Hierarchical termination.- Well-foundedness of term orderings.- A new characterisation of AC-termination and application.- Relative normalization in orthogonal expression reduction systems.- On termination and confluence of conditional rewrite systems.- How to transform canonical decreasing CTRSs into equivalent canonical TRSs.- Termination for restricted derivations and conditional rewrite systems.- Rewriting for preorder relations.- Strong sequentiality of left-linear overlapping rewrite systems.- A conflict between call-by-need computation and parallelism.- The complexity of testing ground reducibility for linear word rewriting systems with variables.- Coherence for cartesian closed categories: A sequential approach.- Modular properties of constructor-sharing conditional term rewriting systems.- Church-Rosser property and unique normal form property of non-duplicating term rewriting systems.- The transformation of term rewriting systems based on well-formedness preserving mappings.- Abstract notions and inference systems for proofs by mathematical induction.