The presentations of type theory based on a comprehension scheme and on $\lambda$-calculus are equivalent, both in the sense that the latter is a conservative extension of the former and that it can be encoded into it preserving provability. A similar result holds for set theory. A short version of this paper appeared in the proceedings of the conference {\it Typed Lambda-calculi and Applications (1995)}.}