4 ms·
Except that's not possible yet. The pitfalls, limitations, and complexity of languages with advanced type systems such as Scala and Haskell are evidence that th
by swannodette 15y ago
Except that's not possible yet. The pitfalls, limitations, and complexity of languages with advanced type systems such as Scala and Haskell are evidence that the Curry-Howard isomorphism is not useful enough.
- Peaker 15y agoCan you name some pitfalls, limitations or complexity in Haskell? Haskell is not a complicated language, but it may be hard to learn because it is so different. My experience is that people get frustrated trying to learn it, and decide if it was hard to learn, it must be "too difficult".
- swannodette 15y agohttp://research.microsoft.com/en-us/um/people/simonpj/papers/constraints/jfp-outsidein.pdf http://research.microsoft.com/en-us/um/people/simonpj/papers... to understand the tradeoffs involved in building a state-of-the-art type checker for an expressive advanced type system. Look at the Haskell bug list around the type checker. Also, http://pchiusano.blogspot.com/2011/05/making-most-of-scalas-extremely-limited.html http://pchiusano.blogspot.com/2011/05/making-most-of-scalas-... Also, http://www.cis.upenn.edu/~bcpierce/papers/harmful-mfps.pdf http://www.cis.upenn.edu/~bcpierce/papers/harmful-mfps.pdf Also, http://people.cs.kuleuven.be/~tom.schrijvers/Research/papers/monad_zipper_draft.pdf http://people.cs.kuleuven.be/~tom.schrijvers/Research/papers...
- Peaker 15y agoHmm.. I don't know Scala, so I cannot really discuss Scala complexity. But having no degree whatsoever, I find pretty much all Haskell I encounter understandable and approachable and that has been the case ever since I had around 4-6 months of Haskell experience. I have never encountered significant bugs in GHC's type checker -- are there any more bugs there than there are in other less advanced type systems?