6 citations · 8 across the 8 of their papers we have counts for
14 papers
Automatic compile-time synthesis of entropy-optimal Boltzmann samplers
Maciej Bendkowski
We present a famework for the automatic compilation of multi-parametric Boltzmann samplers for algebraic data types in Haskell. Our framework uses Template Haskell to synthesise ef…
A note on the asymptotic expressiveness of ZF and ZFC
Maciej Bendkowski
We investigate the asymptotic densities of theorems provable in Zermelo-Fraenkel set theory ZF and its extension ZFC including the axiom of choice. Assuming a canonical De Bruijn r…
How to generate random lambda terms?
Maciej Bendkowski
We survey several methods of generating large random lambda-terms, focusing on their closed and simply-typed variants. We discuss methods of exact- and approximate-size generation,…
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Combinatorial samplers are algorithmic schemes devised for the approximate- and exact-size generation of large random combinatorial structures, such as context-free words, various…
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…
Statistical properties of lambda terms
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
We present a quantitative, statistical analysis of random lambda terms in the de Bruijn notation. Following an analytic approach using multivariate generating functions, we investi…