4 ms·

> Proving F matches the type is arbitrary hard and is impossible to automated in general So what? Even proving that array indices are not accessed out of boun

• marcosdumay 10y ago
  The only time I remember using indexed list access in Haskell was on a dirty script that would break in 3 months anyhow. They are just ugly, and throw a huge amount of safety away, for no big gain at all. Mainstream languages will gain much more from better iterators than by a ton of effort that just proves your indexes are within bounds.
  • groovy2shoes 10y ago
    While I agree that better iterators are desirable, iteration is far from the only operation on arrays (or any other collection for that matter).
• seanwilson 10y ago
  > Even proving that array indices are not accessed out of bounds within loops would be a considerable leap in the state of the art of industrial programming languages. For most cases (i.e. linear integer arithmetics), that's always automatically (dis-)provable. We have to start somewhere... It's a super interesting and important area, I was just pointing out it was a challenging one with lots of open issues.