Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
class Semigroup a => Ringoid a where Source #
When providing a new instance, you should ensure it satisfies: * Left distributivity: x * (y + z) ≡ x * y + x * z * Right distributivity: (y + z) * x ≡ y * x + z * x
Instances
Ringoid Boolean Source # | |
Ringoid Denumerator Source # | |
Defined in Pandora.Paradigm.Primary.Object.Denumerator (*) :: Denumerator -> Denumerator -> Denumerator Source # | |
Ringoid Numerator Source # | |
Ringoid a => Ringoid (Exactly a) Source # | |
Ringoid r => Ringoid (e -> r) Source # | |
(Ringoid s, Ringoid a) => Ringoid (s :*: a) Source # | |
Ringoid a => Ringoid (Vector a a) Source # | |
(Ringoid a, Ringoid r, Ringoid (a :*: r), Ringoid (Vector r a)) => Ringoid (Vector (a :*: r) a) Source # | |
Ringoid a => Ringoid (Constant a b) Source # | |
Ringoid a => Ringoid (Tagged tag a) Source # | |