Asymptotic Properties of Combinatory Logic. - Maciej Bendkowski; Katarzyna Grygiel; Marek Zaionc (TAMC, 2015)

A Natural Counting of Lambda Terms. - Maciej Bendkowski; Katarzyna Grygiel; Pierre Lescanne; Marek Zaionc (SOFSEM, 2016)

Combinatorics of λ-terms: a natural approach. - Maciej Bendkowski; Katarzyna Grygiel; Pierre Lescanne; Marek Zaionc (CoRR, 2016)

On the likelihood of normalisation in combinatory logic. - Maciej Bendkowski; Katarzyna Grygiel; Marek Zaionc (CoRR, 2016)

Boltzmann Samplers for Closed Simply-Typed Lambda Terms. - Maciej Bendkowski; Katarzyna Grygiel; Paul Tarau (PADL, 2017)

Normal-order reduction grammars. - Maciej Bendkowski (J. Funct. Program., 2017)

Combinatorics of $$ lambda$$-terms: a natural approach. - Maciej Bendkowski; Katarzyna Grygiel; Pierre Lescanne; Marek Zaionc (J. Log. Comput., 2017)

On the likelihood of normalization in combinatory logic. - Maciej Bendkowski; Katarzyna Grygiel; Marek Zaionc (J. Log. Comput., 2017)

Polynomial tuning of multiparametric combinatorial samplers. - Maciej Bendkowski; Olivier Bodini; Sergey Dovgal (ANALCO, 2018)

Combinatorics of Explicit Substitutions. - Maciej Bendkowski; Pierre Lescanne (PPDP, 2018)

Counting Environments and Closures. - Maciej Bendkowski; Pierre Lescanne (FSCD, 2018)

Towards the average-case analysis of substitution resolution in λ-calculus. - Maciej Bendkowski (CoRR, 2018)

Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers. - Maciej Bendkowski; Katarzyna Grygiel; Paul Tarau (Theory Pract. Log. Program., 2018)

Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus. - Maciej Bendkowski (FSCD, 2019)

Statistical Properties of Lambda Terms. - Maciej Bendkowski; Olivier Bodini; Sergey Dovgal (Electron. J. Comb., 2019)

On the enumeration of closures and environments with an application to random generation. - Maciej Bendkowski; Pierre Lescanne (Log. Methods Comput. Sci., 2019)

How to generate random lambda terms? - Maciej Bendkowski (CoRR, 2020)

A note on the asymptotic expressiveness of ZF and ZFC. - Maciej Bendkowski (J. Log. Comput., 2021)

Automatic compile-time synthesis of entropy-optimal Boltzmann samplers. - Maciej Bendkowski (CoRR, 2022)

Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers. - Maciej Bendkowski; Olivier Bodini; Sergey Dovgal (Comb. Probab. Comput., 2022)