Asymptotically almost all \lambda-terms are strongly normalizing
From MaRDI portal
Publication:4913764
DOI10.2168/LMCS-9(1:2)2013zbMath1278.03034MaRDI QIDQ4913764
René David, Jakub Kozik, Guillaume Theyssier, Marek Zaionc, Christophe Raffalli, Katarzyna Grygiel
Publication date: 9 April 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Related Items
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, Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices
Uses Software