~bfiedler/typing-is-hard#10: 
Undecidability of OCaml type-checking

The reason mentioned ("since we can cause the type checker to loop infinitely") is not a proof of undecidability, but merely a proof that the OCaml compiler is not an algorithm that decides type-checking.

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, I've updated the description to mention the undecidable problem, and not an implementation issue

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