Statistical properties of lambda terms (Q2327214): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: QuickCheck / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial tuning of multiparametric combinatorial samplers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic points of recursive systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random maps, coalescing saddles, singularity analysis, and Airy phenomena / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic number of <i>BCK</i>(2)-terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda terms of bounded unary height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating lambda terms by weighted length of their de Bruijn representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of generalized BCI lambda-terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics and random sampling for BCI and BCK lambda terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Natural Counting of Lambda Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of $\lambda$-terms: a natural approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pointed versus singular Boltzmann samplers: a comparative analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniquely closable and uniquely typable skeletons of lambda terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2920877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for the random generation of labelled combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of lambda terms with prescribed size of their De Bruijn representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and generating lambda terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and generating terms in the binary lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hwang's Quasi-Power-Theorem in Dimension Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Higher Dimensional Quasi-Power Theorem and a Berry-Esseen Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates in the central limit theorems for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une théorie combinatoire des séries formelles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite range random walk on free groups and homogeneous trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting untyped lambda terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for combinatorial structures: well-founded systems and Newton iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5448306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring rules for finite trees, and probabilities of monadic second order sentences / rank
 
Normal rank

Latest revision as of 15:35, 20 July 2024

scientific article
Language Label Description Also known as
English
Statistical properties of lambda terms
scientific article

    Statements

    Statistical properties of lambda terms (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2019
    0 references
    Summary: 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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references