| Polynomial tuning of multiparametric combinatorial samplers M Bendkowski, O Bodini, S Dovgal 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and …, 2018 | 29 | 2018 |
| A natural counting of lambda terms M Bendkowski, K Grygiel, P Lescanne, M Zaionc SOFSEM 2016: Theory and Practice of Computer Science: 42nd International …, 2016 | 25 | 2016 |
| Combinatorics of $lambda$-terms: a natural approach M Bendkowski, K Grygiel, P Lescanne, M Zaionc Journal of Logic and Computation 27 (8), 2611-2630, 2017 | 19 | 2017 |
| Boltzmann samplers for closed simply-typed lambda terms M Bendkowski, K Grygiel, P Tarau Practical Aspects of Declarative Languages: 19th International Symposium …, 2017 | 18 | 2017 |
| On the likelihood of normalization in combinatory logic M Bendkowski, K Grygiel, M Zaionc Journal of Logic and Computation 27 (7), 2251-2269, 2017 | 10 | 2017 |
| Statistical properties of lambda terms M Bendkowski, O Bodini, S Dovgal arXiv preprint arXiv:1805.09419, 2018 | 9 | 2018 |
| Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers M Bendkowski, K Grygiel, P Tarau Theory and Practice of Logic Programming 18 (1), 97-119, 2018 | 9 | 2018 |
| Normal-order reduction grammars M Bendkowski Journal of Functional Programming 27, 2017 | 7 | 2017 |
| Asymptotic properties of combinatory logic M Bendkowski, K Grygiel, M Zaionc Theory and Applications of Models of Computation: 12th Annual Conference …, 2015 | 7 | 2015 |
| Quantitative aspects and generation of random lambda and combinatory logic terms M Bendkowski PhD thesis, Jagiellonian University, Kraków, Poland, 2017 | 4 | 2017 |
| Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers M Bendkowski, O Bodini, S Dovgal Combinatorics, Probability and Computing 31 (5), 765-811, 2022 | 3 | 2022 |
| Combinatorics of explicit substitutions M Bendkowski, P Lescanne Proceedings of the 20th International Symposium on Principles and Practice …, 2018 | 2 | 2018 |
| On the enumeration of closures and environments with an application to random generation P Lescanne, M Bendkowski Logical Methods in Computer Science 15, 2019 | 1* | 2019 |
| Towards the average-case analysis of substitution resolution in -calculus M Bendkowski arXiv preprint arXiv:1812.04452, 2018 | 1 | 2018 |
| Counting environments and closures M Bendkowski, P Lescanne Saarbrücken, Wadern: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2018 | 1 | 2018 |
| Automatic compile-time synthesis of entropy-optimal Boltzmann samplers M Bendkowski arXiv preprint arXiv:2206.06668, 2022 | | 2022 |
| A note on the asymptotic expressiveness of ZF and ZFC M Bendkowski Journal of Logic and Computation 31 (7), 1598-1607, 2021 | | 2021 |
| How to generate random lambda terms? M Bendkowski arXiv preprint arXiv:2005.08856, 2020 | | 2020 |
| Counting Environments and Closures P Lescanne, M Bendkowski 3rd International Conference on Formal Structures for Computation and …, 2018 | | 2018 |
| On the enumeration of closures and environments with an application to random generation M Bendkowski, P Lescanne arXiv preprint arXiv:1802.00640, 2018 | | 2018 |
Pierre LescanneProfesseur émérite à l'ENS de LyonVerified email at ens-lyon.fr
