Copyright	(C) 2018 chessai
License	MIT (see the file LICENSE)
Maintainer	chessai <chessai1996@gmail.com>
Stability	provisional
Portability	portable
Safe Haskell	None
Language	Haskell98

Data.Semiring.Generic

Contents

Orphan instances

Description

This module provides generic deriving tools for semirings and rings for product-like structures.

Synopsis

class GSemiring f where
- gzero' :: f a
- gone' :: f a
- gplus' :: f a -> f a -> f a
- gtimes' :: f a -> f a -> f a
gzero :: (Generic a, GSemiring (Rep a)) => a
gone :: (Generic a, GSemiring (Rep a)) => a
gplus :: (Generic a, GSemiring (Rep a)) => a -> a -> a
gtimes :: (Generic a, GSemiring (Rep a)) => a -> a -> a
class GRing f where
- gnegate' :: f a -> f a
gnegate :: (Generic a, GRing (Rep a)) => a -> a

Documentation

class GSemiring f where #

Methods

gzero' :: f a #

gone' :: f a #

gplus' :: f a -> f a -> f a #

gtimes' :: f a -> f a -> f a #

Instances

GSemiring (U1 :: Type -> Type) #
Instance details Defined in Data.Semiring.Generic Methods gzero' :: U1 a # gone' :: U1 a # gplus' :: U1 a -> U1 a -> U1 a # gtimes' :: U1 a -> U1 a -> U1 a #
Semiring a => GSemiring (K1 i a :: Type -> Type) #
Instance details Defined in Data.Semiring.Generic Methods gzero' :: K1 i a a0 # gone' :: K1 i a a0 # gplus' :: K1 i a a0 -> K1 i a a0 -> K1 i a a0 # gtimes' :: K1 i a a0 -> K1 i a a0 -> K1 i a a0 #
(GSemiring a, GSemiring b) => GSemiring (a :*: b) #
Instance details Defined in Data.Semiring.Generic Methods gzero' :: (a :: b) a0 # gone' :: (a :: b) a0 # gplus' :: (a :: b) a0 -> (a :: b) a0 -> (a :: b) a0 # gtimes' :: (a :: b) a0 -> (a :: b) a0 -> (a :: b) a0 #
GSemiring a => GSemiring (M1 i c a) #
Instance details Defined in Data.Semiring.Generic Methods gzero' :: M1 i c a a0 # gone' :: M1 i c a a0 # gplus' :: M1 i c a a0 -> M1 i c a a0 -> M1 i c a a0 # gtimes' :: M1 i c a a0 -> M1 i c a a0 -> M1 i c a a0 #

gzero :: (Generic a, GSemiring (Rep a)) => a #

Generically generate a Semiring zero for any product-like type implementing Generic.

It is only defined for product types.

gplus gzero a = a = gplus a gzero

gone :: (Generic a, GSemiring (Rep a)) => a #

Generically generate a Semiring one for any product-like type implementing Generic.

It is only defined for product types.

gtimes gone a = a = gtimes a gone

gplus :: (Generic a, GSemiring (Rep a)) => a -> a -> a #

Generically generate a Semiring plus operation for any type implementing Generic. It is only defined for product types.

gplus a b = gplus b a

gtimes :: (Generic a, GSemiring (Rep a)) => a -> a -> a #

Generically generate a Semiring times operation for any type implementing Generic. It is only defined for product types.

gtimes a (gtimes b c) = gtimes (gtimes a b) c
gtimes a gzero = gzero = gtimes gzero a

class GRing f where #

Methods

gnegate' :: f a -> f a #

Instances

GRing (U1 :: Type -> Type) #
Instance details Defined in Data.Semiring.Generic Methods gnegate' :: U1 a -> U1 a #
Ring a => GRing (K1 i a :: Type -> Type) #
Instance details Defined in Data.Semiring.Generic Methods gnegate' :: K1 i a a0 -> K1 i a a0 #
(GRing a, GRing b) => GRing (a :*: b) #
Instance details Defined in Data.Semiring.Generic Methods gnegate' :: (a :: b) a0 -> (a :: b) a0 #
GRing a => GRing (M1 i c a) #
Instance details Defined in Data.Semiring.Generic Methods gnegate' :: M1 i c a a0 -> M1 i c a a0 #

gnegate :: (Generic a, GRing (Rep a)) => a -> a #

Generically generate a Ring negate operation for any type implementing Generic. It is only defined for product types.

gplus a (gnegate a) = zero

Orphan instances

(Ring a, Ring b) => Ring (a, b) #
Instance details Methods negate :: (a, b) -> (a, b) #
(Semiring a, Semiring b) => Semiring (a, b) #
Instance details Methods plus :: (a, b) -> (a, b) -> (a, b) # zero :: (a, b) # times :: (a, b) -> (a, b) -> (a, b) # one :: (a, b) #
(Ring a, Ring b, Ring c) => Ring (a, b, c) #
Instance details Methods negate :: (a, b, c) -> (a, b, c) #
(Semiring a, Semiring b, Semiring c) => Semiring (a, b, c) #
Instance details Methods plus :: (a, b, c) -> (a, b, c) -> (a, b, c) # zero :: (a, b, c) # times :: (a, b, c) -> (a, b, c) -> (a, b, c) # one :: (a, b, c) #
(Ring a, Ring b, Ring c, Ring d) => Ring (a, b, c, d) #
Instance details Methods negate :: (a, b, c, d) -> (a, b, c, d) #
(Semiring a, Semiring b, Semiring c, Semiring d) => Semiring (a, b, c, d) #
Instance details Methods plus :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # zero :: (a, b, c, d) # times :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # one :: (a, b, c, d) #
(Ring a, Ring b, Ring c, Ring d, Ring e) => Ring (a, b, c, d, e) #
Instance details Methods negate :: (a, b, c, d, e) -> (a, b, c, d, e) #
(Semiring a, Semiring b, Semiring c, Semiring d, Semiring e) => Semiring (a, b, c, d, e) #
Instance details Methods plus :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # zero :: (a, b, c, d, e) # times :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # one :: (a, b, c, d, e) #
(Ring a, Ring b, Ring c, Ring d, Ring e, Ring f) => Ring (a, b, c, d, e, f) #
Instance details Methods negate :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) #
(Semiring a, Semiring b, Semiring c, Semiring d, Semiring e, Semiring f) => Semiring (a, b, c, d, e, f) #
Instance details Methods plus :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # zero :: (a, b, c, d, e, f) # times :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # one :: (a, b, c, d, e, f) #
(Ring a, Ring b, Ring c, Ring d, Ring e, Ring f, Ring g) => Ring (a, b, c, d, e, f, g) #
Instance details Methods negate :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #
(Semiring a, Semiring b, Semiring c, Semiring d, Semiring e, Semiring f, Semiring g) => Semiring (a, b, c, d, e, f, g) #
Instance details Methods plus :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # zero :: (a, b, c, d, e, f, g) # times :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # one :: (a, b, c, d, e, f, g) #