Why is Clean faster than Haskell?
If you compare Clean and Haskell in the Debian shootout, Clean is consistently faster than Haskell. These languages are spitting images of each other, save that Clean has some way of avoiding Monads. In addition, Clean I believe is based on graphs instead of lambda calculus - but both of these compute the same things so why would that matter?
The summary table (at bottom, horribly rendered in Firefox), shows Clean winning 10-0.
Also, which language came first? Clean or Haskell?