S. Alves and S. Broda, A short note on type-inhabitation: Formula-trees vs. game semantics, Information Processing Letters, vol.115, issue.11, pp.908-911, 2015.

T. Aoto and H. Ono, Uniqueness of normal forms in {?, ?}-fragment of NJ, 1994.

H. Barendregt, W. Dekkers, and R. Statman, Lambda Calculus with Types, Perspectives in Logic, 2013.

C. Ben-yelles, Type Assignment in the Lambda-Calculus: Syntax & Semantics, 1979.

P. Bourreau and S. Salvati, Game semantics and uniqueness of type inhabitance in the simply-typed ?-calculus, Proceedings of TLCA 2011, vol.6690, pp.61-75, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00719044

S. Broda and L. Damas, On long normal inhabitants of a type, Journal of Logic and Computation, vol.15, issue.3, pp.353-390, 2005.

A. Bucciarelli, D. Kesner, and S. R. Rocca, The inhabitation problem for non-idempotent intersection types, Proceedings of IFIP TCS 2014, vol.8705, pp.341-354, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01402082

R. David and M. Zaionc, Counting proofs in propositional logic, Archive for Mathematical Logic, vol.48, issue.2, pp.185-199, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00385164

G. Dowek and Y. Jiang, Enumerating proofs of positive formulae, The Computer Journal, vol.52, issue.7, pp.799-807, 2009.

A. Dudenhefner and J. Rehof, Intersection type calculi of bounded dimension, Proceedings of POPL 2017, pp.653-665, 2017.

E. Santo, J. Matthes, R. Pinto, and L. , A coinductive approach to proof search, Proceedings of FICS 2013, vol.126, pp.28-43, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01226485

E. Santo, J. Matthes, R. Pinto, and L. , A coinductive approach to proof search through typed lambda-calculi, 2016.

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

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

C. Liang and D. Miller, Focusing and polarization in linear, intuitionistic, and classical logic, Theoretical Computer Science, vol.410, pp.4747-4768, 2009.

D. Miller and G. Nadathur, Programming with Higher-Order Logic, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776197

G. Mints, A coherence theorem for cartesian closed categories (abstract), The Journal of Symbolic Logic, vol.44, pp.453-454, 1979.

G. Mints, A simple proof for the coherence theorem for cartesian closed categories, Selected papers in proof theory, vol.3, pp.213-220, 1992.

A. Schubert, W. Dekkers, and H. P. Barendregt, Automata theoretic account of proof search, Proceedings CSL 2015, LIPIcs, vol.41, pp.128-143, 2015.

M. Takahashi, Y. Akama, and S. Hirokawa, Normal proofs and their grammar, Information and Computation, vol.125, issue.2, pp.144-153, 1996.

J. B. Wells and B. Yakobowski, Graph-based proof counting and enumeration with applications for program fragment synthesis, Proceedings of LOPSTR 2004, vol.3573, pp.262-277, 2004.