A Natural Counting of Lambda Terms

DOI10.1007/978-3-662-49192-8_15zbMath1428.68095arXiv1506.02367OpenAlexW2963432045MaRDI QIDQ2794357

Marek Zaionc, Maciej Bendkowski, Pierre Lescanne, Katarzyna Grygiel

Publication date: 10 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic densityfunctional programminglambda calculusblack-white treeszigzag-free trees

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (9)

On the enumeration of closures and environments with an application to random generation ⋮ Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers ⋮ Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Normal-order reduction grammars ⋮ Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence ⋮ On the number of unary-binary tree-like structures with restrictions on the unary height ⋮ Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms ⋮ Statistical properties of lambda terms ⋮ Unnamed Item

This page was built for publication: A Natural Counting of Lambda Terms