Rewriting Techniques and Applications [electronic resource]

Rewriting Techniques and Applications: 10th International Conference, RTA-99 Trento, Italy, July 2–4, 1999 Proceedings
Author: Paliath Narendran, Michael Rusinowitch
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66201-3
DOI: 10.1007/3-540-48685-2

Table of Contents:

• Solved Forms for Path Ordering Constraints
• Jeopardy
• Strategic Pattern Matching
• On the Strong Normalization of Natural Deduction with Permutation-Conversions
• Normalisation in Weakly Orthogonal Rewriting
• Strong Normalization of Proof Nets Modulo Structural Congruences
• Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas
• Undecidability of the
• Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting
• A New Result about the Decidability of the Existential One-Step Rewriting Theory
• A Fully Syntactic AC-RPO
• Theory Path Orderings
• A Characterisation of Multiply Recursive Functions with Higman’s Lemma
• 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
• Higher-Order Rewriting
• The Maude System
• TOY: A Multiparadigm Declarative System
• UniMoK: A System for Combining Equational Unification Algorithms

Mode of access: World Wide Web
Electronic reproduction