@InProceedings{Matiyasevich-RTA95,
author={Matiyasevich, Y.},
title={{On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (invited lecture)}},
pages={1},
crossref={RTA95}
}

@InProceedings{Marchiori-RTA95,
author={Marchiori, M.},
title={{Modularity of Completeness Revisited}},
pages={2--10},
crossref={RTA95}
}

@InProceedings{Steinbach-RTA95,
author={Steinbach, J.},
title={{Automatic Termination Proofs With Transformation Orderings}},
pages={11--25},
crossref={RTA95}
}

@InProceedings{LysneP-RTA95,
author={Lysne, O. and Piris, J.},
title={{A Termination Ordering for Higher Order Rewrite System}},
pages={26--40},
crossref={RTA95}
}

@InProceedings{ZantemaG-RTA95,
author={Zantema, H. and Geser, A.},
title={{A Complete Characterization of Termination of $0^p 1^q \rightarrow 1^r 0^s$}},
pages={41--55},
crossref={RTA95}
}

@InProceedings{Nieuwenhuis-RTA95,
author={Nieuwenhuis, R.},
title={{On Narrowing, Refutation Proofs and Constraints}},
pages={56--70},
crossref={RTA95}
}

@InProceedings{KuriharaKO-RTA95,
author={Kurihara, M. and Kondo, H. and Ohuchi, A.},
title={{Completion for Multiple Reduction Orderings}},
pages={71--85},
crossref={RTA95}
}

@InProceedings{SchmidF-RTA95,
author={Schmid, K. and Fettig, R.},
title={{Towards an Efficient Construction of Test Sets for Deciding Ground Reducability}},
pages={86--100},
crossref={RTA95}
}

@InProceedings{Stickel-RTA95,
author={Stickel, M. E.},
title={{Term Rewriting in Contemporary Resolution Theorem Proving (invited lecture)}},
pages={101},
crossref={RTA95}
}

@InProceedings{Asperti-RTA95,
author={Asperti, A.},
title={{$\delta\circ!\epsilon=1$: Optimizing Optimal $\lambda$-Calculus Implementations}},
pages={102--116},
crossref={RTA95}
}

@InProceedings{Graf-RTA95,
author={Graf, P.},
title={{Substitution Tree Indexing}},
pages={117--131},
crossref={RTA95}
}

@InProceedings{Alouini-RTA95,
author={Alouini, I.},
title={{Concurrent Garbage Collection for Concurrent Rewriting}},
pages={132--146},
crossref={RTA95}
}

@InProceedings{KampermanW-RTA95,
author={Kamperman, J. F. Th. and Walters, H. R.},
title={{Lazy Rewriting and Eager Machinery}},
pages={147--162},
crossref={RTA95}
}

@InProceedings{AnantharamanR-RTA95,
author={Anantharaman, S. and Richard, G.},
title={{A Rewrite Mechanism for Logic Programs with Negation}},
pages={163--178},
crossref={RTA95}
}

@InProceedings{SuzukiMI-RTA95,
author={Suzuki, T. and Middeldorp, A. and Ida, T.},
title={{Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides}},
pages={179--193},
crossref={RTA95}
}

@InProceedings{Senizergues-RTA95,
author={S{\'e}nizergues, G.},
title={{A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems}},
pages={194--209},
crossref={RTA95}
}

@InProceedings{Gehrke-RTA95,
author={Gehrke, W.},
title={{Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad}},
pages={210--224},
crossref={RTA95}
}

@InProceedings{CorradiniGM-RTA95,
author={Corradini, A. and Gadducci, F. and Montanari, U.},
title={{Relating Two Categorial Models of Term Rewriting}},
pages={225--240},
crossref={RTA95}
}

@InProceedings{Kahrs-RTA95,
author={Kahrs, S.},
title={{Towards a Domain Theory for Termination Proofs}},
pages={241--255},
crossref={RTA95}
}

@InProceedings{Nipkow-RTA95,
author={Nipkow, T.},
title={{Higher-Order Rewrite Systems (invited lecture)}},
pages={256},
crossref={RTA95}
}

@InProceedings{KennawayKSV-RTA95,
author={Kennaway, R. and Klop, J. W. and Sleep, M. R. and de Vries, F.-J.},
title={{Infinitary Lambda Calculi and B\"ohm Models}},
pages={257--270},
crossref={RTA95}
}

@InProceedings{Kuper-RTA95,
author={Kuper, J.},
title={{Proving the Genericity Lemma by Leftmost Reduction is Simple}},
pages={271--278},
crossref={RTA95}
}

@InProceedings{vanBakelF-RTA95,
author={van Bakel, S. and Fern{\'a}ndez, M.},
title={{(Head-) Normalization of Typeable Rewrite Systems}},
pages={279--293},
crossref={RTA95}
}

@InProceedings{LescanneR-RTA95,
author={Lescanne, P. and Rouyer-Degli, J.},
title={{Explicit Substitutions with de Bruijn's Levels}},
pages={294--308},
crossref={RTA95}
}

@InProceedings{Boulton-RTA95,
author={Boulton, R. J.},
title={{A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics}},
pages={309--323},
crossref={RTA95}
}

@InProceedings{WaltersZ-RTA95,
author={Walters, H. R. and Zantema, H.},
title={{Rewrite Systems for Integer Arithmetic}},
pages={324--338},
crossref={RTA95}
}

@InProceedings{AbdulrabM-RTA95,
author={Abdulrab, H. and Maksimenko, M.},
title={{General Solution of Systems of Linear Diophantine Equations and Inequations}},
pages={339--351},
crossref={RTA95}
}

@InProceedings{BaaderS-RTA95,
author={Baader, F. and Schulz, K. U.},
title={{Combination of Constraint Solving Techniques: An Algebraic Point of View}},
pages={352--366},
crossref={RTA95}
}

@InProceedings{OttoND-RTA95,
author={Otto, F. and Narendran, P. and Dougherty, D. J.},
title={{Some Independent Results for Equational Unification}},
pages={367--381},
crossref={RTA95}
}

@InProceedings{Burghardt-RTA95,
author={Burghardt, J.},
title={{Regular Substitution Sets: A Means of Controlling E-Unification}},
pages={382--396},
crossref={RTA95}
}

@InProceedings{AvenhausDF-RTA95,
author={Avenhaus, J. and Denzinger, J. and Fuchs, M.},
title={{DISCOUNT: A System for Distributed Equational Deduction (system description)}},
pages={397--402},
crossref={RTA95}
}

@InProceedings{Bellegarde-RTA95,
author={Bellegarde, F.},
title={{ASTRE: Towards a Fully Automated Program Transformation System (system description)}},
pages={403--407},
crossref={RTA95}
}

@InProceedings{BuendgenGK-RTA95,
author={B{\"u}ndgen, R. and G{\"o}bel, M. and K{\"u}chlin, W.},
title={{Parallel ReDuX $\rightarrow$ PaReDuX (system description)}},
pages={408--413},
crossref={RTA95}
}

@InProceedings{ChenA-RTA95,
author={Chen, T. and Anantharaman, S.},
title={{STORM: A Many-to-One Associative-Commutative Matcher (system description)}},
pages={414--419},
crossref={RTA95}
}

@InProceedings{ChazarainM-RTA95,
author={Chazarain, J. and Muller, S.},
title={{LEMMA: A System for Automated Synthesis of Recursive Programs in Equational Theories (system description)}},
pages={420--425},
crossref={RTA95}
}

@InProceedings{Giesl-RTA95,
author={Giesl, J.},
title={{Generating Polynomial Orderings for Termination Proofs (system description)}},
pages={426--431},
crossref={RTA95}
}

@InProceedings{Holmes-RTA95,
author={Holmes, M. R.},
title={{Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2 (system description)}},
pages={432--437},
crossref={RTA95}
}

@InProceedings{KirchnerM-RTA95,
author={Kirchner, H. and Moreau, P.-E.},
title={{Prototyping Completion with Constraints Using Computational Systems (system description)}},
pages={438--443},
crossref={RTA95}
}

@InProceedings{Paccanaro-RTA95,
author={Paccanaro, A.},
title={{Guiding Term Reduction Through a Neural Network: Some Prelimanary Results for the Group Theory (system description)}},
pages={444--449},
crossref={RTA95}
}


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

@Proceedings{RTA95,
year={1995},
month=apr # {~5--7,},
editor={Hsiang, Jieh},
title={{Rewriting Techniques and Applications, 6th International Conference, RTA-95}},
booktitle={{Rewriting Techniques and Applications, 6th International Conference, RTA-95}},
address={Kaiserslautern, Germany},
series={LNCS 914},
publisher={Springer-Verlag}
}