3 ms·

Haskell's type system has accrued complexity over the years, whereas a small dependently typed language can be implemented very easily [1]. [1] https://www.and

• AnimalMuppet 10y ago
  That's not a fair comparison, though. A fair comparison might be Haskell's type system compared to Idris, or a small dependent typed language against a small type inference language.
  • DanWaterworth 10y ago
    The question was, "how's that?". My answer was, it's possible for a small dependently typed language to be simpler than Haskell. I'd already made the assertion that Idris was less complicated than Haskell.