Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- data PThese (a :: S -> Type) (b :: S -> Type) (s :: S)
- data PDThese (a :: S -> Type) (b :: S -> Type) (s :: S)
- = PDThis (Term s (PDataRecord '["_0" := a]))
- | PDThat (Term s (PDataRecord '["_0" := b]))
- | PDThese (Term s (PDataRecord '["_0" := a, "_1" := b]))
- pthese :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). Term s ((a :--> c) :--> ((b :--> c) :--> ((a :--> (b :--> c)) :--> (PThese a b :--> c))))
- pdthese :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). (PIsData a, PIsData b) => Term s ((a :--> c) :--> ((b :--> c) :--> ((a :--> (b :--> c)) :--> (PDThese a b :--> c))))
- toPDThese :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). (PIsData a, PIsData b) => Term s (PThese a b :--> PDThese a b)
- fromPDThese :: forall (a :: S -> Type) (b :: S -> Type) (s :: S). (PIsData a, PIsData b) => Term s (PDThese a b :--> PThese a b)
Types
data PThese (a :: S -> Type) (b :: S -> Type) (s :: S) Source #
A data type which contains an a
, a b
, or both. This uses a
Scott-encoded representation.
Since: 1.0.0
Instances
data PDThese (a :: S -> Type) (b :: S -> Type) (s :: S) Source #
PDThis (Term s (PDataRecord '["_0" := a])) | |
PDThat (Term s (PDataRecord '["_0" := b])) | |
PDThese (Term s (PDataRecord '["_0" := a, "_1" := b])) |
Instances
Functions
pthese :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). Term s ((a :--> c) :--> ((b :--> c) :--> ((a :--> (b :--> c)) :--> (PThese a b :--> c)))) Source #
Case analysis for PThese
.
Since: 1.0.0
pdthese :: forall (a :: S -> Type) (b :: S -> Type) (c :: S -> Type) (s :: S). (PIsData a, PIsData b) => Term s ((a :--> c) :--> ((b :--> c) :--> ((a :--> (b :--> c)) :--> (PDThese a b :--> c)))) Source #
Case analysis for PDThese
.
Since: 1.0.0