That's awesome, thanks!

Seems to be the oldest thread here from ten years ago, but I don't see it resolved in the code.

Please correct me if I'm mistaken:

The maximum degree of our polynoms will be smaller than 16.

In the Haskell property test suite though there is gen15 = choose (0, 16) which generates polynoms x^16 as the range of choose is inclusive.

I agree. It feels strange to talk about n log n complexity in the context of BogoSort, but as we are assuming a quantum computation runtime environment, your criticism makes sense. :) Unfortunately I can't revert the solution.

Random Perl tests produce strings with less than two characters.

Thanks, Johan, I'll try!

Very cool kata, thanks! My Haskell solution seems to work correctly, but times out with the big test set. Generating 10k entries takes 2-7 seconds on my machine, which is not very satisfying. Currently I have no idea what to improve. :/

You don't like it?

I don't know how this passed the tests... Equivalent (point free) versions of it did not.

I'm sorry for your time, but I'm also glad you liked it. :)

You're right, it's an unlawful instance. :)

[...] suggests that it receives a function (Name -> Maybe String) and returns another function (Phalanx -> Maybe String)

which is true with and without the parentheses because of Haskell's autocurrying. But I agree that the parentheses should be omitted as they do nothing.

Fixed by inserting two newlines. :)

Nice! I would prefer zipWith ($) over zipWith id for readability reasons. :)

Thanks, fixed! :)