Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- type Indexed t = Indexed' t 0
- type family Infer (s :: *) (a' :: *) (b :: *) :: * where ...
- data PTag = PTag
- type family P :: Nat -> k -> PTag -> k
- type family LookupParam (a :: k) (p :: Nat ) :: Maybe Nat where ...
- type family ArgAt (t :: k) (n :: Nat ) :: j where ...
- type family ArgCount (t :: k) :: Nat where ...
- class UnifyHead (a :: k) (b :: k)
Documentation
type family LookupParam (a :: k) (p :: Nat ) :: Maybe Nat where ... Source #
LookupParam (param (n :: Nat )) m = ' Nothing | |
LookupParam (a (_ (m :: Nat ))) n = IfEq m n (' Just 0) (MaybeAdd ( LookupParam a n) 1) | |
LookupParam (a _) n = MaybeAdd ( LookupParam a n) 1 | |
LookupParam a _ = ' Nothing |
class UnifyHead (a :: k) (b :: k) Source #
Ensure that the types
a
and
b
are both applications of the same
constructor. The arguments may be different.
Instances
a ~ b => UnifyHead (a :: k) (b :: k) Source # | |
Defined in Data.Generics.Internal.Families.Changing |
|
(gb ~ g b, UnifyHead f g) => UnifyHead (f a :: k1) (gb :: k1) Source # | |
Defined in Data.Generics.Internal.Families.Changing |