where
import NumericPrelude
-import Algebra.Field
-import Algebra.RealRing
-import Algebra.ToInteger
+import Algebra.Field ( C )
+import Algebra.RealRing ( C )
+import Algebra.ToInteger ( C )
-- | Partition the interval [@a@, @b@] into @n@ subintervals, which we
-- then return as a list of pairs.
let xi = a + k'*h,
let xj = a + (k'+1)*h ]
where
- h = (b-a)/(fromIntegral $ toInteger n)
+ coerced_n = fromIntegral $ toInteger n
+ h = (b-a)/coerced_n
-- | Compute the unit roundoff (machine epsilon) for this machine. We