On the undecidability of partial polymorphic type reconstruction (1992)
Cached
Download Links
by
Frank Pfenning
| Venue: | FUNDAMENTA INFORMATICAE |
| Citations: | 26 - 0 self |
BibTeX
@TECHREPORT{Pfenning92onthe,
author = {Frank Pfenning},
title = {On the undecidability of partial polymorphic type reconstruction },
institution = {FUNDAMENTA INFORMATICAE},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We prove that partial type reconstruction for the pure polymorphic *-calculus is undecidable by a reduction from the second-order unification problem, extending a previous result by H.-J. Boehm. We show further that partial type reconstruction remains undecidable even in a very small predicative fragment of the polymorphic *-calculus, which implies undecidability of partial type reconstruction for * ML as introduced by Harper, Mitchell, and Moggi.
