107
Voted
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...