Combinatorics of $\lambda$-terms: a natural approach

DOI10.1093/logcom/exx018zbMath1444.03017arXiv1609.07593OpenAlexW2963578516MaRDI QIDQ4555458

Pierre Lescanne, Marek Zaionc, Maciej Bendkowski, Katarzyna Grygiel

Publication date: 20 November 2018

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.07593

zbMATH Keywords

combinatoricsasymptotic densityfunctional programminglambda-calculus

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatory logic and lambda calculus (03B40)

Related Items (6)

Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ On the enumeration of closures and environments with an application to random generation ⋮ Unnamed Item ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata ⋮ Statistical properties of lambda terms

This page was built for publication: Combinatorics of $\lambda$-terms: a natural approach