Pages that link to "Item:Q5398332"
From MaRDI portal
The following pages link to Counting and generating lambda terms (Q5398332):
Displayed 13 items.
- Enumerating lambda terms by weighted length of their de Bruijn representation (Q1706116) (← links)
- On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
- On some enumerative problems in lambda calculus (Q2202676) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360) (← links)
- Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices (Q3453110) (← links)
- Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers (Q4603430) (← links)
- (Q4625705) (← links)
- Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (Q4988930) (← links)
- (Q5020970) (← links)
- Generating constrained random data with uniform distribution (Q5371949) (← links)
- Counting and generating terms in the binary lambda calculus (Q5371959) (← links)
- Normal-order reduction grammars (Q5372004) (← links)