Counting and generating lambda terms
From MaRDI portal
Publication:5398332
DOI10.1017/S0956796813000178zbMath1311.68045arXiv1210.2610OpenAlexW2963504583MaRDI QIDQ5398332
Pierre Lescanne, Katarzyna Grygiel
Publication date: 27 February 2014
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.2610
Related Items (13)
Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices ⋮ Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers ⋮ On some enumerative problems in lambda calculus ⋮ Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Generating constrained random data with uniform distribution ⋮ Counting and generating terms in the binary lambda calculus ⋮ Normal-order reduction grammars ⋮ Unnamed Item ⋮ 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: Counting and generating lambda terms
