Cart
Free US shipping over $10
Proud to be B-Corp

Rewriting Techniques and Applications Tobias Nipkow

Rewriting Techniques and Applications By Tobias Nipkow

Rewriting Techniques and Applications by Tobias Nipkow


$74.39
Condition - New
Only 2 left

Summary

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.

Rewriting Techniques and Applications Summary

Rewriting Techniques and Applications: 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings by Tobias Nipkow

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.

Table of Contents

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.

Additional information

NPB9783540643012
9783540643012
354064301X
Rewriting Techniques and Applications: 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings by Tobias Nipkow
New
Paperback
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
1998-03-11
346
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Rewriting Techniques and Applications