First of all, this is made just for fun. The results are mainly as expected and they prove nothing about the real performances.
Test 1 Elm-code at rosettacode
Test code with modified limits
run in browser elm at Ellie site
The primes up to 320 000 are: 2, 3, 5, 7, 11, 13,
…, 319931, 319937, 319967, 319973, 319981, 319993.
Found 27608 primes to 320000 in 173 milliseconds.
Test 2 run in browser local compiled elm to JavaScript
The primes up to 320 000 are: 2, 3, 5, 7, 11, 13,…,319849, 319883, 319897, 319901, 319919, 319927, 319931, 319937, 319967, 319973, 319981, 319993.
Found 27608 primes to 320000 in 113 milliseconds.
Test 3 run at local file compiled with GHC
,99709,99713,99719,99721,99733,99761,99767,99787,99793,99809,99817,99823,99829,99833,99839,99859,99871,99877,99881,99901,99907,99923,
99929,99961,99971,99989,99991]
The number of primes up to 320000 is 27608
Found 27608 to 320000 in 6 milliseconds.
~/myhaskell$
Test 4 run in browser at Playground
modifed limits
copy from the original code at rosettacode
19927,19937,19949,19961,19963,19973,19979,19991,19993,19997]
The number of primes up to 320000 is 27608
Found 27608 to 320000 in 3 milliseconds.
Test 5
run in ghci
The number of primes up to 320000 is 27608
Found 27608 to 320000 in 807 milliseconds.
ghci> :q