On the number of lambda terms with prescribed size of their De Bruijn representation

DOI10.4230/LIPIcs.STACS.2016.40zbMath1434.03051arXiv1509.06139OpenAlexW2963632202MaRDI QIDQ4601892

Bernhard Gittenberger, Zbigniew Gołȩbiewski

Publication date: 24 January 2018

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

zbMATH Keywords

lambda-calculusanalytic combinatoricsterms enumeration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatory logic and lambda calculus (03B40)

Related Items (7)

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 ⋮ Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Normal-order reduction grammars ⋮ On the number of unary-binary tree-like structures with restrictions on the unary height ⋮ Statistical properties of lambda terms

This page was built for publication: On the number of lambda terms with prescribed size of their De Bruijn representation