Pierre Lescanne

Pierre Lescanne: On counting untyped lambda terms. Theor. Comput. Sci. 474: 80-97 (2013)

Pierre Lescanne, Matthieu Perrinel: "Backward" coinduction, Nash equilibrium and the rationality of escalation. Acta Inf. 49(3): 117-137 (2012)

Silvia Ghilezan, Pierre Lescanne, Dragisa Zunic: Computational interpretation of classical logic with explicit structural rules. CoRR abs/1203.4754 (2012)

Katarzyna Grygiel, Pierre Lescanne: Counting and generating lambda terms. CoRR abs/1210.2610 (2012)

Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec: Intersection Types for the Resource Control Lambda Calculi. ICTAC 2011: 116-134

Pierre Lescanne: On counting untyped lambda terms. CoRR abs/1107.1327 (2011)

Pierre Lescanne: Les crashs sont rationnels. CoRR abs/1111.7299 (2011)

Pierre Lescanne: Rationality and Escalation in Infinite Extensive Games. CoRR abs/1112.1185 (2011)

Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec: Resource control and strong normalisation. CoRR abs/1112.3455 (2011)

Pierre Lescanne, Matthieu Perrinel: On the Rationality of Escalation. CoRR abs/1004.5257 (2010)

Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Dragisa Zunic: Intuitionistic Sequent-Style Calculus with Explicit Structural Rules. TbiLLC 2009: 101-124

Pierre Lescanne: Deconstruction of Infinite Extensive Games using coinduction. CoRR abs/0904.3528 (2009)

Pierre Lescanne: Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games. CoRR abs/0907.5469 (2009)

Pierre Lescanne, Matthieu Perrinel: On the Rationality of Escalation. CoRR abs/0912.1746 (2009)

Steffen van Bakel, Pierre Lescanne: Computation with classical sequents. Mathematical Structures in Computer Science 18(3): 555-609 (2008)

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

Pierre Lescanne: (Mechanical) Reasoning on Infinite Extensive Games. CoRR abs/0805.1798 (2008)

Stéphane Le Roux, Pierre Lescanne, René Vestergaard: Conversion/Preference Games. CoRR abs/0811.0071 (2008)

Pierre Lescanne, Jérôme Puisségur: Dynamic Logic of Common Knowledge in a Proof Assistant. CoRR abs/0712.3146 (2007)

Pierre Lescanne: Common knowledge logic in a higher order proof assistant? CoRR abs/0712.3147 (2007)

Pierre Lescanne: Mechanizing common knowledge logic using COQ. Ann. Math. Artif. Intell. 48(1-2): 15-43 (2006)

Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori: Addressed term rewriting systems: application to a typed object calculus. Mathematical Structures in Computer Science 16(4): 667-709 (2006)

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

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

Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang: Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. Electr. Notes Theor. Comput. Sci. 127(5): 57-82 (2005)

Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne: Intersection and Union Types in the lambda-my-my/tilde-calculus. Electr. Notes Theor. Comput. Sci. 136: 153-172 (2005)

Pierre Lescanne, René David, Marek Zaionc: Preface. Electr. Notes Theor. Comput. Sci. 140: 1 (2005)

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

Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec: Strong Normalization of the Dual Classical Sequent Calculus. LPAR 2005: 169-183

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

Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne: Characterizing strong normalization in a language with control operators. PPDP 2004: 155-166

Daniel J. Dougherty, Pierre Lescanne: Reductions, Intersection Types, and Explicit Substitutions. Mathematical Structures in Computer Science 13(1): 55-85 (2003)

Silvia Ghilezan, Pierre Lescanne: Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract. TYPES 2003: 226-241

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

Jürgen Giesl, Pierre Lescanne: Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. 12(1/2): 1-2 (2001)

Daniel J. Dougherty, Pierre Lescanne: Reductions, Intersection Types, and Explicit Substitutions. TLCA 2001: 121-135

Frédéric Lang, Pierre Lescanne: On Strong Normalization of Explicit Substitution Calculi (Short Note). Journal of Functional and Logic Programming 2000(7) (2000)

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

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

Gregory Kucherov, Pierre Lescanne, Peter D. Mosses: Valentin M. Antimirov (1961-1995). Theor. Comput. Sci. 155(2): 289-290 (1996)

Pierre Lescanne: Calculi of Explicit Substitutions: New Results. APPIA-GULP-PRODE 1996: 309-328

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

Pierre Lescanne: Termination of Rewrite Systems by Elementary Interpretations. Formal Asp. Comput. 7(1): 77-90 (1995)

Pierre Lescanne: The Lambda Calculus as an Abstract Data Type. COMPASS/ADT 1995: 74-80

Boutheina Chetali, Pierre Lescanne: Formal Verfication of a Protocol for Communications over Faulty Channels. FORTE 1995: 91-108

Pierre Lescanne, Jocelyne Rouyer-Degli: Explicit Substitutions with de Bruijn's Levels. RTA 1995: 294-308

Pierre Lescanne: On Termination of One Rule Rewrite Systems. Theor. Comput. Sci. 132(2): 395-401 (1994)

Pierre Lescanne: From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. POPL 1994: 60-69

Pierre Lescanne, Wolfgang Wechler: Introduction - ALP 1988. J. Log. Program. 12(3&4): 189 (1992)

Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch: The Term Rewriting Approach to Automated Theorem Proving. J. Log. Program. 14(1&2): 71-99 (1992)

Pierre Lescanne: Well Rewrite Orderings and Well Quasi-Orderings. J. Symb. Comput. 14(5): 419-436 (1992)

Pierre Lescanne: Termination of Rewrite Systems by Elementary Interpretations. ALP 1992: 21-36

Adam Cichon, Pierre Lescanne: Polynomial Interpretations and the Complexity of Algorithms. CADE 1992: 139-147

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

Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella (Eds.): Algebraic System Specification and Development - A Survey and Annotated Bibliography. Lecture Notes in Computer Science 501, Springer 1991, isbn 3-540-54060-1

Pierre Lescanne: Rewrite Orderings and Termination of Rewrite Systems. MFCS 1991: 17-27

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

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

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

Pierre Lescanne: On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. J. Autom. Reasoning 6(1): 39-49 (1990)

Pierre Lescanne: Implementations of Completion by Transition Rules + Control: ORME. ALP 1990: 262-269

Pierre Lescanne: ORME: An Implementation of Completion Procedures as Sets of Transition Rules. CADE 1990: 661-662

Pierre Lescanne: Well Rewrite Orderings. LICS 1990: 249-256

Pierre Lescanne: Well quasi-ordering in a paper by Maurice Janet. Bulletin of the EATCS 39: 185-188 (1989)

Hubert Comon, Pierre Lescanne: Equational Problems and Disunification. J. Symb. Comput. 7(3/4): 371-425 (1989)

Pierre Lescanne: Completion Procedures as Transition Rules + Control. TAPSOFT, Vol.1 1989: 28-41

Jan Grabowski, Pierre Lescanne, Wolfgang Wechler (Eds.): Algebraic and Logic Programming, International Workshop, Gaussig, GDR, November 14-18, 1988, Proceedings. Lecture Notes in Computer Science 343, Springer 1988, isbn 3-540-50667-5

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

Pierre Lescanne: Current Trends in Rewriting Techniques and Related Problems. Trends in Computer Algebra 1987: 38-51

Claude Kirchner, Pierre Lescanne: Solving Disequations. LICS 1987: 347-352

Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne: Decidability of the Confluence of Ground Term Rewriting Systems. LICS 1987: 353-359

Pierre Lescanne: REVE: A Rewrite Rule Laboratory. STACS 1987: 482-483

Françoise Bellegarde, Pierre Lescanne: Transformation Ordering. TAPSOFT, Vol.1 1987: 69-80

Pierre Lescanne (Ed.): Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings. Lecture Notes in Computer Science 256, Springer 1987, isbn 3-540-17220-3

Pierre Lescanne: Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings. Bulletin of the EATCS 30: 80-83 (1986)

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

Isabelle Gnaedig, Pierre Lescanne: Proving Termination of Associative Commutative Rewriting Systems by Rewriting. CADE 1986: 52-61

Pierre Lescanne: REVE a Rewrite Rule Laboratory. CADE 1986: 695-696

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

Pierre Lescanne: Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status. CAAP 1984: 181-194

Pierre Lescanne: Term Rewriting Systems and Algebra. CADE 1984: 166-174

Pierre Lescanne: Behavioural Categoricity of Abstract Data Type Specifications. Comput. J. 26(4): 289-292 (1983)

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

Pierre Lescanne: Computer Experiments with the Reve Term Rewriting System Generator. POPL 1983: 99-108

Jean-Pierre Jouannaud, Pierre Lescanne: On Multiset Orderings. Inf. Process. Lett. 15(2): 57-63 (1982)

Pierre Lescanne: Modèles non Déterministes de Types Abstraits. ITA 16(3): 225-244 (1982)

Pierre Lescanne: Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems. ITA 16(4): 331-347 (1982)

Pierre Lescanne: Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. IJCAI 1981: 548-550

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

Jacques Guyard, Pierre Lescanne: Manipulation d'arbres syntaxiques et contruction de programmes. CLAAP 1980: 208-224

Pierre Lescanne: Équivalence Entre la Famille des Ensembles Réguliers et la Famille des Ensembles Algébriques. ITA 10(2): 57-81 (1976)