Front matter
670
Solved Forms for Path Ordering Constraints
Robert Nieuwenhuis and José Miguel Rivero
672
Jeopardy
Nachum Dershowitz and Subrata Mitra
671
Strategic Pattern Matching
Eelco Visser
671
On the Strong Normalization of Natural Deduction with Permutation-Conversions
Philippe de Groote
670
Normalisation in Weakly Orthogonal Rewriting
Vincent van Oostrom
673
Strong Normalization of Proof Nets Modulo Structural Congruences
Roberto Di Cosmo and Stefano Guerrini
70
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas
Bruno Courcelle
670
Undecidability of the
$* "*
\exists ^ * \forall ^ *
Part of the Theory of Ground Term Algebra Modulo an AC Symbol
Jerzy Marcinkowski
673
Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting
Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison and Marc Tommasi
70
A New Result about the Decidability of the Existential One-Step Rewriting Theory
Sébastien Limet and Pierre Réty
671
A Fully Syntactic AC-RPO
Albert Rubio
670
Theory Path Orderings
Jürgen Stuber
673
A Characterisation of Multiply Recursive Functions with Higman’s Lemma
Héléne Touzet
672
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
Franz Baader and Cesare Tinelli
670
Normalization via Rewrite Closures
L. Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan and A. Tiwari
670
Test Sets for the Universal and Existential Closure of Regular Tree Languages
Dieter Hofbauer and Maria Huber
670
Higher-Order Rewriting
Femke van Raamsdonk
671
The Maude System
M. Clavel, F. Durán, S. Eker, P. Lincoln and N. Martí-Oliet, et al.
70
TOY
: A Multiparadigm Declarative System
F. J. López Fraguas and J. Sánchez Hernández
670
UniMoK: A System for Combining Equational Unification Algorithms
Stephan Kepser and Jörn Richts
672
L®R 2
\overrightarrow {LR} ^2
: A Laboratory for Rapid Term Graph Rewriting
Rakesh Verma and Shalitha Senanayake
672
Decidability for Left-Linear Growing Term Rewriting Systems
Takashi Nagaya and Yoshihito Toyama
673
Transforming Context-Sensitive Rewrite Systems
Jürgen Giesl and Aart Middeldorp
670
Context-Sensitive AC-rewriting
M. C. F. Ferreira and A. L. Ribeiro
671
The Calculus of Algebraic Constructions
Frédéric Blanqui, Jean-Pierre Jouannaud and Mitsuhiro Okada
672
HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic
Gilles Dowek, Thérèse Hardin and Claude Kirchner
672
On the Connections between Rewriting and Formal Language Theory
Friedrich Otto
672
A Rewrite System Associated with Quadratic Pisot Units
Christiane Frougny and Jacques Sakarovitch
673
Fast Rewriting of Symmetric Polynomials
Manfred G#x00F6;bel
671
On Implementation of Tree Synchronized Languages
Frédéric Saubion and Igor Stéphan
Back matter