[11]	Évelyne Contejean and Ana Paula Tomas. On Symmetries in Systems Coming from AC-Unification of Higher-Order Patterns. In Pierre Flener and Justin Pearson, editors, SymCon'01, Symmetry in Constraints, Paphos, Cyprus, December 2001. [ bib ]
[10]	Eduardo Bonelli, Delia Kesner, and Alejandrio Ríos. From higher-order to first-order rewriting (extended abstract). In Aart Middeldorp, editor, 12th International Conference on Rewriting Techniques and Applications, volume 2051 of Lecture Notes in Computer Science, Utrecht, The Netherlands, May 2001. Springer. [ bib ]
[9]	Alexandre Boudet and Evelyne Contejean. Combining Pattern E-unification Algorithms. In Aart Middeldorp, editor, 12th International Conference on Rewriting Techniques and Applications, volume 2051 of Lecture Notes in Computer Science, pages 63-76, Utrecht, The Netherlands, May 2001. Springer. [ bib | DOI | Abstract ]
[8]	Gabriel Ciobanu and Mihai Rotaru. JC-Nets. volume 2055 of Lecture Notes in Computer Science, pages 190-201, Chisinau, Moldova, May 2001. Springer. [ bib ]
[7]	Sylvain Conchon and François Pottier. JOIN(X): Constraint-based type inference for the join-calculus. In David Sands, editor, Proceedings of the 10th European Symposium on Programming (ESOP'01), volume 2028 of Lecture Notes in Computer Science, pages 221-236, Genova, Italy, April 2001. Springer. [ bib | .ps.gz ]
[6]	Frédéric Blanqui. Definitions by rewriting in the calculus of constructions. In Sixteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Comp. Soc. Press, 2001. [ bib ]
[5]	Pierre Courtieu. Normalized Types. In Laurent Fribourg, editor, Proceedings of the Annual Conference of the European Association for Computer Science Logic, volume 2142 of Lecture Notes in Computer Science, pages 554-569, Paris, France, September 2001. Springer. [ bib ]
[4]	Jean-Christophe Filliâtre, Sam Owre, Harald Rueß, and Natarajan Shankar. ICS: Integrated Canonization and Solving (Tool presentation). In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of CAV'2001, volume 2102 of Lecture Notes in Computer Science, pages 246-249. Springer, 2001. [ bib ]
[3]	Christine Paulin-Mohring. Modelisation of timed automata in Coq. In N. Kobayashi and B. Pierce, editors, Theoretical Aspects of Computer Software (TACS'2001), volume 2215 of Lecture Notes in Computer Science, pages 298-315. Springer-Verlag, 2001. [ bib ]
[2]	Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance constraints: Algorithms and complexity. In Michael Moortgat, editor, Logical Aspects of Computational Linguistics 1998, volume 2014 of Lecture Notes in Artificial Intelligence, pages 106-125, Grenoble, France, 2001. Springer. [ bib | .ps.gz ]
[1]	Xavier Urbain. Automated incremental termination proofs for hierarchically defined term rewriting systems. In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors, First International Joint Conference on Automated Reasoning, volume 2083 of Lecture Notes in Artificial Intelligence, pages 485-498, Siena, Italy, June 2001. Springer. [ bib | .ps.gz ]