|
|
|
| Don't ask to ask, just ask | |
| PerlMonks |
Re^2: Perl Cannot Be Parsed: A Formal Proofby Anonymous Monk |
| on Aug 13, 2009 at 19:29 UTC ( [id://788424]=note: print w/replies, xml ) | Need Help?? |
|
No, you can parse SML without doing type inference. The (only) tricky part of SML parsing is operator fixity, which doesn't depend on types at all.
And yes, SML type inference is superexponential, but only for contrived examples. So for "any practical reasons", it's not even remotely close to undecidability.
In Section
Meditations
|
|
||||||||||||||||||||||||||||||