Module

Dissect.Generic

Package: purescript-dissect
Repository: PureFunctor/purescript-dissect

Polynomial functors and bifunctors for algebraically defining data types with free Dissect instances as described in "Algebra of Programming" by Bird and de Moor; as well as the functional dissections paper.

#Const Source

newtype Const :: forall k. Type -> k -> Typenewtype Const a b

The constant functor, which maps all b to some constant a.

Constructors

Const a

Instances

(Eq a) => Eq (Const a b)
(Ord a) => Ord (Const a b)
Functor (Const a)
(Show a) => Show (Const a b)
Dissect (Const a) (Const_2 Void)

#Const_2 Source

newtype Const_2 :: forall k l. Type -> k -> l -> Typenewtype Const_2 a b c

Constructors

Const_2 a

Instances

#Id Source

newtype Id a

The identity functor, which maps all a back into a.

Constructors

Id a

Instances

(Eq a) => Eq (Id a)
(Ord a) => Ord (Id a)
Functor Id
(Show a) => Show (Id a)
Dissect Id (Const_2 Unit)

#Product Source

data Product :: forall k. (k -> Type) -> (k -> Type) -> k -> Typedata Product a b c

The product of polynomial functors.

Constructors

Product (a c) (b c)

Instances

(Eq (a c), Eq (b c)) => Eq (Product a b c)
(Ord (a c), Ord (b c)) => Ord (Product a b c)
(Show (a c), Show (b c), Show c) => Show (Product a b c)
(Functor a, Functor b) => Functor (Product a b)
(Dissect p p', Dissect q q') => Dissect (Product p q) (Sum_2 (Product_2 p' (Joker q)) (Product_2 (Clown p) q'))

#Product_2 Source

data Product_2 :: forall k l. (k -> l -> Type) -> (k -> l -> Type) -> k -> l -> Typedata Product_2 p q a b

Constructors

Product_2 (p a b) (q a b)

Instances

(Show (p a b), Show (q a b)) => Show (Product_2 p q a b)
(Bifunctor p, Bifunctor q) => Bifunctor (Product_2 p q)
(Dissect p p', Dissect q q') => Dissect (Product p q) (Sum_2 (Product_2 p' (Joker q)) (Product_2 (Clown p) q'))

#Sum Source

data Sum :: forall k. (k -> Type) -> (k -> Type) -> k -> Typedata Sum a b c

The sum of polynomial functors.

Constructors

SumL (a c)
SumR (b c)

Instances

(Eq (a c), Eq (b c)) => Eq (Sum a b c)
(Ord (a c), Ord (b c)) => Ord (Sum a b c)
(Functor a, Functor b) => Functor (Sum a b)
(Show (a c), Show (b c), Show c) => Show (Sum a b c)
(Dissect p p', Dissect q q') => Dissect (Sum p q) (Sum_2 p' q')

#Sum_2 Source

data Sum_2 :: forall k l. (k -> l -> Type) -> (k -> l -> Type) -> k -> l -> Typedata Sum_2 p q a b

Constructors

SumL_2 (p a b)
SumR_2 (q a b)

Instances

(Show (p a b), Show (q a b)) => Show (Sum_2 p q a b)
(Bifunctor p, Bifunctor q) => Bifunctor (Sum_2 p q)
(Dissect p p', Dissect q q') => Dissect (Sum p q) (Sum_2 p' q')
(Dissect p p', Dissect q q') => Dissect (Product p q) (Sum_2 (Product_2 p' (Joker q)) (Product_2 (Clown p) q'))

#type (:*:) Source

Operator alias for Dissect.Generic.Product (right-associative / precedence 5)

#type (:+:) Source

Operator alias for Dissect.Generic.Sum (right-associative / precedence 4)

#(:*:) Source

Operator alias for Dissect.Generic.Product (right-associative / precedence 5)

Modules: Dissect.Class; Dissect.Generic; Dissect.Record; Dissect.Variant