Observation:

In  ghc-2.08  (linux, PC-486),   -O compilation

  "Integer is 5 times slower than Int"  - even when the numbers
  are small ( < 2^20 ).

Is this expected?
This is the result for the task, like, say, the matrix inversion 
over  Int(eger) modulo prime q.  

------------------
Sergey Mechveliani

[EMAIL PROTECTED]

Reply via email to