Pierre Lescanne

ORCID

Publication Activity (10 Years)

Years Active: 1976-2022
Publications (10 Years): 18

Top Venues

Publications

Pierre Lescanne
Almost all Classical Theorems are Intuitionistic. RAIRO Theor. Informatics Appl. 56 (2022)
Pierre Lescanne
Linear random generation of Motzkin trees. CoRR (2022)
Silvia Ghilezan, Jelena Ivetic, Simona Kasterovic, Pierre Lescanne
L-types for resource awareness: an implicit name approach. CoRR (2021)
Pierre Lescanne
Zaionc paradox revisited. CoRR (2021)
Pierre Lescanne
Extensive Infinite Games and Escalation, an exercise in Agda. CoRR (2020)
Maciej Bendkowski, Pierre Lescanne
On the enumeration of closures and environments with an application to random generation. Log. Methods Comput. Sci. 15 (4) (2019)
Maciej Bendkowski, Pierre Lescanne
Counting Environments and Closures. FSCD (2018)
Maciej Bendkowski, Pierre Lescanne
Counting Environments and Closures. CoRR (2018)
Pierre Lescanne
Dependent Types for Extensive Games. J. Formaliz. Reason. 11 (1) (2018)
Maciej Bendkowski, Pierre Lescanne
Combinatorics of explicit substitutions. CoRR (2018)
Pierre Lescanne
Quantitative Aspects of Linear and Affine Closed Lambda Terms. ACM Trans. Comput. Log. 19 (2) (2018)
Maciej Bendkowski, Pierre Lescanne
Combinatorics of Explicit Substitutions. PPDP (2018)
Dragisa Zunic, Pierre Lescanne
A Congruence Relation for Restructuring Classical Terms. ICTCS/CILC (2017)
Pierre Lescanne
Quantitative aspects of linear and affine closed lambda terms. CoRR (2017)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
Combinatorics of $$\lambda$$-terms: a natural approach. J. Log. Comput. 27 (8) (2017)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
Combinatorics of λ-terms: a natural approach. CoRR (2016)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
A Natural Counting of Lambda Terms. SOFSEM (2016)
Pierre Lescanne
Dependent Types for Extensive Games. CoRR (2016)
Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel
Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042). Dagstuhl Reports 5 (1) (2015)
Pierre Lescanne
The risk of divergence. CoRR (2015)
Pierre Lescanne
Intelligent escalation and the principle of relativity. CoRR (2015)
Katarzyna Grygiel, Pierre Lescanne
Counting and generating terms in the binary lambda calculus. J. Funct. Program. 25 (2015)
Katarzyna Grygiel, Pierre Lescanne
Counting and Generating Terms in the Binary Lambda Calculus (Extended version). CoRR (2015)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
A natural counting of Lambda terms. CoRR (2015)
Katarzyna Grygiel, Pierre Lescanne
Counting Terms in the Binary Lambda Calculus. CoRR (2014)
Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
Resource control and intersection types: an intrinsic connection. CoRR (2014)
Pierre Lescanne
Boltzmann samplers for random generation of lambda terms. CoRR (2014)
Pierre Lescanne
An exercise on streams: convergence acceleration. CoRR (2013)
Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
A journey through resource control lambda calculi and explicit substitution using intersection types (an account). CoRR (2013)
Pierre Lescanne
On counting untyped lambda terms. Theor. Comput. Sci. 474 (2013)
Pierre Lescanne
Les krachs sont rationnels. Tech. Sci. Informatiques 32 (9-10) (2013)
Pierre Lescanne
A simple case of rationality of escalation. CoRR (2013)
Katarzyna Grygiel, Pierre Lescanne
Counting and generating lambda terms. J. Funct. Program. 23 (5) (2013)
Pierre Lescanne
Bubbles are rational CoRR (2013)
Pierre Lescanne
Common Knowledge Logic in a Higher Order Proof Assistant. Programming Logics (2013)
Pierre Lescanne
A Simple Case of Rationality of Escalation. CALCO (2013)
Pierre Lescanne, Matthieu Perrinel
"Backward" coinduction, Nash equilibrium and the rationality of escalation. Acta Informatica 49 (3) (2012)
Katarzyna Grygiel, Pierre Lescanne
Counting and generating lambda terms CoRR (2012)
Silvia Ghilezan, Pierre Lescanne, Dragisa Zunic
Computational interpretation of classical logic with explicit structural rules CoRR (2012)
Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
Intersection Types for the Resource Control Lambda Calculi. ICTAC (2011)
Pierre Lescanne
On counting untyped lambda terms CoRR (2011)
Pierre Lescanne
Les crashs sont rationnels CoRR (2011)
Pierre Lescanne
Rationality and Escalation in Infinite Extensive Games CoRR (2011)
Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
Resource control and strong normalisation CoRR (2011)
Pierre Lescanne, Matthieu Perrinel
On the Rationality of Escalation CoRR (2010)
Pierre Lescanne
Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games CoRR (2009)
Pierre Lescanne
Deconstruction of Infinite Extensive Games using coinduction CoRR (2009)
Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Dragisa Zunic
Intuitionistic Sequent-Style Calculus with Explicit Structural Rules. TbiLLC (2009)
Pierre Lescanne
(Mechanical) Reasoning on Infinite Extensive Games CoRR (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) (2008)
Stéphane Le Roux, Pierre Lescanne, René Vestergaard
Conversion/Preference Games CoRR (2008)
Steffen van Bakel, Pierre Lescanne
Computation with classical sequents. Math. Struct. Comput. Sci. 18 (3) (2008)
Pierre Lescanne, Jérôme Puisségur
Dynamic Logic of Common Knowledge in a Proof Assistant CoRR (2007)
Pierre Lescanne
Common knowledge logic in a higher order proof assistant? CoRR (2007)
Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori
Addressed term rewriting systems: application to a typed object calculus. Math. Struct. Comput. Sci. 16 (4) (2006)
Pierre Lescanne
Mechanizing common knowledge logic using COQ. Ann. Math. Artif. Intell. 48 (1-2) (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)
Pierre Lescanne
Review of "Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004. SIGACT News 37 (1) (2006)
Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori, Frédéric Lang
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. Electron. Notes Theor. Comput. Sci. 127 (5) (2005)
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
Intersection and Union Types in the lambda-my-my/tilde-calculus. Electron. Notes Theor. Comput. Sci. 136 (2005)
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
Strong Normalization of the Dual Classical Sequent Calculus. LPAR (2005)
Pierre Lescanne, René David, Marek Zaionc
Preface. Electron. Notes Theor. Comput. Sci. 140 (2005)
Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne
The Language chi: Circuits, Computations and Classical Logic. ICTCS (2005)
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne
Characterizing strong normalization in a language with control operators. PPDP (2004)
Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel
Intersection types for explicit substitutions. Inf. Comput. 189 (1) (2004)
Daniel J. Dougherty, Pierre Lescanne
Reductions, Intersection Types, and Explicit Substitutions. Math. Struct. Comput. Sci. 13 (1) (2003)
Silvia Ghilezan, Pierre Lescanne
Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract. TYPES (2003)
Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne
An Improved System of Intersection Types for Explicit Substitutions. IFIP TCS (2002)
Jürgen Giesl, Pierre Lescanne
Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. 12 (1/2) (2001)
Daniel J. Dougherty, Pierre Lescanne
Reductions, Intersection Types, and Explicit Substitutions. TLCA (2001)
Frédéric Lang, Pierre Lescanne
On Strong Normalization of Explicit Substitution Calculi (Short Note). J. Funct. Log. Program. 2000 (7) (2000)
Frédéric Lang, Pierre Lescanne, Luigi Liquori
A Framework for Defining Object-Calculi. World Congress on Formal Methods (1999)
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) (1996)
Gregory Kucherov, Pierre Lescanne, Peter D. Mosses
Valentin M. Antimirov (1961-1995). Theor. Comput. Sci. 155 (2) (1996)
Pierre Lescanne
Calculi of Explicit Substitutions: New Results. APPIA-GULP-PRODE (1996)
Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer Høgsbro Rose
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. PLILP (1996)
Boutheina Chetali, Pierre Lescanne
Formal Verfication of a Protocol for Communications over Faulty Channels. FORTE (1995)
Pierre Lescanne, Jocelyne Rouyer-Degli
Explicit Substitutions with de Bruijn's Levels. RTA (1995)
Pierre Lescanne
The Lambda Calculus as an Abstract Data Type. COMPASS/ADT (1995)
Pierre Lescanne
Termination of Rewrite Systems by Elementary Interpretations. Formal Aspects Comput. 7 (1) (1995)
Pierre Lescanne
On Termination of One Rule Rewrite Systems. Theor. Comput. Sci. 132 (2) (1994)
Pierre Lescanne
From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. POPL (1994)
Pierre Lescanne, Wolfgang Wechler
Introduction - ALP 1988. J. Log. Program. 12 (3&4) (1992)
Pierre Lescanne
Termination of Rewrite Systems by Elementary Interpretations. ALP (1992)
Boutheina Chetali, Pierre Lescanne
An Exercise in LP: The Proof of a Non Restoring Division Circuit. Larch (1992)
Pierre Lescanne
Well Rewrite Orderings and Well Quasi-Orderings. J. Symb. Comput. 14 (5) (1992)
Adam Cichon, Pierre Lescanne
Polynomial Interpretations and the Complexity of Algorithms. CADE (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) (1992)
Hélène Kirchner, Pierre Lescanne
Rewriting techniques and applications, RTA'91. SIGACT News 22 (3) (1991)
Pierre Lescanne
Rewrite Orderings and Termination of Rewrite Systems. MFCS (1991)
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) (1990)
Pierre Lescanne
Implementations of Completion by Transition Rules + Control: ORME. ALP (1990)
Pierre Lescanne
Well Rewrite Orderings LICS (1990)
Pierre Lescanne
On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. J. Autom. Reason. 6 (1) (1990)
Françoise Bellegarde, Pierre Lescanne
Termination by Completion. Appl. Algebra Eng. Commun. Comput. 1 (1990)
Azeddine Lazrek, Pierre Lescanne, Jean-Jacques Thiel
Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness Inf. Comput. 84 (1) (1990)
Pierre Lescanne
ORME: An Implementation of Completion Procedures as Sets of Transition Rules. CADE (1990)
Pierre Lescanne
Completion Procedures as Transition Rules + Control. TAPSOFT, Vol.1 (1989)
Pierre Lescanne
Well quasi-ordering in a paper by Maurice Janet. Bull. EATCS 39 (1989)
Hubert Comon, Pierre Lescanne
Equational Problems and Disunification. J. Symb. Comput. 7 (3/4) (1989)

Pierre Lescanne.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierre Lescanne