The following pages link to Maciej Bendkowski (Q2327213):
Displaying 14 items.
- Statistical properties of lambda terms (Q2327214) (← links)
- A Natural Counting of Lambda Terms (Q2794357) (← links)
- Asymptotic Properties of Combinatory Logic (Q2948454) (← links)
- On the likelihood of normalization in combinatory logic (Q3133193) (← links)
- Combinatorics of $\lambda$-terms: a natural approach (Q4555458) (← links)
- Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers (Q4603430) (← links)
- On the enumeration of closures and environments with an application to random generation (Q4972734) (← links)
- (Q4993337) (← links)
- (Q5089006) (← links)
- A note on the asymptotic expressiveness of ZF and ZFC (Q5163981) (← links)
- Polynomial tuning of multiparametric combinatorial samplers (Q5195109) (← links)
- Normal-order reduction grammars (Q5372004) (← links)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
- Towards the average-case analysis of substitution resolution in $\lambda$-calculus (Q6311025) (← links)
