Conditional Term Rewriting Systems (Record no. 35396)

000 -LEADER
fixed length control field 05214nam a22005295i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540475491
-- 978-3-540-47549-1
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
245 10 - TITLE STATEMENT
Title Conditional Term Rewriting Systems
Sub Title Third International Workshop, CTRS-92 Point-à-Mousson, France, July 8–10 1992 Proceedings /
Statement of responsibility, etc edited by Michaël Rusinowitch, Jean-Luc Rémy.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1993.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XIII, 507 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Algebraic semantics of rewriting terms and types -- Context rewriting -- Explicit cyclic substitutions -- Simple type inference for term graph rewriting systems -- Consistency and semantics of equational definitions over predefined algebras -- Completeness of combinations of conditional constructor systems -- Collapsed tree rewriting: Completeness, confluence, and modularity -- Combinations of simplifying conditional term rewriting systems -- Sufficient conditions for modular termination of conditional term rewriting systems -- Termination of combined (rewrite and ?-calculus) systems -- Type removal in term rewriting -- Termination of term rewriting by interpretation -- Path orderings for termination of associative-commutative rewriting -- Generic induction proofs -- A constructor-based approach for positive/negative-conditional equational specifications -- Semantics for positive/negative conditional rewrite systems -- Inductive theorem proving by consistency for first-order clauses -- Reduction techniques for first-order reasoning -- Conditional term rewriting and first-order theorem proving -- Decidability of regularity and related properties of ground normal form languages -- Computing linearizations using test sets -- Proving group isomorphism theorems -- Semigroups satisfying x m+n = x n -- Could orders be captured by term rewriting systems? -- A categorical formulation for critical-pair/completion procedures -- Trace rewriting systems -- A calculus for conditional inductive theorem proving -- Implementing contextual rewriting -- Confluence of terminating membership conditional TRS -- Completeness and confluence of order-sorted term rewriting -- Completion for constrained term rewriting systems -- Generalized partial computation using disunification to solve constraints -- Decidability of finiteness properties -- Termination proofs of well-moded logic programs via conditional rewrite systems -- Logic programs with polymorphic types: A condition for static type checking -- Normalization by leftmost innermost rewriting -- A strategy to deal with divergent rewrite systems -- A new approach to general E-unification based on conditional rewriting systems -- An optimal narrowing strategy for general canonical systems -- Set-of-support strategy for higher-order logic.
520 ## - SUMMARY, ETC.
Summary, etc This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logic, Symbolic and mathematical.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Programming Languages, Compilers, Interpreters.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Artificial Intelligence (incl. Robotics).
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Foundations.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rusinowitch, Michaël.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rémy, Jean-Luc.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-56393-8
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1993.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK6102 http://dx.doi.org/10.1007/3-540-56393-8 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha