Type Reconstruction in the Presence of Polymorphic Recursion and the Recursive Types
Data(s) |
12/09/2011
12/09/2011
20/12/1993
|
---|---|
Resumo |
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. |
Identificador |
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] |
Idioma(s) |
en_US |
Publicador |
Boston University Computer Science Department |
Relação |
BUCS Technical Reports;BUCS-TR-1993-019 |
Tipo |
Technical Report |