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

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

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

O. Bodini, A. Danì-ele-gardy, and . 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

G. Nicolaas and . De-bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church- Rosser theorem, Indagationes Mathematicae, vol.34, issue.5, 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.577-625, 2004.
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267

P. Flajolet, E. Fusy, and C. Pivoteau, Boltzmann sampling of unlabeled structures, Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, pp.201-211, 2007.

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.0379 Combinatorial and Asymptotic Methods for the Analysis of Algorithms, the Proceedings of 25th International Conference on Probabilistic, 2014.
URL : https://hal.archives-ouvertes.fr/ensl-00923203

J. and R. Hindley, Basic Simple Type Theory. Number 42 in Cambridge Tracts in Theoretical Computer Science, 1997.

A. Karttunen, Ranking and unranking functions, OEIS Wiki, 2015.

E. Donald and . 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, 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, 2008.

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

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.

P. Tarau, On type-directed generation of lambda terms, 31st International Conference on Logic Programming, p.2015, 2015.

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=10.1.1.695.3142

J. Wang, The efficient generation of random programs and their applications, 2004.