A. Bacher, O. Bodini, and A. Jacquot, Efficient random sampling of binary and unary-binary trees via holonomic equations, 1140.

O. Bodini, D. Gardy, and B. 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

O. Bodini, D. Gardy, B. Gittenberger, and A. Jacquot, Enumeration of generalized BCI lambda-terms, Electr. J. Comb, vol.20, issue.4, p.30, 2013.

O. Bodini, D. Gardy, and A. Jacquot, Asymptotics and random sampling for BCI and BCK lambda terms, Theoretical Computer Science, vol.502, pp.227-238, 2013.
DOI : 10.1016/j.tcs.2013.01.008

K. Claessen and J. Hughes, QuickCheck: a lightweight tool for random testing of Haskell programs, pp.268-279, 2000.

R. David, K. Grygiel, J. Kozik, C. Raffalli, G. Theyssier et al., Asymptotically almost all ????-terms are strongly normalizing, Logical Methods in Computer Science, vol.9, issue.1, pp.21-30, 2013.
DOI : 10.2168/LMCS-9(1:2)2013

URL : https://hal.archives-ouvertes.fr/hal-00372035

N. G. De-bruijn, Asymptotic Methods in Analysis, 1958.

N. G. 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. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.4-5577, 2004.
DOI : 10.1109/WSC.2011.6147745

URL : https://hal.archives-ouvertes.fr/hal-00654267

J. Duregård, P. Jansson, and M. Wang, Feat: functional enumeration of algebraic types, Proceedings of the 5th ACM SIGPLAN Symposium on Haskell, pp.61-72, 2012.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2008.
DOI : 10.1017/CBO9780511801655

URL : https://hal.archives-ouvertes.fr/inria-00072739

K. Grygiel and P. Lescanne, Counting and generating lambda terms, Journal of Functional Programming, vol.23, issue.05, pp.594-628, 2013.
DOI : 10.1017/S0956796813000178

URL : https://hal.archives-ouvertes.fr/ensl-00879067

K. Grygiel and P. Lescanne, Counting terms in the binary lambda calculus. CoRR, abs, 1401.
URL : https://hal.archives-ouvertes.fr/ensl-00923203

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

D. E. Knuth, The Art of Computer Programming Fascicle 4: Generating All Trees, History of Combinatorial Generation, vol.4, 2006.

P. Lescanne, From ?? to ??, a journey through calculi of explicit substitutions, Proceedings of the 21st Annual ACM Symposium on Principles Of Programming Languages, pp.60-69, 1994.

P. Lescanne, An exercise on streams: convergence acceleration. CoRR, abs/1312, 2013.
URL : https://hal.archives-ouvertes.fr/ensl-00920026

P. Lescanne, On counting untyped lambda terms, Theoretical Computer Science, vol.474, pp.80-97, 2013.
DOI : 10.1016/j.tcs.2012.11.019

URL : https://hal.archives-ouvertes.fr/ensl-00578527

M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications, 1997.
DOI : 10.1007/978-0-387-49820-1

A. Nijenhuis and H. S. Wilf, Combinatorial algorithms for computers and calculators. Computer science and applied mathematics, 1978.

M. Paa-lka, Testing an optimising compiler by generating random lambda terms. Licentiatavhandling, 2012.

M. H. Paa-lka, 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. Rémy, Un procédé itératif de dénombrement d'arbres binaires et son applicationàapplicationà leur génération aléatoire, ITA, vol.19, issue.2, pp.179-195, 1985.

W. Stein, The Sage Development Team, Sage Mathematics Software, 2012.

J. Tromp, Binary Lambda Calculus and Combinatory Logic, Kolmogorov Complexity and Applications, volume 06051 of Dagstuhl Seminar Proceedings. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, 2006.
DOI : 10.1142/9789812770837_0014

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

X. Yang, Y. Chen, E. Eide, and J. Regehr, Finding and understanding bugs in C compilers, Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, pp.283-294, 2011.

B. Yorgey, Random binary trees with a size-limited critical Boltzmann sampler, 2013.