Mechanical synthesis of a unification algorithm in PowerEpsilon

Programming in constructive type theory corresponds to theorem proving in mathematics: the specification plays the role of the proposition to be proved and the program is obtained from the proof. We present a proof development system called PowerEpsilon, based on a constructive type theory which can be used as a formal program development system for actually deriving a program from a specification. The synthesis of a unification algorithm is presented to show the power of the system.