Pierre Lescanne

Laboratoire de l'Informatique du Parallélisme — France

Computer Science · Physical Sciences

23h-index2.0kcitations170works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Logic, programming, and type systems(96), Logic, Reasoning, and Knowledge(71), semigroups and automata theory(42), Formal Methods in Verification(33), Advanced Algebra and Logic(25)

Publications170 total

Holonomic equations and efficient random generation of binary trees
Discrete Mathematics & Theoretical Computer Science·2024Open Access
Holonomic equations and efficient random generation of binary trees
arXiv (Cornell University)·2022Open Access
Almost all Classical Theorems are Intuitionistic
RAIRO. Theoretical informatics and applications·2022Open Access
List types for resource aware languages: an implicit name approach
arXiv (Cornell University)·2021Open Access
L'informatique de Claude Pair
Bulletin 1024·2021Open Access
Zaionc paradox revisited
HAL (Le Centre pour la Communication Scientifique Directe)·2021Open Access
Almost all classical theorems are intuitionistic
arXiv (Cornell University)·2021Open Access
Almost all classical theorems are intuitionistic
arXiv (Cornell University)·2021Open Access
Claude Pair's Computer Science
HAL (Le Centre pour la Communication Scientifique Directe)·2021Open Access
Extensive Infinite Games and Escalation, an exercice in Agda
HAL (Le Centre pour la Communication Scientifique Directe)·2020Open Access
Extensive Infinite Games and Escalation, an exercise in Agda
arXiv (Cornell University)·2020Open Access
On the enumeration of closures and environments with an application to random generation
Logical Methods in Computer Science·2019Open Access
On the enumeration of closures and environments with an application to random generation
Homo Politicus (Academy of Humanities and Economics in Lodz)·2019Open Access
Combinatorics of Explicit Substitutions
2018· 2 citedOpen Access
Quantitative Aspects of Linear and Affine Closed Lambda Terms
ACM Transactions on Computational Logic·2018· 4 citedOpen Access
Counting Environments and Closures
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018Open Access
Combinatorics of $\lambda$-terms: a natural approach
Journal of Logic and Computation·2017Open Access
Quantitative aspects of linear and affine closed lambda terms
arXiv (Cornell University)·2017Open Access
A Congruence Relation for Restructuring Classical Terms.
2017
Dependent Types for Extensive Games
arXiv (Cornell University)·2016Open Access
page 1 of 9Next →

Frequent Co-authors

Silvia Ghilezan(5), Claude Kirchner(4), Dan Dougherty(4), Steffen van Bakel(3), Daniel J. Dougherty(3), Ahlem Ben Cherifa(2), Zine-el-Abidine Benaissa(2), Jocelyne Rouyer-Degli(2), Max Dauchet(2), Thierry Heuillard(2), Sophie Tison(2), Jean-Pierre Jouannaud(2), Françoise Bellegarde(2), Stéphane Lengrand(2), Silvia Likavec(2), Luigi Liquori(2), Frédéric Lang(2), Adalbert Kerber(2), Hubert Comon(1), Daniel Briaud(1)