On counting untyped lambda terms

DOI10.1016/j.tcs.2012.11.019zbMath1259.68028arXiv1107.1327OpenAlexW2056068307MaRDI QIDQ1944777

Pierre Lescanne

Publication date: 27 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

combinatoricsrandomizationfunctional programminglambda calculusCatalan numbers

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ Unnamed Item ⋮ On some enumerative problems in lambda calculus ⋮ Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Counting and generating terms in the binary lambda calculus ⋮ 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 counting untyped lambda terms