~bfiedler/typing-is-hard#11: 
Undecidability of Haskell type-checking

The first reason mentioned is suspicious: "undecidable, as type checking in System F is undecidable". For a properly annotated version of System F (Church-style), type checking is decidable, while type inference is not. For Curry-style System F, both are undecidable.

Status
RESOLVED FIXED
Submitter
~lnde3
Assigned to
No-one
Submitted
6 months ago
Updated
2 months ago
Labels
No labels applied.

~bfiedler REPORTED FIXED 2 months ago

Thanks for the clarification. I've removed mentions to System F, as the other links are already provide sufficient reasons.

Register here or Log in to comment, or comment via email.