6 citations · 6 across the 3 of their papers we have counts for
3 papers
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…
cs.LO2016★ 6 cited
Combinatorics of -terms: a natural approach
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne +1
We consider combinatorial aspects of -terms in the model based on de Bruijn indices where each building constructor is of size one. Surprisingly, the counting sequence for -t…
cs.LO2016
On the likelihood of normalisation in combinatory logic
Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of…