C. B. Ben-yelles, Type assignment in the lambda-calculus: syntax & semantics, 1979.

S. Hirokawa, Infiniteness of proof(?) is polynomial-space complete, Theor. Comput. Sci, vol.206, issue.1-2, pp.331-339, 1998.

E. Santo, J. Matthes, R. Pinto, and L. , A Coinductive Approach to Proof Search, Proc. 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 LambdaCalculi, 2016.

E. Santo, J. Matthes, R. Pinto, and L. , Inhabitation in Simply-Typed Lambda-Calculus through a LambdaCalculus for Proof Search, / S0960129518000099. First View -volume not yet known, pp.1-33, 2018.

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

S. Alves and S. Broda, Unifying Framework for Type Inhabitation, 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, vol.108, p.16, 2018.

S. Broda and L. Damas, On Long Normal Inhabitants of a Type, J. Log. Comput, vol.15, issue.3, pp.353-390, 2005.

M. Takahashi, Y. Akama, and S. Hirokawa, Normal Proofs and Their Grammar, Inf. Comput, vol.125, issue.2, pp.144-153, 1996.

A. Dudenhefner and J. Rehof, The Complexity of Principal Inhabitation, 2nd International Conference on Formal Structures for Computation and Deduction, vol.84, 2017.