000 05202nam a22004935i 4500
001 978-3-540-47558-3
003 DE-He213
005 20160624102024.0
007 cr nn 008mamaa
008 121227s1991 gw | s |||| 0|eng d
020 _a9783540475583
_9978-3-540-47558-3
024 7 _a10.1007/3-540-54317-1
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aConditional and Typed Rewriting Systems
_h[electronic resource] :
_b2nd International CTRS Workshop Montreal, Canada, June 11–14, 1990 Proceedings /
_cedited by S. Kaplan, M. Okada.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1991.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1991.
300 _aX, 464 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v516
505 0 _aConditional rewriting in focus -- A maximal-literal unit strategy for horn clauses -- Extended term rewriting systems -- A proof system for conditional algebraic specifications -- Conditional rewriting logic: Deduction, models and concurrency -- Equivalences of rewrite programs -- On finite representations of infinite sequences of terms -- Infinite terms and infinite rewritings -- Testing confluence of nonterminating rewriting systems -- A survey of ordinal interpretations of type ?0 for termination of rewriting systems -- Meta-rule synthesis from crossed rewrite systems -- An application of automated equational reasoning to many-valued logic -- Completion of first-order clauses with equality by strict superposition -- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation -- Proof by consistency in conditional equational theories -- Completion procedures as semidecision procedures -- Errata corrige -- Linear completion -- Clausal rewriting -- Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved -- On sufficient completeness of conditional specifications -- FPL : Functional plus logic programming an integration of the FP and Prolog languages -- Confluence of the disjoint union of conditional term rewriting systems -- Implementing term rewriting by graph reduction: Termination of combined systems -- Compiling concurrent rewriting onto the Rewrite Rule Machine -- Design strategies for rewrite rules -- A simplifier for untyped lambda expressions -- Parallel graph rewriting on loosely coupled machine architectures -- Typed equivalence, type assignment, and type containment -- A fixed-point semantics for feature type systems -- Unique-sort order-sorted theories : A description as monad morphisms -- Equational logics (birkhoff's method revisited) -- Compatibility of order-sorted rewrite rules -- An universal termination condition for solving goals in equational languages -- Constrained equational deduction -- Higher-order unification, polymorphism, and subsorts -- Second-order unification in the presence of linear shallow algebraic equations -- An inference system for horn clause logic with equality.
520 _aIn 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.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aKaplan, S.
_eeditor.
700 1 _aOkada, M.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540543176
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v516
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-54317-1
942 _2EBK6108
_cEBK
999 _c35402
_d35402