1 citations · 1 across the 2 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.LO2018
Towards the average-case analysis of substitution resolution in -calculus
Maciej Bendkowski
Substitution resolution supports the computational character of -reduction, complementing its execution with a capture-avoiding exchange of terms for bound variables. Alas, the…
math.CO2018
Statistical properties of lambda terms
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
We present a quantitative, statistical analysis of random lambda terms in the de Bruijn notation. Following an analytic approach using multivariate generating functions, we investi…
cs.LO2018
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…