Conditional and Typed Rewriting Systems [electronic resource] : 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.

Bibliographic Details

Main Authors:	Kaplan, S. editor., Okada, M. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1991
Subjects:	Computer science., Software engineering., Mathematical logic., Artificial intelligence., Computer Science., Software Engineering/Programming and Operating Systems., Mathematical Logic and Formal Languages., Artificial Intelligence (incl. Robotics).,
Online Access:	http://dx.doi.org/10.1007/3-540-54317-1
Tags:	Add Tag No Tags, Be the first to tag this record!