4 ms·
> Since the type system in Scala is popularly touted as Turing complete So is GHC's. Turing-Completeness says nothing about speed, only about termination pred
by calpaterson 14y ago
> Since the type system in Scala is popularly touted as Turing complete
So is GHC's. Turing-Completeness says nothing about speed, only about termination prediction. GHCi can type check most codebases in much less than a second. The puzzling thing about the apologism for Scala's slow speed is that some people seem to think that no FP language has ever had a fast compiler before...
- taeric 14y agoMeh, the puzzling thing about many acolytes of anything in programming is the belief that all things have been solved. Usually best in what they care for most. Clearly, since my point was easily shown as a non-sequitor, I'm not an expert. Following the folks involved with Scala, on the other hand, I don't have any reason to feel that they are the rank amateurs that they would have to be to be to produce such a slow compiler with no need. My hunch, the support of nominative subtyping is the culprit. My backing for this? Pretty much nothing other than snippets of posts others have made.