Copyright	(c) Henning Thielemann 2009-2010 Mikael Johansson 2006
Maintainer	numericprelude@henning-thielemann.de
Stability	provisional
Portability	Abstract concept of a Monoid.
Safe Haskell	Safe
Language	Haskell98

Algebra.Monoid

Description

Will be used in order to generate type classes for generic algebras. An algebra is a vector space that also is a monoid. Should we use the Monoid class from base library despite its unfortunate method name mappend?

Synopsis

class C a where

Documentation

class C a where #

We expect a monoid to adher to associativity and the identity behaving decently. Nothing more, really.

Minimal complete definition

idt, (<*>)

Methods

idt :: a #

(<*>) :: a -> a -> a #

cumulate :: [a] -> a #

Instances

C All #
Instance details Defined in Algebra.Monoid Methods idt :: All # (<*>) :: All -> All -> All # cumulate :: [All] -> All #
C Any #
Instance details Defined in Algebra.Monoid Methods idt :: Any # (<*>) :: Any -> Any -> Any # cumulate :: [Any] -> Any #
C T #
Instance details Defined in Number.Peano Methods idt :: T # (<*>) :: T -> T -> T # cumulate :: [T] -> T #
C (First a) #
Instance details Defined in Algebra.Monoid Methods idt :: First a # (<*>) :: First a -> First a -> First a # cumulate :: [First a] -> First a #
C (Last a) #
Instance details Defined in Algebra.Monoid Methods idt :: Last a # (<*>) :: Last a -> Last a -> Last a # cumulate :: [Last a] -> Last a #
C a => C (Dual a) #
Instance details Defined in Algebra.Monoid Methods idt :: Dual a # (<*>) :: Dual a -> Dual a -> Dual a # cumulate :: [Dual a] -> Dual a #
C (Endo a) #
Instance details Defined in Algebra.Monoid Methods idt :: Endo a # (<*>) :: Endo a -> Endo a -> Endo a # cumulate :: [Endo a] -> Endo a #
C a => C (Sum a) #
Instance details Defined in Algebra.Monoid Methods idt :: Sum a # (<*>) :: Sum a -> Sum a -> Sum a # cumulate :: [Sum a] -> Sum a #
C a => C (Product a) #
Instance details Defined in Algebra.Monoid Methods idt :: Product a # (<*>) :: Product a -> Product a -> Product a # cumulate :: [Product a] -> Product a #
C a => C (T a) #
Instance details Defined in Number.NonNegative Methods idt :: T a # (<*>) :: T a -> T a -> T a # cumulate :: [T a] -> T a #
Ord a => C (Max a) #
Instance details Defined in MathObj.Monoid Methods idt :: Max a # (<*>) :: Max a -> Max a -> Max a # cumulate :: [Max a] -> Max a #
Ord a => C (Min a) #
Instance details Defined in MathObj.Monoid Methods idt :: Min a # (<*>) :: Min a -> Min a -> Min a # cumulate :: [Min a] -> Min a #
C a => C (LCM a) #
Instance details Defined in MathObj.Monoid Methods idt :: LCM a # (<*>) :: LCM a -> LCM a -> LCM a # cumulate :: [LCM a] -> LCM a #
C a => C (GCD a) #
Instance details Defined in MathObj.Monoid Methods idt :: GCD a # (<*>) :: GCD a -> GCD a -> GCD a # cumulate :: [GCD a] -> GCD a #
C a => C (T a) #
Instance details Defined in Number.NonNegativeChunky Methods idt :: T a # (<*>) :: T a -> T a -> T a # cumulate :: [T a] -> T a #
Ix i => C (T i) #
Instance details Defined in MathObj.Permutation.CycleList.Check Methods idt :: T i # (<*>) :: T i -> T i -> T i # cumulate :: [T i] -> T i #