Jahama, Said; Kfoury, A. J.(Boston University Computer Science Department, 1993-12-20)
Various restrictions on the terms allowed for substitution give rise to different cases of semi-unification. Semi-unification on finite and regular terms has already been considered in the literature. We introduce a general ...
Jahama, Said; Kfoury, A. J.(Boston University Computer Science Department, 1993-12-20)
We establish the equivalence of type reconstruction with polymorphic recursion and recursive types is equivalent to regular semi-unification which proves the undecidability of the corresponding type reconstruction problem. ...
