Conditional and Typed Rewriting Systems: 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990. Proceedings
In recent years, extensions of rewriting techniques that go beyond the traditional untyped algebraic rewriting framework have been investigated and developed. Among these extensions, conditional and typed systems are particularly important, as are higher-order systems, graph rewriting systems, etc. The international CTRS (Conditional and Typed Rewriting Systems) workshops are intended to offer a forum for researchers on such extensions of rewriting techniques. This volume presents the proceedings of the second CTRS workshop, which contributed to discussion and evaluation of new directions of research. (The proceedings of the first CTRS workshop are in Lecture Notes in Computer Science, Vol. 308.) Several important directions for extensions of rewriting techniques were stressed, which are reflected in the organization of the chapters in this volume: - Theory of conditional and Horn clause systems, - Infinite terms, non-terminating systems, and termination, - Extension of Knuth-Bendix completion, - Combined systems, combined languages and modularity, - Architecture, compilers and parallel computation, - Basic frameworks for typed and order-sorted systems, - Extension of unification and narrowing techniques.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Abstract abstract data types algebraic algorithm applied axioms Bachmair calculus called clausal completion procedure Computer Science concurrent conditional equations conditional rewriting Conditional Term Rewriting confluent constructor context critical pair CTRS defined Definition denote derivation Dershowitz equational logic equational theories equivalent example extension false finite function symbols given Goguen graph rewriting ground instances ground terms Horn clauses inductive inference rules inference step infinite term instantiation Joseph Goguen Jouannaud Knuth-Bendix lambda calculus language Lecture Notes Lemma linear literals logic programming Meseguer meta-rule method monad morphism multiset node normal form notation Notes in Computer notion occurrence operation order-sorted paramodulation problem Proceedings processor recurrence-term recursive redexes reduction ordering refutation respect result rewrite relation rewrite rules schematization semantics SIMD simplification solved form sort specification Springer-Verlag strategy structure subterm superposition term graph term rewriting systems terminating theorem proving true unconditional unification unifier variables