| 2018 | PPDP | Combinatorics of Explicit Substitutions. | Maciej Bendkowski, Pierre Lescanne |
| 2016 | SOFSEM | A Natural Counting of Lambda Terms. | Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc |
| 2013 | CALCO | A Simple Case of Rationality of Escalation. | Pierre Lescanne |
| 2011 | ICTAC | Intersection Types for the Resource Control Lambda Calculi. | Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec |
| 2005 | LPAR | Strong Normalization of the Dual Classical Sequent Calculus. | Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec |
| 2004 | PPDP | Characterizing strong normalization in a language with control operators. | Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne |
| 1999 | FM | A Framework for Defining Object-Calculi. | Frdric Lang, Pierre Lescanne, Luigi Liquori |
| 1995 | COMPASS | The Lambda Calculus as an Abstract Data Type. | Pierre Lescanne |
| 1995 | FORTE | Formal Verfication of a Protocol for Communications over Faulty Channels. | Boutheina Chetali, Pierre Lescanne |
| 1994 | POPL | From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. | Pierre Lescanne |
| 1992 | CADE | Polynomial Interpretations and the Complexity of Algorithms. | Adam Cichon, Pierre Lescanne |
| 1991 | MFCS | Rewrite Orderings and Termination of Rewrite Systems. | Pierre Lescanne |
| 1990 | CADE | ORME: An Implementation of Completion Procedures as Sets of Transition Rules. | Pierre Lescanne |
| 1990 | LICS | Well Rewrite Orderings | Pierre Lescanne |
| 1987 | LICS | Decidability of the Confluence of Ground Term Rewriting Systems | Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne |
| 1987 | LICS | Solving Disequations | Claude Kirchner, Pierre Lescanne |
| 1987 | STACS | REVE: A Rewrite Rule Laboratory. | Pierre Lescanne |
| 1986 | CADE | An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. | Ahlem Ben Cherifa, Pierre Lescanne |
| 1986 | CADE | Proving Termination of Associative Commutative Rewriting Systems by Rewriting. | Isabelle Gnaedig, Pierre Lescanne |
| 1986 | CADE | REVE a Rewrite Rule Laboratory. | Pierre Lescanne |
| 1984 | CADE | Term Rewriting Systems and Algebra. | Pierre Lescanne |
| 1983 | ICALP | On the Study Data Structures: Binary Tournaments with Repeated Keys. | Pierre Lescanne, Jean-Marc Steyaert |
| 1983 | POPL | Computer Experiments with the Reve Term Rewriting System Generator. | Pierre Lescanne |
| 1981 | IJCAI | Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. | Pierre Lescanne |