Type reconstruction in the presence of polymorphic recursion and the recursive types
Files
Main Report
Date
1993-12-20
DOI
Authors
Jahama, Said
Kfoury, A.J.
Version
OA Version
Citation
Jahama, Said. "Type Reconstruction in the Presence of Polymorphic Recursion and Recursive Types", Technical Report BUCS-1993-019, Computer Science Department, Boston University, December 1993. [Available from: http://hdl.handle.net/2144/1477]
Abstract
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. We also establish the equivalence of type reconstruction with polymorphic recursion and positive recursive types to a special case of regular semi-unification which we call positive regular semi-unification. The decidability of positive regular semi-unification is an open problem.