Équivalence Entre la Famille des Ensembles Réguliers et la Famille des Ensembles Algébriques. - Pierre Lescanne (RAIRO Theor. Informatics Appl., 1976)

Manipulation d'arbres syntaxiques et contruction de programmes (Résumé). - Jacques Guyard; Pierre Lescanne (CLAAP, 1980)

Manipulation d'arbres syntaxiques et contruction de programmes. - Jacques Guyard; Pierre Lescanne (CLAAP, 1980)

Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. - Pierre Lescanne (IJCAI, 1981)

Recursive Decomposition Ordering. - Jean-Pierre Jouannaud; Pierre Lescanne; F. Reinig (Formal Description of Programming Concepts, 1982)

On Multiset Orderings. - Jean-Pierre Jouannaud; Pierre Lescanne (Inf. Process. Lett., 1982)

Modèles non Déterministes de Types Abstraits. - Pierre Lescanne (RAIRO Theor. Informatics Appl., 1982)

Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems. - Pierre Lescanne (RAIRO Theor. Informatics Appl., 1982)

On the Study Data Structures: Binary Tournaments with Repeated Keys. - Pierre Lescanne; Jean-Marc Steyaert (ICALP, 1983)

Computer Experiments with the Reve Term Rewriting System Generator. - Pierre Lescanne (POPL, 1983)

Behavioural Categoricity of Abstract Data Type Specifications. - Pierre Lescanne (Comput. J., 1983)

Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. - Pierre Lescanne (CAAP, 1984)

Term Rewriting Systems and Algebra. - Pierre Lescanne (CADE, 1984)

NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. - Pierre Réty; Claude Kirchner; Hélène Kirchner; Pierre Lescanne (RTA, 1985)

An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. - Ahlem Ben Cherifa; Pierre Lescanne (CADE, 1986)

Proving Termination of Associative Commutative Rewriting Systems by Rewriting. - Isabelle Gnaedig; Pierre Lescanne (CADE, 1986)

Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings. - Pierre Lescanne (Bull. EATCS, 1986)

Current Trends in Rewriting Techniques and Related Problems. - Pierre Lescanne (Trends in Computer Algebra, 1987)

Decidability of the Confluence of Ground Term Rewriting Systems - Max Dauchet; Sophie Tison; Thierry Heuillard; Pierre Lescanne (LICS, 1987)

Solving Disequations - Claude Kirchner; Pierre Lescanne (LICS, 1987)

REVE: A Rewrite Rule Laboratory. - Pierre Lescanne (STACS, 1987)

Transformation Ordering. - Françoise Bellegarde; Pierre Lescanne (TAPSOFT, Vol.1, 1987)

Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation. - Ahlem Ben Cherifa; Pierre Lescanne (Sci. Comput. Program., 1987)

Completion Procedures as Transition Rules + Control. - Pierre Lescanne (TAPSOFT, Vol.1, 1989)

Well quasi-ordering in a paper by Maurice Janet. - Pierre Lescanne (Bull. EATCS, 1989)

Equational Problems and Disunification. - Hubert Comon; Pierre Lescanne (J. Symb. Comput., 1989)

Implementations of Completion by Transition Rules + Control: ORME. - Pierre Lescanne (ALP, 1990)

ORME: An Implementation of Completion Procedures as Sets of Transition Rules. - Pierre Lescanne (CADE, 1990)

Well Rewrite Orderings - Pierre Lescanne (LICS, 1990)

Termination by Completion. - Françoise Bellegarde; Pierre Lescanne (Appl. Algebra Eng. Commun. Comput., 1990)

On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. - Pierre Lescanne (J. Autom. Reason., 1990)

Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness - Azeddine Lazrek; Pierre Lescanne; Jean-Jacques Thiel (Inf. Comput., 1990)

Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems - Max Dauchet; Thierry Heuillard; Pierre Lescanne; Sophie Tison (Inf. Comput., 1990)

Rewrite Orderings and Termination of Rewrite Systems. - Pierre Lescanne (MFCS, 1991)

Rewriting techniques and applications, RTA'91. - Hélène Kirchner; Pierre Lescanne (SIGACT News, 1991)

Polynomial Interpretations and the Complexity of Algorithms. - Adam Cichon; Pierre Lescanne (CADE, 1992)

An Exercise in LP: The Proof of a Non Restoring Division Circuit. - Boutheina Chetali; Pierre Lescanne (Larch, 1992)

The Term Rewriting Approach to Automated Theorem Proving. - Jieh Hsiang; Hélène Kirchner; Pierre Lescanne; Michaël Rusinowitch (J. Log. Program., 1992)

Introduction - ALP 1988. - Pierre Lescanne; Wolfgang Wechler (J. Log. Program., 1992)

Well Rewrite Orderings and Well Quasi-Orderings. - Pierre Lescanne (J. Symb. Comput., 1992)

From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. - Pierre Lescanne (POPL, 1994)

On Termination of One Rule Rewrite Systems. - Pierre Lescanne (Theor. Comput. Sci., 1994)

The Lambda Calculus as an Abstract Data Type. - Pierre Lescanne (COMPASS/ADT, 1995)

Formal Verfication of a Protocol for Communications over Faulty Channels. - Boutheina Chetali; Pierre Lescanne (FORTE, 1995)

Explicit Substitutions with de Bruijn's Levels. - Pierre Lescanne; Jocelyne Rouyer-Degli (RTA, 1995)

Termination of Rewrite Systems by Elementary Interpretations. - Pierre Lescanne (Formal Aspects Comput., 1995)

Calculi of Explicit Substitutions: New Results. - Pierre Lescanne (APPIA-GULP-PRODE, 1996)

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. - Zine-El-Abidine Benaissa; Pierre Lescanne; Kristoffer Høgsbro Rose (PLILP, 1996)

lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation. - Zine-El-Abidine Benaissa; Daniel Briaud; Pierre Lescanne; Jocelyne Rouyer-Degli (J. Funct. Program., 1996)

Valentin M. Antimirov (1961-1995). - Gregory Kucherov; Pierre Lescanne; Peter D. Mosses (Theor. Comput. Sci., 1996)

A Framework for Defining Object-Calculi. - Frédéric Lang; Pierre Lescanne; Luigi Liquori (World Congress on Formal Methods, 1999)

On Strong Normalization of Explicit Substitution Calculi (Short Note). - Frédéric Lang; Pierre Lescanne (J. Funct. Log. Program., 2000)

Special Issue "Termination". - Jürgen Giesl; Pierre Lescanne (Appl. Algebra Eng. Commun. Comput., 2001)

An Improved System of Intersection Types for Explicit Substitutions. - Daniel J. Dougherty; Stéphane Lengrand; Pierre Lescanne (IFIP TCS, 2002)

Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract. - Silvia Ghilezan; Pierre Lescanne (TYPES, 2003)

Reductions, Intersection Types, and Explicit Substitutions. - Daniel J. Dougherty; Pierre Lescanne (Math. Struct. Comput. Sci., 2003)

Characterizing strong normalization in a language with control operators. - Daniel J. Dougherty; Silvia Ghilezan; Pierre Lescanne (PPDP, 2004)

Intersection and Union Types in the lambda-my-my/tilde-calculus. - Daniel J. Dougherty; Silvia Ghilezan; Pierre Lescanne (ITRS, 2004)

Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. - Daniel J. Dougherty; Pierre Lescanne; Luigi Liquori; Frédéric Lang (TERMGRAPH, 2004)

Preface. - Pierre Lescanne; René David; Marek Zaionc (CLA, 2004)

Intersection types for explicit substitutions. - Stéphane Lengrand; Pierre Lescanne; Daniel J. Dougherty; Mariangiola Dezani-Ciancaglini; Steffen van Bakel (Inf. Comput., 2004)

The Language chi: Circuits, Computations and Classical Logic. - Steffen van Bakel; Stéphane Lengrand; Pierre Lescanne (ICTCS, 2005)

Strong Normalization of the Dual Classical Sequent Calculus. - Daniel J. Dougherty; Silvia Ghilezan; Pierre Lescanne; Silvia Likavec (LPAR, 2005)

Rewriting Game Theory as a Foundation for State-Based Models of Gene Regulation. - Chafika Chettaoui; Franck Delaplace; Pierre Lescanne; Mun'delanji Vestergaard; René Vestergaard (CMSB, 2006)

Mechanizing common knowledge logic using COQ. - Pierre Lescanne (Ann. Math. Artif. Intell., 2006)

Addressed term rewriting systems: application to a typed object calculus. - Daniel J. Dougherty; Pierre Lescanne; Luigi Liquori (Math. Struct. Comput. Sci., 2006)

Review of "Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004. - Pierre Lescanne (SIGACT News, 2006)

Dynamic Logic of Common Knowledge in a Proof Assistant - Pierre Lescanne; Jérôme Puisségur (CoRR, 2007)

(Mechanical) Reasoning on Infinite Extensive Games - Pierre Lescanne (CoRR, 2008)

Conversion/Preference Games - Stéphane Le Roux 001; Pierre Lescanne; René Vestergaard (CoRR, 2008)

Computation with classical sequents. - Steffen van Bakel; Pierre Lescanne (Math. Struct. Comput. Sci., 2008)

Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage. - Daniel J. Dougherty; Silvia Ghilezan; Pierre Lescanne (Theor. Comput. Sci., 2008)

Intuitionistic Sequent-Style Calculus with Explicit Structural Rules. - Silvia Ghilezan; Jelena Ivetic; Pierre Lescanne; Dragisa Zunic (TbiLLC, 2009)

Deconstruction of Infinite Extensive Games using coinduction - Pierre Lescanne (CoRR, 2009)

Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games - Pierre Lescanne (CoRR, 2009)

On the Rationality of Escalation - Pierre Lescanne; Matthieu Perrinel (CoRR, 2010)

Intersection Types for the Resource Control Lambda Calculi. - Silvia Ghilezan; Jelena Ivetic; Pierre Lescanne; Silvia Likavec (ICTAC, 2011)

Les crashs sont rationnels - Pierre Lescanne (CoRR, 2011)

Rationality and Escalation in Infinite Extensive Games - Pierre Lescanne (CoRR, 2011)

Resource control and strong normalisation - Silvia Ghilezan; Jelena Ivetic; Pierre Lescanne; Silvia Likavec (CoRR, 2011)

"Backward" coinduction, Nash equilibrium and the rationality of escalation. - Pierre Lescanne; Matthieu Perrinel (Acta Informatica, 2012)

Computational interpretation of classical logic with explicit structural rules - Silvia Ghilezan; Pierre Lescanne; Dragisa Zunic (CoRR, 2012)

Common Knowledge Logic in a Higher Order Proof Assistant. - Pierre Lescanne (Programming Logics, 2013)

A Simple Case of Rationality of Escalation. - Pierre Lescanne (CALCO, 2013)

A journey through resource control lambda calculi and explicit substitution using intersection types (an account). - Silvia Ghilezan; Jelena Ivetic; Pierre Lescanne; Silvia Likavec (CoRR, 2013)

An exercise on streams: convergence acceleration. - Pierre Lescanne (CoRR, 2013)

Bubbles are rational - Pierre Lescanne (CoRR, 2013)

Counting and generating lambda terms. - Katarzyna Grygiel; Pierre Lescanne (J. Funct. Program., 2013)

On counting untyped lambda terms. - Pierre Lescanne (Theor. Comput. Sci., 2013)

Les krachs sont rationnels. - Pierre Lescanne (Tech. Sci. Informatiques, 2013)

Resource control and intersection types: an intrinsic connection. - Silvia Ghilezan; Jelena Ivetic; Pierre Lescanne; Silvia Likavec (CoRR, 2014)

Counting Terms in the Binary Lambda Calculus. - Katarzyna Grygiel; Pierre Lescanne (CoRR, 2014)

Boltzmann samplers for random generation of lambda terms. - Pierre Lescanne (CoRR, 2014)

Counting and Generating Terms in the Binary Lambda Calculus (Extended version). - Katarzyna Grygiel; Pierre Lescanne (CoRR, 2015)

Intelligent escalation and the principle of relativity. - Pierre Lescanne (CoRR, 2015)

The risk of divergence. - Pierre Lescanne (CoRR, 2015)

Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042). - Samson Abramsky; Alexander Kurz 001; Pierre Lescanne; Viktor Winschel (Dagstuhl Reports, 2015)

Counting and generating terms in the binary lambda calculus. - Katarzyna Grygiel; Pierre Lescanne (J. Funct. Program., 2015)

A Natural Counting of Lambda Terms. - Maciej Bendkowski; Katarzyna Grygiel; Pierre Lescanne; Marek Zaionc (SOFSEM, 2016)

Combinatorics of λ-terms: a natural approach. - Maciej Bendkowski; Katarzyna Grygiel; Pierre Lescanne; Marek Zaionc (CoRR, 2016)

A Congruence Relation for Restructuring Classical Terms. - Dragisa Zunic; Pierre Lescanne (ICTCS/CILC, 2017)

Combinatorics of $$ lambda$$-terms: a natural approach. - Maciej Bendkowski; Katarzyna Grygiel; Pierre Lescanne; Marek Zaionc (J. Log. Comput., 2017)

Combinatorics of Explicit Substitutions. - Maciej Bendkowski; Pierre Lescanne (PPDP, 2018)

Counting Environments and Closures. - Maciej Bendkowski; Pierre Lescanne (FSCD, 2018)

Dependent Types for Extensive Games. - Pierre Lescanne (J. Formaliz. Reason., 2018)

Quantitative Aspects of Linear and Affine Closed Lambda Terms. - Pierre Lescanne (ACM Trans. Comput. Log., 2018)

On the enumeration of closures and environments with an application to random generation. - Maciej Bendkowski; Pierre Lescanne (Log. Methods Comput. Sci., 2019)

Extensive Infinite Games and Escalation, an exercise in Agda. - Pierre Lescanne (CoRR, 2020)

Zaionc paradox revisited. - Pierre Lescanne (CoRR, 2021)

L-types for resource awareness: an implicit name approach. - Silvia Ghilezan; Jelena Ivetic; Simona Kasterovic; Pierre Lescanne (CoRR, 2021)

Linear random generation of Motzkin trees. - Pierre Lescanne (CoRR, 2022)

Almost all Classical Theorems are Intuitionistic. - Pierre Lescanne (RAIRO Theor. Informatics Appl., 2022)

Holonomic equations and efficient random generation of binary trees. - Pierre Lescanne (Discret. Math. Theor. Comput. Sci., 2023)