{-# LANGUAGE UndecidableInstances #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
module NumHask.Extra () where
import NumHask (Additive, zero, (+))
import Prelude hiding (Num, (+))
instance {-# INCOHERENT #-} Additive () where
+ :: () -> () -> ()
(+) = () -> () -> ()
forall a b. a -> b -> a
const
zero :: ()
zero = ()
instance {-# INCOHERENT #-} (Additive x, Additive y) => Additive (x, y) where
zero :: (x, y)
zero = (x
forall a. Additive a => a
zero, y
forall a. Additive a => a
zero)
(x
a, y
b) + :: (x, y) -> (x, y) -> (x, y)
+ (x
c, y
d) = (x
a x -> x -> x
forall a. Additive a => a -> a -> a
+ x
c, y
b y -> y -> y
forall a. Additive a => a -> a -> a
+ y
d)
instance {-# INCOHERENT #-} (Additive x, Additive y, Additive z) => Additive (x, y, z) where
zero :: (x, y, z)
zero = (x
forall a. Additive a => a
zero, y
forall a. Additive a => a
zero, z
forall a. Additive a => a
zero)
(x
x1, y
y1, z
z1) + :: (x, y, z) -> (x, y, z) -> (x, y, z)
+ (x
x2, y
y2, z
z2) = (x
x1 x -> x -> x
forall a. Additive a => a -> a -> a
+ x
x2, y
y1 y -> y -> y
forall a. Additive a => a -> a -> a
+ y
y2, z
z1 z -> z -> z
forall a. Additive a => a -> a -> a
+ z
z2)
instance {-# INCOHERENT #-} (Additive x, Additive y, Additive z, Additive t) => Additive (x, y, z, t) where
zero :: (x, y, z, t)
zero = (x
forall a. Additive a => a
zero, y
forall a. Additive a => a
zero, z
forall a. Additive a => a
zero, t
forall a. Additive a => a
zero)
(x
x1, y
y1, z
z1, t
t1) + :: (x, y, z, t) -> (x, y, z, t) -> (x, y, z, t)
+ (x
x2, y
y2, z
z2, t
t2) = (x
x1 x -> x -> x
forall a. Additive a => a -> a -> a
+ x
x2, y
y1 y -> y -> y
forall a. Additive a => a -> a -> a
+ y
y2, z
z1 z -> z -> z
forall a. Additive a => a -> a -> a
+ z
z2, t
t1 t -> t -> t
forall a. Additive a => a -> a -> a
+ t
t2)
instance
{-# INCOHERENT #-}
(Additive x, Additive y, Additive z, Additive t, Additive s) =>
Additive (x, y, z, t, s)
where
zero :: (x, y, z, t, s)
zero = (x
forall a. Additive a => a
zero, y
forall a. Additive a => a
zero, z
forall a. Additive a => a
zero, t
forall a. Additive a => a
zero, s
forall a. Additive a => a
zero)
(x
x1, y
y1, z
z1, t
t1, s
s1) + :: (x, y, z, t, s) -> (x, y, z, t, s) -> (x, y, z, t, s)
+ (x
x2, y
y2, z
z2, t
t2, s
s2) = (x
x1 x -> x -> x
forall a. Additive a => a -> a -> a
+ x
x2, y
y1 y -> y -> y
forall a. Additive a => a -> a -> a
+ y
y2, z
z1 z -> z -> z
forall a. Additive a => a -> a -> a
+ z
z2, t
t1 t -> t -> t
forall a. Additive a => a -> a -> a
+ t
t2, s
s1 s -> s -> s
forall a. Additive a => a -> a -> a
+ s
s2)