Maciej Bendkowski
Title
Cited by
Cited by
Year
A natural counting of lambda terms
M Bendkowski, K Grygiel, P Lescanne, M Zaionc
International Conference on Current Trends in Theory and Practice of …, 2016
242016
Polynomial tuning of multiparametric combinatorial samplers
M Bendkowski, O Bodini, S Dovgal
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and …, 2018
172018
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
162017
Boltzmann Samplers for Closed Simply-Typed Lambda Terms
M Bendkowski, K Grygiel, P Tarau
International Symposium on Practical Aspects of Declarative Languages, 120-135, 2017
142017
On the likelihood of normalization in combinatory logic
M Bendkowski, K Grygiel, M Zaionc
Journal of Logic and Computation 27 (7), 2251-2269, 2017
102017
Normal-order reduction grammars
M Bendkowski
Journal of Functional Programming 27, 2017
72017
Statistical Properties of Lambda Terms
M Bendkowski, O Bodini, S Dovgal
Electronic Journal of Combinatorics 26 (4), 70, 2019
52019
Statistical properties of lambda terms
M Bendkowski, O Bodini, S Dovgal
arXiv preprint arXiv:1805.09419, 2018
52018
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
52018
Asymptotic properties of combinatory logic
M Bendkowski, K Grygiel, M Zaionc
International Conference on Theory and Applications of Models of Computation …, 2015
42015
Combinatorics of explicit substitutions
M Bendkowski, P Lescanne
Proceedings of the 20th International Symposium on Principles and Practice …, 2018
32018
Quantitative aspects and generation of random lambda and combinatory logic terms
M Bendkowski
PhD thesis. Kraków, Poland: Jagiellonian University, 2017
32017
Counting environments and closures
M Bendkowski, P Lescanne
Saarbrücken, Wadern: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2018
12018
How to generate random lambda terms?
M Bendkowski
arXiv preprint arXiv:2005.08856, 2020
2020
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
M Bendkowski, O Bodini, S Dovgal
arXiv preprint arXiv:2002.12771, 2020
2020
On the enumeration of closures and environments with an application to random generation
P Lescanne, M Bendkowski
Logical Methods in Computer Science 15, 2019
2019
Towards the average-case analysis of substitution resolution in -calculus
M Bendkowski
arXiv preprint arXiv:1812.04452, 2018
2018
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
RANDOM GENERATION OF CLOSED SIMPLY-TYPED λ-TERMS
M BENDKOWSKI, K GRYGIEL, P TARAU
arXiv preprint arXiv:1612.07682, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20