Lambda terms of bounded unary height

DOI10.1137/1.9781611973013.3zbMath1429.68155OpenAlexW2296468158MaRDI QIDQ5194688

Daniéle Gardy, Bernhard Gittenberger, Olivier Bodini

Publication date: 16 September 2019

Published in: 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6805d72819513d09788f878b0c709eb1c2dce706

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Asymptotic enumeration (05A16) Combinatory logic and lambda calculus (03B40)

Related Items (12)

Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ On the enumeration of closures and environments with an application to random generation ⋮ Some families of trees arising in permutation analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers ⋮ On some enumerative problems in lambda calculus ⋮ Counting and generating terms in the binary lambda calculus ⋮ On the number of unary-binary tree-like structures with restrictions on the unary height ⋮ Asymptotic enumeration of compacted binary trees of bounded right height ⋮ Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms ⋮ Statistical properties of lambda terms

This page was built for publication: Lambda terms of bounded unary height