In this article we develop a vectorial kernel method—a powerful method which solves in a
unified framework all the problems related to the enumeration of words generated by a …

Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the
approximate-size and exact-size random generation of large combinatorial structures, such …

We present a quantitative, statistical analysis of random lambda terms in the de Bruijn
notation. Following an analytic approach using multivariate generating functions, we …

Combinatorial samplers are algorithmic schemes devised for the approximate-and exact-
size generation of large random combinatorial structures, such as context-free words …

Structural properties of large random maps and lambda-terms may be gleaned by studying
the limit distributions of various parameters of interest. In our work we focus on restricted …

Affine λ-terms are λ-terms in which each bound variable occurs at most once, and linear λ-
terms are λ-terms in which each bound variable occurs once and only once. In this article …

We present a quantitative analysis of λ-calculus in the de Bruijn notation and combinatory
logic under various combinator bases. Both classes of computational models are shown to …

Les propriétés structurelles des grandes cartes aléatoires et des lambda-termes peuvent
être obtenues en étudiant les distributions limites de divers paramètres d'intérêt. Dans cette …

We investigate the number of variables in two special subclasses of lambda-terms that are
restricted by a bound of the number of abstractions between a variable and its binding …

λν is an extension of the λ-calculus which internalises the calculus of substitutions. In the
current paper, we investigate the combinatorial properties of λν focusing on the quantitative …