P. Henk and . Barendregt, The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics, 1984.

O. Bodini, B. Danì-ele-gardy, and . Gittenberger, Lambda terms of bounded unary height, Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2011.
DOI : 10.1137/1.9781611973013.3

C. Choppy, S. Kaplan, and M. Soria, Complexity analysis of term-rewriting systems, Theoretical Computer Science, vol.67, issue.2-3, pp.261-282, 1989.
DOI : 10.1016/0304-3975(89)90005-4
URL : https://hal.archives-ouvertes.fr/inria-00075687

R. David, C. Raffalli, G. Theyssier, K. Grygiel, J. Kozik et al., Asymptotically almost all ????-terms are strongly normalizing, Logical Methods in Computer Science, vol.9, issue.1, 2009.
DOI : 10.2168/LMCS-9(1:2)2013
URL : https://hal.archives-ouvertes.fr/hal-00372035

R. David and M. Zaionc, Counting proofs in propositional logic, Archive for Mathematical Logic, vol.206, issue.1???2, pp.185-199, 2009.
DOI : 10.1007/s00153-009-0119-5
URL : https://hal.archives-ouvertes.fr/hal-00385164

N. Govert-de-bruijn, Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church- Rosser theorem, Proc. Koninkl. Nederl. Akademie van Wetenschappen, pp.381-392, 1972.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2008.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

H. Fournier, A. Danì-ele-gardy, M. Genitrini, and . Zaionc, Classical and Intuitionistic Logic Are Asymptotically Identical, Lecture Notes in Computer Science, vol.4646, pp.177-193, 2007.
DOI : 10.1007/978-3-540-74915-8_16
URL : https://hal.archives-ouvertes.fr/hal-00530534

H. Fournier, A. Danì-ele-gardy, M. Genitrini, and . Zaionc, Tautologies over implication with negative literals, Mathematical Logic Quarterly, vol.355, issue.4, pp.388-396, 2010.
DOI : 10.1002/malq.200810053
URL : https://hal.archives-ouvertes.fr/hal-00530496

E. Donald and . Knuth, Selected Papers on Analysis of Algorithms, volume 102 of CSLI Lecture Notes, Center for the Study of Language and Information, 2000.

W. Lang, On polynomials related to derivatives of the generative functions of the Catalan numbers. The Fibonacci Quarterly, pp.299-313, 2002.

M. , H. Pa, K. Claessen, A. Russo, and J. Hughes, Testing an optimising compiler by generating random lambda terms, Proceedings of the 6th International Workshop on Automation of Software Test, AST '11, pp.91-97, 2011.

J. Wang, Generating random lambda calculus terms, 2005.

M. Zaionc, Probability distribution for simple tautologies, Theoretical Computer Science, vol.355, issue.2, pp.243-260, 2006.
DOI : 10.1016/j.tcs.2006.01.002
URL : http://doi.org/10.1016/j.tcs.2006.01.002