On the likelihood of normalization in combinatory logic

[1]  Danièle Gardy,et al.  Enumeration of Generalized BCI Lambda-terms , 2013, Electron. J. Comb..

[2]  Peter Allen,et al.  Maximum Planar Subgraphs in Dense Graphs , 2013, Electron. J. Comb..

[3]  Jean-Luc Rémy,et al.  Un Procédé Itératif de Dénombrement D'arbres Binaires et Son Application A Leur Génération Aléatoire , 1985, RAIRO Theor. Informatics Appl..

[4]  Pierre Lescanne,et al.  Counting and generating terms in the binary lambda calculus , 2015, J. Funct. Program..

[5]  Zofia Kostrzycka,et al.  Statistics of Intuitionistic versus Classical Logics , 2004, Stud Logica.

[6]  Alexander Shen,et al.  Generic algorithms for halting problem and optimal machines revisited , 2016, Log. Methods Comput. Sci..

[7]  Christophe Raffalli,et al.  Asymptotically almost all \lambda-terms are strongly normalizing , 2009 .

[8]  Maciej Bendkowski.  Normal-order reduction grammars , 2017, J. Funct. Program..

[9]  Zbigniew Golebiewski,et al.  On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation , 2016, STACS.

[10]  Danièle Gardy,et al.  Classical and Intuitionistic Logic Are Asymptotically Identical , 2007, CSL.

[11]  Joel David Hamkins,et al.  The Halting Problem Is Decidable on a Set of Asymptotic Probability One , 2006, Notre Dame J. Formal Log..

[12]  Antoine Genitrini,et al.  In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid , 2012, Ann. Pure Appl. Log..

[13]  Alexandra Silva,et al.  Generalizing determinization from automata to coalgebras , 2013, Log. Methods Comput. Sci..

[14]  John Tromp.  Binary Lambda Calculus and Combinatory Logic , 2006, Kolmogorov Complexity and Applications.

[15]  Jerzy Tyszkiewicz,et al.  Statistical properties of simple types , 2000, Mathematical Structures in Computer Science.