| Solving equations in abstract algebras: A rule-based survey of unification JP Jouannaud, C Kirchner Computational Logic, 257-321, 1991 | 439 | 1991 |
| An overview of ELAN P Borovanský, C Kirchner, H Kirchner, PE Moreau, C Ringeissen Electronic Notes in Theoretical Computer Science 15, 55-70, 1998 | 298 | 1998 |
| Theorem proving modulo G Dowek, T Hardin, C Kirchner Journal of Automated Reasoning 31 (1), 33-72, 2003 | 260 | 2003 |
| Higher-order unification via explicit substitutions G Dowek, T Hardin, C Kirchner Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 366-374, 1995 | 241* | 1995 |
| Deduction with symbolic constraints C Kirchner, H Kirchner, M Rusinowitch | 223 | 1990 |
| An introduction to OBJ 3 J Goguen, C Kirchner, H Kirchner, A Mégrelis, J Meseguer, T Winkler International Workshop on Conditional Term Rewriting Systems, 258-263, 1987 | 173 | 1987 |
| ELAN: A logical framework based on computational systems P Borovanský, C Kirchner, H Kirchner, PE Moreau, M Vittek Electronic Notes in Theoretical Computer Science 4, 35-50, 1996 | 167 | 1996 |
| ELAN from a rewriting logic point of view P Borovanský, C Kirchner, H Kirchner, PE Moreau Theoretical Computer Science 285 (2), 155-185, 2002 | 165 | 2002 |
| Designing constraint logic programming languages using computational systems C Kirchner, H Kirchner, M Vittek Principles and Practice of Constraint Programming. The Newport Papers, 131-158, 1995 | 162 | 1995 |
| The rewriting calculus-Part II H Cirstea, C Kirchner Logic Journal of IGPL 9 (3), 377-410, 2001 | 149 | 2001 |
| Methodes et outils de conception systematique d'algorithes d'unification dans les theories equationnelles C Kirchner These d'etat, Universite de Nancy I, 1985 | 147 | 1985 |
| Operational semantics of OBJ-3 C Kirchner, H Kirchner, J Meseguer International Colloquium on Automata, Languages, and Programming, 287-301, 1988 | 144 | 1988 |
| Incremental construction of unification algorithms in equational theories JP Jouannaud, C Kirchner, H Kirchner International Colloquium on Automata, Languages, and Programming, 361-373, 1983 | 118 | 1983 |
| NARROWER: a new algorithm for unification and its application to logic programming P Rety, C Kirchner, H Kirchner, P Lescanne International Conference on Rewriting Techniques and Applications, 141-157, 1985 | 112 | 1985 |
| REWRITING WITH STRATEGIES IN: A FUNCTIONAL SEMANTICS P Borovanský, C Kirchner, H Kirchner, C Ringeissen International Journal of Foundations of Computer Science 12 (01), 69-95, 2001 | 106 | 2001 |
| Unification via Explicit Substitutions: The Case of Higher-Order Patterns. G Dowek, T Hardin, C Kirchner, F Pfenning JICSLP, 259-273, 1996 | 105 | 1996 |
| Pure patterns type systems G Barthe, H Cirstea, C Kirchner, L Liquori ACM SIGPLAN Notices 38 (1), 250-261, 2003 | 99 | 2003 |
| HOL-λσ: an intentional first-order expression of higher-order logic G Dowek, T Hardin, C Kirchner Mathematical Structures in Computer Science 11 (1), 21-45, 2001 | 90 | 2001 |
| Rewriting solving proving C Kirchner, H Kirchner | 87 | 1996 |
| Computing unification algorithms C Kirchner LICS, 206-216, 1986 | 84 | 1986 |
Pierre-Etienne MoreauProfessor Mines Nancy - Université de LorraineDirección de correo verificada de loria.fr
