Rewriting Techniques And Applications: 10th International Conference, RTA'99, Trento, Italy, July 2-4, 1999, Proceedings by Paliath NarendranRewriting Techniques And Applications: 10th International Conference, RTA'99, Trento, Italy, July 2-4, 1999, Proceedings by Paliath Narendran

Rewriting Techniques And Applications: 10th International Conference, RTA'99, Trento, Italy, July 2…

EditorPaliath Narendran, Michael Rusinowitch

Paperback

Pricing and Purchase Info

$154.95

Earn 775 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 10th International Conference on Rewriting Techniques and Applications, RTA-99, held in Trento, Italy in July 1999 as part of FLoC'99. The 23 revised full papers presented were carefully selected from a total of 53 submissions. Also included are four system descriptions as well as three invited contributions. Among the topics covered are constraint solving, termination, deduction and higher order rewriting, graphs, complexity, tree automata, context-sensitive rewriting, string rewriting and numeration systems, etc.
Title:Rewriting Techniques And Applications: 10th International Conference, RTA'99, Trento, Italy, July 2…Format:PaperbackDimensions:420 pages, 9.25 × 6.1 × 0.68 in

The following ISBNs are associated with this title:

ISBN - 10:3540662014

ISBN - 13:9783540662013

Look for similar items by category:

Reviews

Table of Contents

Session 1.- Solved Forms for Path Ordering Constraints.- Jeopardy.- Strategic Pattern Matching.- Session 2:.- On the Strong Normalization of Natural Deduction with Permutation-Conversions.- Normalisation in Weakly Orthogonal Rewriting.- Strong Normalization of Proof Nets Modulo Structural Congruences.- Session 3: Invited Talk.- Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas.- Session 4:.- Undecidability of the Part of the Theory of Ground Term Algebra Modulo an AC Symbol.- Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting.- A New Result about the Decidability of the Existential One-Step Rewriting Theory.- Session 5:.- A Fully Syntactic AC-RPO.- Theory Path Orderings.- A Characterisation of Multiply Recursive Functions with Higman's Lemma.- Session 6:.- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors.- Normalization via Rewrite Closures.- Test Sets for the Universal and Existential Closure of Regular Tree Languages.- Session 7: Invited Tutorial.- Higher-Order Rewriting.- Session 8: System Descriptions.- The Maude System.- TOY: A Multiparadigm Declarative System.- UniMoK: A System for Combining Equational Unification Algorithms.- : A Laboratory for Rapid Term Graph Rewriting.- Session 9:.- Decidability for Left-Linear Growing Term Rewriting Systems.- Transforming Context-Sensitive Rewrite Systems.- Context-Sensitive AC-rewriting.- Session 10:.- The Calculus of Algebraic Constructions.- HOL-??: An Intentional First-Order Expression of Higher-Order Logic.- Session 11: Invited Talk.- On the Connections between Rewriting and Formal Language Theory.- Session 12:.- A Rewrite System Associated with Quadratic Pisot Units.- Fast Rewriting of Symmetric Polynomials.- On Implementation of Tree Synchronized Languages.