Asymptotically almost all \lambda-terms are strongly normalizing
From MaRDI portal
Recommendations
- Characterisation of strongly normalising \(\lambda\mu\)-terms
- Strong normalizability as a finiteness structure via the Taylor expansion of -terms
- scientific article; zbMATH DE number 4055611
- Strong normalization theorems for quantized -calculi
- Foundations of Software Science and Computation Structures
- Strong normalization for all-style \(\mathbf{LK}^\mathrm{tq}\)
- A proof of strong normalization for \(F_ 2\), \(F_ \omega\), and beyond
- scientific article; zbMATH DE number 2080223
- Strong normalisation for applied lambda calculi
- Strong normalization of \(\lambda^{\mathrm{Sym}}_{\mathrm{Prop}}\)- and \(\overline{\lambda}\mu\overline{\mu}^\ast\)-calculi
Cited in
(19)- Enumerating lambda terms by weighted length of their de Bruijn representation
- On the number of unary-binary tree-like structures with restrictions on the unary height
- On randomised strategies in the -calculus
- Statistical properties of lambda terms
- Asymptotic properties of combinatory logic
- Almost every simply typed -term has a long -reduction sequence
- On the likelihood of normalization in combinatory logic
- Ranking/unranking of lambda terms with compressed de Bruijn indices
- Strong normalization of barrecursive terms without using infinite terms
- Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- On the enumeration of closures and environments with an application to random generation
- Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms
- Counting environments and closures
- The combinator M and the Mockingbird lattice
- Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels
- Counting and generating terms in the binary lambda calculus
- Normal-order reduction grammars
- On average-case hardness of higher-order model checking
This page was built for publication: Asymptotically almost all \lambda-terms are strongly normalizing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4913764)
