Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Bendkowski, Maciej"'
Autor:
Bendkowski, Maciej
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 efficient, entropy-optimal samplers generating random instances of user-
Externí odkaz:
http://arxiv.org/abs/2206.06668
Autor:
Bendkowski, Maciej
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 representation of formulae, we construct asymptotically large sets of s
Externí odkaz:
http://arxiv.org/abs/2010.10155
Autor:
Bendkowski, Maciej
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, as well as methods of achieving size-uniform and non-uniform outcome
Externí odkaz:
http://arxiv.org/abs/2005.08856
Combinatorial samplers are algorithmic schemes devised for the approximate- and exact-size generation of large random combinatorial structures, such as context-free words, various tree-like data structures, maps, tilings, RNA molecules. They can be a
Externí odkaz:
http://arxiv.org/abs/2002.12771
Autor:
Bendkowski, Maciej
Substitution resolution supports the computational character of $\beta$-reduction, complementing its execution with a capture-avoiding exchange of terms for bound variables. Alas, the meta-level definition of substitution, masking a non-trivial compu
Externí odkaz:
http://arxiv.org/abs/1812.04452
We present a quantitative, statistical analysis of random lambda terms in the de Bruijn notation. Following an analytic approach using multivariate generating functions, we investigate the distribution of various combinatorial parameters of random op
Externí odkaz:
http://arxiv.org/abs/1805.09419
Autor:
Bendkowski, Maciej, Lescanne, Pierre
$\lambda\upsilon$ is an extension of the $\lambda$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $\lambda\upsilon$ focusing on the quantitative aspects of substitution
Externí odkaz:
http://arxiv.org/abs/1804.03862
Autor:
Bendkowski, Maciej, Lescanne, Pierre
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 4 (October 17, 2019) lmcs:4998
Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables. In this paper
Externí odkaz:
http://arxiv.org/abs/1802.00640
Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the approximate-size and exact-size random generation of large combinatorial structures, such as maps, tilings, RNA sequences or various tree-like structures. In the
Externí odkaz:
http://arxiv.org/abs/1708.01212
A natural approach to software quality assurance consists in writing unit tests securing programmer-declared code invariants. Throughout the literature a great body of work has been devoted to tools and techniques automating this labour-intensive pro
Externí odkaz:
http://arxiv.org/abs/1612.07682