@InProceedings{Courcelle-RTA99,
author={Courcelle, B.},
title={{Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas (invited lecture)}},
pages={90--91},
crossref={RTA99}
}

@InProceedings{vanRaamsdonk-RTA99,
author={van Raamsdonk, F.},
title={{Higher-Order Rewriting (invited tutorial)}},
pages={220--239},
crossref={RTA99}
}

@InProceedings{Otto-RTA99,
author={Otto, F.},
title={{On the Connections between Rewriting and Formal Language Theory (invited lecture)}},
pages={332--355},
crossref={RTA99}
}

@InProceedings{NieuwenhuisR-RTA99,
author={Nieuwenhuis, R. and Rivero, J. M.},
title={{Solved Forms for Path Ordering Constraints}},
pages={1--15},
crossref={RTA99}
}

@InProceedings{DershowitzM-RTA99,
author={Dershowitz, N. and Mitra, S.},
title={{Jeopardy}},
pages={16--29},
crossref={RTA99}
}

@InProceedings{Visser-RTA99,
author={Visser, E.},
title={{Strategic Pattern Matching}},
pages={30--44},
crossref={RTA99}
}

@InProceedings{deGroote-RTA99,
author={de Groote, P.},
title={{On the Strong Normalisation of Natural Deduction with Permutation-Conversions}},
pages={45--59},
crossref={RTA99}
}

@InProceedings{vanOostrom-RTA99,
author={van Oostrom, V.},
title={{Normalisation in Weakly Orthogonal Rewriting}},
pages={60--74},
crossref={RTA99}
}

@InProceedings{DiCosmoG-RTA99,
author={Di Cosmo, R. and Guerrini, S.},
title={{Strong Normalization of Proof Nets Modulo Structural Congruences}},
pages={75--89},
crossref={RTA99}
}

@InProceedings{Marcinkowski-RTA99,
author={Marcinkowski, J.},
title={{Undecidability of the $\exists^*\forall^*$ Part of the Theory of Ground Term Algebra Modulo an AC Symbol}},
pages={92--102},
crossref={RTA99}
}

@InProceedings{CaronSTT-RTA99,
author={Caron, A.-C. and Seynhaeve, F. and Tison, S. and Tommasi, M.},
title={{Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting}},
pages={103--117},
crossref={RTA99}
}

@InProceedings{LimetR-RTA99,
author={Limet, S. and R\'ety, P.},
title={{A New Result about the Decidability of the Existential One-Step Rewriting Theory}},
pages={118--132},
crossref={RTA99}
}

@InProceedings{Rubio-RTA99,
author={Rubio, A.},
title={{A Fully Syntactic AC-RPO}},
pages={133--147},
crossref={RTA99}
}

@InProceedings{Stuber-RTA99,
author={Stuber, J.},
title={{Theory Path Orderings}},
pages={148--162},
crossref={RTA99}
}

@InProceedings{Touzet-RTA99,
author={Touzet, H.},
title={{A Characterisation of Multiply Recursive Functions with Higman's Lemma}},
pages={163--174},
crossref={RTA99}
}

@InProceedings{BaaderT-RTA99,
author={Baader, F. and Tinelli, C.},
title={{Deciding the Word Problem in the Union of Equational Theories Sharing Constructors}},
pages={175--189},
crossref={RTA99}
}

@InProceedings{BachmairRRT-RTA99,
author={Bachmair, L. and Ramakrishnan, C. R. and Ramakrishnan, I. V. and Tiwari, A.},
title={{Normalization via Rewrite Closures}},
pages={190--204},
crossref={RTA99}
}

@InProceedings{HofbauerH-RTA99,
author={Hofbauer, D. and Huber, M.},
title={{Test Sets for the Universal and Existential Closure of Regular Tree Languages}},
pages={205--219},
crossref={RTA99}
}

@InProceedings{NagayaT-RTA99,
author={Nagaya, T. and Toyama, Y.},
title={{Decidability for Left-Linaer Growing Term Rewriting Systems}},
pages={256--270},
crossref={RTA99}
}

@InProceedings{GieslM-RTA99,
author={Giesl, J. and Middeldorp, A.},
title={{Transforming Context-Sensitive Rewrite Systems}},
pages={271--287},
crossref={RTA99}
}

@InProceedings{FerreiraR-RTA99,
author={Ferreira, M. C. F. and Ribeiro, A. L.},
title={{Context-Sensitive AC-Rewriting}},
pages={286--300},
crossref={RTA99}
}

@InProceedings{BlanquiJO-RTA99,
author={Blanqui, F. and Jouannaud, J.-P. and Okada, M.},
title={{The Calculus of algebraic Constructions}},
pages={301-316},
crossref={RTA99}
}

@InProceedings{DowekHK-RTA99,
author={Dowek, G. and Hardin, T. and Kirchner, C.},
title={{HOL-$\lambda\sigma$: An Intentional First-Order Expression of Higher-Order Logic}},
pages={317--331},
crossref={RTA99}
}

@InProceedings{FrougnyS-RTA99,
author={Frougny, C. and Sakarovitch, J.},
title={{A Rewrite System Associated with Quadratic Pisot Units}},
pages={356--370},
crossref={RTA99}
}

@InProceedings{Goebel-RTA99,
author={G{\"o}bel, M.},
title={{Fast Rewriting of Symmetric Polynomials}},
pages={371--381},
crossref={RTA99}
}

@InProceedings{SaubionS-RTA99,
author={Saubion, F. and St\'ephan, I.},
title={{On Implementation of Tree Synchronized Languages}},
pages={382--396},
crossref={RTA99}
}

@InProceedings{Maude-RTA99,
author={Clavel, M. and Dur\'an, F. and Eker, S. and Lincoln, P. and Mart\'{\i}-Oliet, N. and Meseguer J. and Quesada, J. F.},
title={{The Maude System (system description)}},
pages={240--243},
crossref={RTA99}
}

@InProceedings{Toy-RTA99,
author={F. J. L\'opez-Fraguas and J. S\'anchez-Hern\'andez},
title={{TOY: A Multiparadigm Declarative System (system description)}},
pages={244--247},
crossref={RTA99}
}

@InProceedings{UniMoK-RTA99,
author={Kepser, S. and Richts, J.},
title={{UniMoK: A System for Combining Equational Unification Algorithm (system description)}},
pages={248--251},
crossref={RTA99}
}

@InProceedings{LR2-RTA99,
author={Verma, R. M. and Senanayake, S.},
title={{LR2: A Laboratory for Rapid Term Graph Rewriting (system description)}},
pages={252--255},
crossref={RTA99}
}


% CROSSREFERENCES
% These must remain at the end of this file.

@Proceedings{RTA99,
year={1999},
month=jul # {~2--4,},
editor={Narendran, Paliath and Rusinowitch, Micha\"el},
title={{Rewriting Techniques and Applications, 10th International Conference, RTA-99}},
booktitle={{Rewriting Techniques and Applications, 10th International Conference, RTA-99}},
address={Trento, Italy},
series={LNCS 1631},
publisher={Springer-Verlag}
}