13 citations · 54 across the 30 of their papers we have counts for
33 papers
Holonomic equations and efficient random generation of binary trees
Pierre Lescanne
Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. R{é}my showed that the holonomic equation associated with binary tree…
List types for resource aware languages: an implicit name approach
Silvia Ghilezan, Jelena Ivetić, Pierre Lescanne +1
A novel formalisation of variable control in languages with implicit names based on de Bruijn indices is presented. We design and implement three languages: first, a restricted lan…
Almost all classical theorems are intuitionistic
Pierre Lescanne
Canonical expressions are representative of implicative propositions upto renaming of variables. In this paper we explore, using a Monte-Carlo approach, the model of canonical expr…
Extensive Infinite Games and Escalation, an exercise in Agda
Pierre Lescanne
Escalation in games is when agents keep playing forever. Based on formal proofs we claim that if agents assume that resource are infinite, escalation is rational.
Combinatorics of explicit substitutions
Maciej Bendkowski, Pierre Lescanne
is an extension of the -calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of f…
On the enumeration of closures and environments with an application to random generation
Maciej Bendkowski, Pierre Lescanne
Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environme…