[10]	Maribel Fernández and Jean-Pierre Jouannaud. Modularity properties of term rewriting systems revisited. Technical Report 875, Laboratoire de Recherche en Informatique, November 1993. [ bib ]
[9]	Hubert Comon and Ralf Treinen. The first-order theory of lexicographic path orderings is undecidable. Research Report RR-93-42, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, September 1993. [ bib ]
[8]	Val Breazu-Tannen, Delia Kesner, and Laurence Puel. A typed pattern calculus. Technical Report 878, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, France, 1993. [ bib | .ps.gz ]
[7]	Alexandre Boudet and Hubert Comon. About the theory of tree embedding. Technical Report 870, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[6]	Hubert Comon and Ralf Treinen. The first-order theory of lexicographic path orderings is undecidable. Technical Report 867, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[5]	Hubert Comon and Florent Jacquemard. Ground reducibility and automata with disequality constraints. Technical Report 868, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[4]	Hubert Comon. Constraints in term algebras (short survey). Technical Report 869, Laboratoire de Recherche en Informatique, 1993. [ bib ]
[3]	Roberto Di Cosmo and Delia Kesner. Simulating expansions without expansions. Technical Report 1991, INRIA Rocquencourt, 1993. [ bib ]
[2]	Maribel Fernández. AC-Complement Problems: Satisfiability and Negation Elimination. Research Report 839, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, 1993. [ bib ]
[1]	J.-P. Jouannaud. Rewrite proofs and computations. Technical Report 880, Laboratoire de Recherche en Informatique, 1993. [ bib ]