Typability and type-checking in the second-order λ-calculus are equivalent and undecidable (1994)

by J B Wells
Venue:In Proceedings, 9th Annual IEEE Symposium on Logic in Computer Science