Sure it does, you just need Quickcheck property based testing: forall $ \xs -> s... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		axman6 on March 27, 2014 \| parent \| context \| favorite \| on: What it's like to use Haskell Sure it does, you just need Quickcheck property based testing: `forall $ \xs -> sorted (qsort xs :: [Int])`

wnoise on March 27, 2014 | [–]

That's not static.

dangirsh on March 27, 2014 | [–]

Or typing

axman6 on March 28, 2014 | [–]

No, it's not, but Haskell's type system is what allows quickcheck to work as well as it does. The implementations in other languages mostly lack a lot of the power provided by the type system.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact