Equational problems anddisunification H Comon, P Lescanne Journal of Symbolic Computation 7 (3-4), 371-425, 1989 | 327 | 1989 |
Termination of rewriting systems by polynomial interpretations and its implementation AB Cherifa, P Lescanne Science of computer Programming 9 (2), 137-159, 1987 | 232 | 1987 |
From λσ to λν: a journey through calculi of explicit substitutions P Lescanne Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of …, 1994 | 209 | 1994 |
Computer experiments with the REVE term rewriting system generator P Lescanne Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of …, 1983 | 195 | 1983 |
λν, a calculus of explicit substitutions which preserves strong normalisation D Briaud, P Lescanne, J Rouyer-Degli Journal of Functional Programming 6 (5), 699-722, 1996 | 155 | 1996 |
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems M Dauchet, T Heuillard, P Lescanne, S Tison Information and Computation 88 (2), 187-201, 1990 | 117 | 1990 |
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 | 114 | 1985 |
Algebraic system specification and development: A survey and annotated bibliography M Bidoit, HJ Kreowski, P Lescanne, F Orejas, D Sannella Springer Berlin Heidelberg, 1991 | 106 | 1991 |
Recursive decomposition ordering JP Jouannaud, P Lescanne, F Reinig | 106 | 1982 |
Termination by completion F Bellegarde, P Lescanne Applicable Algebra in Engineering, Communication and Computing 1, 79-96, 1990 | 77 | 1990 |
Intersection types for explicit substitutions S Lengrand, P Lescanne, D Dougherty, M Dezani-Ciancaglini, ... Information and Computation 189 (1), 17-42, 2004 | 70 | 2004 |
Counting and generating lambda terms K Grygiel, P Lescanne Journal of Functional Programming 23 (5), 594-628, 2013 | 69 | 2013 |
Tools for proving inductive equalities, relative completeness, and ω-completeness A Lazrek, P Lescanne, JJ Thiel Information and Computation 84 (1), 47-70, 1990 | 63 | 1990 |
On multiset orderings JP Jouannaud, P Lescanne Information processing letters 15 (2), 57-63, 1982 | 63 | 1982 |
Polynomial interpretations and the complexity of algorithms A Cichon, P Lescanne Automated Deduction—CADE-11: 11th International Conference on Automated …, 1992 | 61 | 1992 |
The Language χ: Circuits, Computations and Classical Logic: S Van Bakel, S Lengrand, P Lescanne Theoretical Computer Science: 9th Italian Conference, ICTCS 2005, Siena …, 2005 | 60 | 2005 |
Explicit substitutions with de Bruijn's levels P Lescanne, J Rouyer-Degli Rewriting Techniques and Applications: 6th International Conference, RTA-95 …, 1995 | 58 | 1995 |
The calculus of explicit substitutions lambda-upsilon P Lescanne, J Rouyer-Degli INRIA, 1994 | 50 | 1994 |
On the recursive decomposition ordering with lexicographical status and other related orderings P Lescanne Journal of Automated Reasoning 6, 39-49, 1990 | 50 | 1990 |
Characterizing strong normalization in the Curien–Herbelin symmetric lambda calculus: extending the Coppo–Dezani heritage DJ Dougherty, S Ghilezan, P Lescanne Theoretical Computer Science 398 (1-3), 114-128, 2008 | 46 | 2008 |