scholarly journals Statistical Properties of Lambda Terms

10.37236/8491 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
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 investigate the distribution of various combinatorial parameters of random open and closed lambda terms, including the number of redexes, head abstractions, free variables or the De Bruijn index value profile. Moreover, we conduct an average-case complexity analysis of finding the leftmost-outermost redex in random lambda terms showing that it is on average constant. The main technical ingredient of our analysis is a novel method of dealing with combinatorial parameters inside certain infinite, algebraic systems of multivariate generating functions. Finally, we briefly discuss the random generation of lambda terms following a given skewed parameter distribution and provide empirical results regarding a series of more involved combinatorial parameters such as the number of open subterms and binding abstractions in closed lambda terms.

2008 ◽  
Vol 18 (02) ◽  
pp. 375-405 ◽  
Author(s):  
FRÉDÉRIQUE BASSINO ◽  
CYRIL NICAUD ◽  
PASCAL WEIL

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be obtained by the method of Stallings foldings. Our algorithm randomly generates a subgroup of a given size n, according to the uniform distribution over size n subgroups. In the process, we give estimates of the number of size n subgroups, of the average rank of size n subgroups, and of the proportion of such subgroups that have finite index. Our algorithm has average case complexity [Formula: see text] in the RAM model and [Formula: see text] in the bitcost model.


2018 ◽  
Vol 28 (4) ◽  
pp. 201-221
Author(s):  
Aleksandr V. Chashkin

Abstract The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of functions with maximum average-case complexity among all underdetermined functions are derived depending on the degree of their determinacy, the size of their domain, and the size of their support.


1997 ◽  
Vol 26 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Laurent Alonso ◽  
Edward M. Reingold ◽  
René Schott

Sign in / Sign up

Export Citation Format

Share Document