Haskell has a problem with random tests. The random tests expect incorrect things, but you can just retry submitting until you get a pass. Following example is real, but I clipped it for length.

[8688,1372,6232,-35,-326,-6003,12892,6694,5299,-6213,1820,-2033,-7269,8660,307,4670,-6318,8339,8634,7146,15519,16743,11907,-9307,16726,19276,12766,-9192,-4597,13631,-5004,8612,6564,-9585,5116,16598,-9586,15430,12452,-569,-177,-6273,-6868,19138,3132,12539,17978,8804,-4987,10639,13348,5739,7088,13451,-1915,14140,-7536,-8051,-5624,…clipped for length]
  2
expected: "yes, ascending"
 but got: "no"

This array is not sorted and should not expect "yes, ascending."

Fuzzers! I need fuzzers in the Elm tests! Thank you so much a) for translating (which I totally should have done) and b) for reminding me how to make a dang fuzz test!!

Can you provide an example of a false negative random test?

@albertocmgr can you take a look? Does tagging work on CW? EDIT: It does not.

Love the reset after output!! So clever.

for sure and thank you! It is slower and doesn't have elm-format which is half the delight for me tbh. But it can be nice to write code that's snack sized on here so I can't stay away.

I ended up making a safe version using phantom types and the next move would be to try to see if the phantom builder pattern can apply (I've never used it so maybe this is actually already it!)
https://www.codewars.com/kata/reviews/5e513d6d6971ed00018f144b/groups/6393ce91c7247d00017b1a1a

aww TY bud!! im gonna redo this with some wrapped up types because naked Ints for this doesn't make me happy

TY for intercalate!! Hoogle is good, but not quite good enough to suggest it when I searched the signature String -> [String] -> String

If you look at the haskell solutions now only one passes. Everything else no longer does. The reference solution is incorrect now.