We present a complete proof synthesis method for the eight type systems of Barendregt's cube extended with η-conversion. Because these systems verify the proofs-as-objects paradigm, the proof synthesis method is a one-level process merging unification and resolution. Then we present a variant of this method, which is incomplete but much more efficient. Finally we show how to turn this algorithm into a unification algorithm.