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

M. Bendkowski, K. Grygiel, P. Lescanne, and M. Zaionc, Combinatorics of ?-terms: a natural approach, 1609.

M. Bendkowski, K. Grygiel, P. Lescanne, and M. Zaionc, A Natural Counting of Lambda Terms, Rusins Martins Freivalds, Gregor Engels, and Barbara Catania SOFSEM 2016: Theory and Practice of Computer Science -42nd International Conference on Current Trends in Theory and Practice of Computer Science Proceedings , volume 9587 of Lecture Notes in Computer Science, pp.183-194, 2016.
DOI : 10.1007/978-3-662-49192-8_15

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

M. Bendkowski, K. Grygiel, and P. Tarau, Boltzmann Samplers for Closed Simply-Typed Lambda Terms, Practical Aspects of Declarative Languages - 19th International Symposium, PADL 2017 Proceedings, volume 10137 of Lecture Notes in Computer Science, pp.120-135, 2017.
DOI : 10.1007/3-540-44854-3_6

O. Bodini, D. Gardy, and B. Gittenberger, Lambda terms of bounded unary height, Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, pp.23-32, 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

A. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, pp.56-68, 1940.
DOI : 10.2307/2371199

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms , Third Edition, 2009.

R. David, C. Raffalli, G. Theyssier, K. Grygiel, J. Kozik et al., Some properties of random lambda terms, Logical Methods in Computer Science, vol.9, issue.1, 2009.

G. Nicolaas and . 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.

B. Gittenberger and Z. Golebiewski, On the number of lambda terms with prescribed size of their de Bruijn representation, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.1-4013, 2016.

K. Grygiel, P. M. Idziak, and M. Zaionc, How big is BCI fragment of BCK logic, Journal of Logic and Computation, vol.23, issue.3, pp.673-691, 2013.
DOI : 10.1093/logcom/exs017

URL : http://arxiv.org/abs/1112.0643

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, Abstract, Journal of Functional Programming, vol.20, 2015.
DOI : 10.1017/S0956796813000178

J. and R. Hindley, BCK-combinators and linear ??-terms have types, Theoretical Computer Science, vol.64, issue.1, pp.97-105, 1989.
DOI : 10.1016/0304-3975(89)90100-X

URL : http://doi.org/10.1016/0304-3975(89)90100-x

J. and R. Hindley, Basic Simple Type Theory. Number 42 in Cambridge Tracts in Theoretical Computer Science, 1997.
DOI : 10.1017/cbo9780511608865

URL : http://dx.doi.org/10.1016/s0898-1221(97)80228-3

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

N. Zeilberger, Counting isomorphism classes of ?-normal linear lambda terms, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01214121

N. Zeilberger, Abstract, Journal of Functional Programming, vol.26, p.21, 2016.
DOI : 10.1017/S095679681600023X

N. Zeilberger and A. Giorgetti, A correspondence between rooted planar maps and normal planar lambda terms, Logical Methods in Computer Science, vol.11, issue.3
DOI : 10.2168/LMCS-11(3:22)2015

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