  The set of pure terms which are typable in the $\lambda$$\Pi$-calculus in a
given context is not recursive. So there is no general type inference algorithm
for the programming language Elf and, in some cases, some type information has
to be mentioned by the programmer.
