Counting terms in the binary lambda calculus

MaRDI QIDQ2789550zbMATH OpenFDO

Authors Pierre Lescanne, Katarzyna Grygiel

Publication date 1 March 2016

Full work available at URL https://arxiv.org/abs/1401.0379, https://hal.inria.fr/hal-01077251v2/document

zbMATH Keywords

combinatoricsfunctional programminglambda calculusrandom generatorrankingtestunranking

Mathematics Subject Classification ID

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

Recommendations

• Counting and generating terms in the binary lambda calculus
• On the number of lambda terms with prescribed size of their de Bruijn representation
• Enumerating lambda terms by weighted length of their de Bruijn representation
• A natural counting of lambda terms
• Binary lambda calculus and combinatory logic

Cited in

(10)

• Enumerating lambda terms by weighted length of their de Bruijn representation
• On the number of unary-binary tree-like structures with restrictions on the unary height
• An adequate and efficient left-associated binary numeral system in the -calculus
• Asymptotic properties of combinatory logic
• Compact bit encoding schemes for simply-typed lambda-terms
• On the number of lambda terms with prescribed size of their de Bruijn representation
• scientific article; zbMATH DE number 845591 (Why is no real title available?)
• How many numbers can a lambda-term contain?
• Counting and generating terms in the binary lambda calculus
• Binary lambda calculus and combinatory logic

This page was built for publication: Counting terms in the binary lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789550)