Pages that link to "Item:Q4913764"
From MaRDI portal
The following pages link to Asymptotically almost all \lambda-terms are strongly normalizing (Q4913764):
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)
- 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)
- On the enumeration of closures and environments with an application to random generation (Q4972734) (← links)
- Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (Q4988930) (← links)
- (Q4993337) (← links)
- The combinator M and the Mockingbird lattice (Q5059139) (← links)
- Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels (Q5210975) (← links)
- Counting and generating terms in the binary lambda calculus (Q5371959) (← links)
- Normal-order reduction grammars (Q5372004) (← links)