Safe Haskell	Safe-Inferred
Language	Haskell2010

Plutarch.Extra.Boring

Contents

Synopsis

class PBoring (a :: S -> Type) where
- pboring :: Term s a
mapBoring :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). (PBoring a, PBoring b) => Term s (a :--> b)

Type class

class PBoring (a :: S -> Type) where Source #

Represents singleton values. They are 'boring' as having a value of that type tells you absolutely nothing, as they're all the same.

Laws

Since: 1.2.0

Methods

Instances details

PBoring a => PBoring (PIdentity a) Source #	Since: 1.2.0
Instance details Defined in Plutarch.Extra.Identity Methods pboring :: forall (s :: S). Term s (PIdentity a) Source #
PBoring a => PBoring (PSum a) Source #	Since: 1.2.0
Instance details Defined in Plutarch.Extra.Sum Methods pboring :: forall (s :: S). Term s (PSum a) Source #
PBoring (PUnit :: S -> Type) Source #	Since: 1.2.0
Instance details Defined in Plutarch.Extra.Boring Methods pboring :: forall (s :: S). Term s PUnit Source #
PBoring a => PBoring (PConst a b) Source #	Since: 1.2.0
Instance details Defined in Plutarch.Extra.Const Methods pboring :: forall (s :: S). Term s (PConst a b) Source #
PBoring underlying => PBoring (PTagged tag underlying) Source #	Since: 1.2.0
Instance details Defined in Plutarch.Extra.Tagged Methods pboring :: forall (s :: S). Term s (PTagged tag underlying) Source #

mapBoring :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). (PBoring a, PBoring b) => Term s (a :--> b) Source #

As every PBoring instance is a singleton, we can always convert one boring value into another.

Since: 1.2.0