Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable (1993)

by J. B. Wells
Citations:12 - 1 self

Document Versions

Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable –J. B. Wells — 1993
Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable –J. B. Wells — 1996 — In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science (LICS