Willkommen, schön sind Sie da!
Logo Ex Libris

Rewriting Techniques and Applications

  • Kartonierter Einband
  • 360 Seiten
(0) Erste Bewertung abgeben
Bewertungen & Rezensionen
Alle Bewertungen ansehen
This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-9... Weiterlesen
115.00 CHF 92.00
Sie sparen CHF 23.00
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich


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.

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.


Titel: Rewriting Techniques and Applications
Untertitel: 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings
EAN: 9783540643012
ISBN: 354064301X
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Genre: Informatik
Anzahl Seiten: 360
Gewicht: 546g
Größe: H235mm x B155mm x T19mm
Jahr: 1998
Untertitel: Englisch
Auflage: 1998

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"