Asymptotically almost all \lambda-terms are strongly normalizing
From MaRDI portal
Publication:4913764
DOI10.2168/LMCS-9(1:2)2013zbMath1278.03034MaRDI QIDQ4913764
Jakub Kozik, Marek Zaionc, René David, Guillaume Theyssier, Christophe Raffalli, Katarzyna Grygiel
Publication date: 9 April 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Related Items (13)
Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices ⋮ On the enumeration of closures and environments with an application to random generation ⋮ The combinator M and the Mockingbird lattice ⋮ Unnamed Item ⋮ Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers ⋮ Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Counting and generating terms in the binary lambda calculus ⋮ Normal-order reduction grammars ⋮ 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 ⋮ Unnamed Item
Uses Software
This page was built for publication: Asymptotically almost all \lambda-terms are strongly normalizing
