monoids-0.1.36: Monoids, specialized containers and a general map/reduce frameworkSource codeContentsIndex
Data.Ring.Module.AutomaticDifferentiation
Portabilityportable (instances use MPTCs)
Stabilityexperimental
Maintainerekmett@gmail.com
Description
Documentation
module Data.Ring.Module
data D s r m Source
show/hide Instances
(Bimodule r m, Reducer c r, Reducer c m) => Reducer c (D s r m)
Eq r => Eq (D s r m)
Fractional a => Fractional (D s a a)
Num a => Num (D s a a)
Ord r => Ord (D s r m)
(Read r, Read m) => Read (D s r m)
(Show r, Show m) => Show (D s r m)
Bimodule r m => Monoid (D s r m)
(Arbitrary r, Arbitrary m) => Arbitrary (D s r m)
(CoArbitrary r, CoArbitrary m) => CoArbitrary (D s r m)
Bimodule r m => Multiplicative (D s r m)
(Group r, Bimodule r m, Group m) => Group (D s r m)
(Ring r, Bimodule r m, Group m) => Ring (D s r m)
(SemiRing r, Bimodule r m) => SemiRing (D s r m)
(RightSemiNearRing r, Bimodule r m) => RightSemiNearRing (D s r m)
(LeftSemiNearRing r, Bimodule r m) => LeftSemiNearRing (D s r m)
(Ringoid r, Bimodule r m) => Ringoid (D s r m)
d :: (Bimodule r m, Ringoid m) => (forall s. D s r m -> D s r m) -> (r, m)Source
lift :: Bimodule r m => r -> D s r mSource
Produced by Haddock version 2.3.0