Maciej Bendkowski

Publication Activity (10 Years)

Years Active: 2015-2022
Publications (10 Years): 26

Top Topics

Logic Programming

Asymptotic Properties

Explicitly Represented

Top Venues

J. Log. Comput.

Comb. Probab. Comput.

Publications

Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers. Comb. Probab. Comput. 31 (5) (2022)
Maciej Bendkowski
Automatic compile-time synthesis of entropy-optimal Boltzmann samplers. CoRR (2022)
Maciej Bendkowski
A note on the asymptotic expressiveness of ZF and ZFC. J. Log. Comput. 31 (7) (2021)
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers. CoRR (2020)
Maciej Bendkowski
How to generate random lambda terms? CoRR (2020)
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Statistical Properties of Lambda Terms. Electron. J. Comb. 26 (4) (2019)
Maciej Bendkowski
Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus. FSCD (2019)
Maciej Bendkowski, Pierre Lescanne
On the enumeration of closures and environments with an application to random generation. Log. Methods Comput. Sci. 15 (4) (2019)
Maciej Bendkowski, Pierre Lescanne
Counting Environments and Closures. FSCD (2018)
Maciej Bendkowski, Pierre Lescanne
Counting Environments and Closures. CoRR (2018)
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Polynomial tuning of multiparametric combinatorial samplers. ANALCO (2018)
Maciej Bendkowski, Pierre Lescanne
Combinatorics of explicit substitutions. CoRR (2018)
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers. Theory Pract. Log. Program. 18 (1) (2018)
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Statistical properties of lambda terms. CoRR (2018)
Maciej Bendkowski, Pierre Lescanne
Combinatorics of Explicit Substitutions. PPDP (2018)
Maciej Bendkowski
Towards the average-case analysis of substitution resolution in λ-calculus. CoRR (2018)
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Polynomial tuning of multiparametric combinatorial samplers. CoRR (2017)
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
Boltzmann Samplers for Closed Simply-Typed Lambda Terms. PADL (2017)
Maciej Bendkowski
Normal-order reduction grammars. J. Funct. Program. 27 (2017)
Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
On the likelihood of normalization in combinatory logic. J. Log. Comput. 27 (7) (2017)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
Combinatorics of $$\lambda$$-terms: a natural approach. J. Log. Comput. 27 (8) (2017)
Maciej Bendkowski
Normal-order reduction grammars. CoRR (2016)
Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
On the likelihood of normalisation in combinatory logic. CoRR (2016)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
Combinatorics of λ-terms: a natural approach. CoRR (2016)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
A Natural Counting of Lambda Terms. SOFSEM (2016)
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
Random generation of closed simply-typed $λ$-terms: a synergy between logic programming and Boltzmann samplers. CoRR (2016)
Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc
Asymptotic Properties of Combinatory Logic. TAMC (2015)
Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc
A natural counting of Lambda terms. CoRR (2015)