Good point. This now uses a list of candidate names to generate an input list of up to 100 names. Thank you!

I have difficulty reading LISP, but are you generating lists of completely random names for the random tests? Those would be very unlikely to include repeats.

You should be generating lists of names picked randomly from a limited list, the way it's done in JS and Haskell ( I don't know how the C# original does it. I hope that doesn't generate completely random name lists either ).

Type issue in the test suite?

test/CalculateParityBitSpec.hs:18:105: error:
• Couldn't match expected type ‘Int’ with actual type ‘Word’
• In the third argument of ‘assertEqual’, namely
‘(checkParity parity string)’
In a stmt of a 'do' block:
assertEqual
("checkParity " <> show parity <> " " <> show string)
(refCheckParity parity string) (checkParity parity string)
In the expression:
do assertEqual
("checkParity " <> show parity <> " " <> show string)
(refCheckParity parity string) (checkParity parity string)
|
18 | assertEqual ("checkParity " <> show parity <> " " <> show string) (refCheckParity parity string) (checkParity parity string)
|
^^^^^^^^^^^^^^^^^^^^^^^^^

Ashamed that I didn't realize it was this simple...

The Scala function should return List[String], not List[String, String]