Rewriting Techniques and Applications
9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings
Published on 11. March 1998
Book
Paperback/Softback
X, 346 pages
978-3-540-64301-2 (ISBN)
Description
This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of 61 submissions by the program committee with the assistance of 113 additional referees. The book covers all current aspects of rewriting including rewriting systems, term rewriting, string rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming.
More details
Series
Edition
1998 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 346 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 20 mm
Weight
546 gr
ISBN-13
978-3-540-64301-2 (9783540643012)
DOI
10.1007/BFb0052355
Schweitzer Classification
Person
Content
Origin tracking in term rewriting.- Simultaneous critical pairs and Church-Rosser property.- Church-Rosser theorems for abstract reduction modulo an equivalence relation.- Automatic monoids versus monoids with finite convergent presentations.- Decidable and undecidable second-order unification problems.- On the exponent of periodicity of minimal solutions of context equations.- Unification in extensions of shallow equational theories.- Unification and matching in process algebras.- E-unification for subsystems of S4.- Solving disequations modulo some class of rewrite systems.- About proofs by consistency.- Normalization of S-terms is decidable.- Decidable approximations of sets of descendants and sets of normal forms.- Algorithms and reductions for rewriting problems.- The decidability of simultaneous rigid E-unification with one variable.- Ordering constraints over feature trees expressed in second-order monadic logic.- Co-definite set constraints.- Modularity of termination using dependency pairs.- Termination of associative-commutative rewriting by dependency pairs.- Termination transformation by tree lifting ordering.- Towards automated termination proofs through "freezing".- Higher-order rewriting and partial evaluation.- SN combinators and partial combinatory algebras.- Coupling saturation-based provers by exchanging positive/negative information.- An on-line problem database.