Safe Haskell | None |
---|---|
Language | Haskell2010 |
End users should not have to manually import this module, since it is re-exported by Data.NamedSOP.Map and Data.NamedSOP.Sum.
In addition to Mapping
and its related singletons, various type
families related to lists are redefined here, since the ones in
Data.Singletons.Prelude.List use local definitions. As of
2019-07, it is
not possible to prove around local definitions that are promoted with
singletons
, so we are stuck redefining them.
Synopsis
- data Mapping k v = k :-> v
- type SMapping = (Sing :: Mapping k v -> Type)
- type family Union (a :: [a]) (a :: [a]) :: [a] where ...
- sUnion :: forall a (t :: [a]) (t :: [a]). SOrd a => Sing t -> Sing t -> Sing (Apply (Apply UnionSym0 t) t :: [a])
- union :: Ord a => [a] -> [a] -> [a]
- type family (a :: [a]) ++ (a :: [a]) :: [a] where ...
- (%++) :: forall a (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (++@#@$) t) t :: [a])
- type family Insert (a :: a) (a :: [a]) :: [a] where ...
- sInsert :: forall a (t :: a) (t :: [a]). SOrd a => Sing t -> Sing t -> Sing (Apply (Apply InsertSym0 t) t :: [a])
- insert :: Ord a => a -> [a] -> [a]
- type family Sort (a :: [a]) :: [a] where ...
- sSort :: forall a (t :: [a]). SOrd a => Sing t -> Sing (Apply SortSym0 t :: [a])
- sort :: Ord a => [a] -> [a]
- class SingI (a :: k)
- data family Sing (a :: k) :: Type
Symbol-value mappings
A type v
with an associated tag k
. Importantly, its
singleton data instance only takes a singleton for the tag k
as
its argmuent, and not one for the value v
.
k :-> v infixr 4 |
Instances
(KnownSymbol k, Show v, Show (NSum xs)) => Show (NSum ((k :-> v) ': xs)) Source # | |
Show (NSum ([] :: [Mapping Symbol Type])) Source # | |
Eq a => Eq (Mapping a b) Source # | |
Ord a => Ord (Mapping a b) Source # | |
Defined in Data.NamedSOP.Type | |
(Show k, Show v) => Show (Mapping k v) Source # | |
SEq k => SEq (Mapping k v) Source # | |
SOrd k => SOrd (Mapping k v) Source # | |
Defined in Data.NamedSOP.Type sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) | |
PEq (Mapping k v) Source # | Equality and ordering on mappings uses only the key. |
Defined in Data.NamedSOP.Type | |
POrd k => POrd (Mapping k v) Source # | |
SingI k2 => SingI (k2 :-> v2 :: Mapping k1 v1) Source # | |
Defined in Data.NamedSOP.Type | |
data Sing (a :: Mapping k v) Source # | |
type (x :: Mapping k v) /= (y :: Mapping k v) Source # | |
Defined in Data.NamedSOP.Type | |
type (arg :: Mapping k v) < (arg1 :: Mapping k v) Source # | |
type (arg :: Mapping k v) <= (arg1 :: Mapping k v) Source # | |
type (arg :: Mapping k v) > (arg1 :: Mapping k v) Source # | |
type (arg :: Mapping k v) >= (arg1 :: Mapping k v) Source # | |
type Max (arg :: Mapping k v) (arg1 :: Mapping k v) Source # | |
type Min (arg :: Mapping k v) (arg1 :: Mapping k v) Source # | |
type (k1 :-> _1 :: Mapping k v) == (k2 :-> _2 :: Mapping k v) Source # | |
Defined in Data.NamedSOP.Type | |
type Compare (k1 :-> _1 :: Mapping k v) (k2 :-> _2 :: Mapping k v) Source # | |
Defined in Data.NamedSOP.Type |
List operation singletons
Unlike the usual definition, this union
does not remove
duplicates, since that would make it impossible to define a
union operation for sums.
type family Union (a :: [a]) (a :: [a]) :: [a] where ... Source #
Union xs ys = Apply SortSym0 (Apply (Apply (++@#@$) xs) ys) |
sUnion :: forall a (t :: [a]) (t :: [a]). SOrd a => Sing t -> Sing t -> Sing (Apply (Apply UnionSym0 t) t :: [a]) Source #
(%++) :: forall a (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply (++@#@$) t) t :: [a]) Source #
sInsert :: forall a (t :: a) (t :: [a]). SOrd a => Sing t -> Sing t -> Sing (Apply (Apply InsertSym0 t) t :: [a]) Source #
Convenience re-exports
sing
Instances
SingI NotSym0 | |
Defined in Data.Singletons.Prelude.Bool | |
SingI (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI Log2Sym0 | |
Defined in Data.Singletons.TypeLits | |
SingI (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal | |
SingI DivSym0 | |
Defined in Data.Singletons.TypeLits | |
SingI ModSym0 | |
Defined in Data.Singletons.TypeLits | |
SingI (^@#@$) | |
Defined in Data.Singletons.TypeLits.Internal | |
SingI AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show | |
SingI AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI UnlinesSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI UnwordsSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI Show_tupleSym0 | |
Defined in Data.Singletons.Prelude.Show | |
SingI ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord | |
SingI EftNatSym0 | |
Defined in Data.Singletons.Prelude.Enum | |
SingI EfdtNatSym0 | |
Defined in Data.Singletons.Prelude.Enum | |
SingI EfdtNatDnSym0 | |
Defined in Data.Singletons.Prelude.Enum | |
SingI EfdtNatUpSym0 | |
Defined in Data.Singletons.Prelude.Enum | |
SingI ShowCommaSpaceSym0 | |
Defined in Data.Singletons.Prelude.Show | |
SingI ShowSpaceSym0 | |
Defined in Data.Singletons.Prelude.Show | |
SingI ShowCharSym0 | |
Defined in Data.Singletons.Prelude.Show | |
SingI ShowStringSym0 | |
Defined in Data.Singletons.Prelude.Show | |
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal | |
SingI x => SingI (DivSym1 x :: TyFun Nat Nat -> Type) | |
Defined in Data.Singletons.TypeLits | |
SingI x => SingI (ModSym1 x :: TyFun Nat Nat -> Type) | |
Defined in Data.Singletons.TypeLits | |
SingI x => SingI ((^@#@$$) x :: TyFun Nat Nat -> Type) | |
Defined in Data.Singletons.TypeLits.Internal | |
SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI (ListtransposeSym0 :: TyFun [[a]] [[a]] -> Type) | |
SingI (TransposeSym0 :: TyFun [[a]] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (ConcatSym0 :: TyFun [[a]] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SShow a => SingI (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (ListtailsSym0 :: TyFun [a] [[a]] -> Type) | |
SNum a => SingI (ListsumSym0 :: TyFun [a] a -> Type) | |
SOrd a => SingI (ListsortSym0 :: TyFun [a] [a] -> Type) | |
SingI (ListreverseSym0 :: TyFun [a] [a] -> Type) | |
SNum a => SingI (ListproductSym0 :: TyFun [a] a -> Type) | |
SingI (ListnullSym0 :: TyFun [a] Bool -> Type) | |
SOrd a => SingI (ListminimumSym0 :: TyFun [a] a -> Type) | |
SOrd a => SingI (ListmaximumSym0 :: TyFun [a] a -> Type) | |
SingI (ListlengthSym0 :: TyFun [a] Nat -> Type) | |
SingI (ListlastSym0 :: TyFun [a] a -> Type) | |
SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
SingI (ListinitsSym0 :: TyFun [a] [[a]] -> Type) | |
SingI (ListinitSym0 :: TyFun [a] [a] -> Type) | |
SingI (ListindexSym0 :: TyFun [a] (Nat ~> a) -> Type) | |
SEq a => SingI ((\\@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (UnionSym0 :: TyFun [a] ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (TailsSym0 :: TyFun [a] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (TailSym0 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SNum a => SingI (SumSym0 :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (SubsequencesSym0 :: TyFun [a] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SOrd a => SingI (SortSym0 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (ReverseSym0 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SNum a => SingI (ProductSym0 :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (PermutationsSym0 :: TyFun [a] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (NubSym0 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (NonEmptySubsequencesSym0 :: TyFun [a] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SOrd a => SingI (MinimumSym0 :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SOrd a => SingI (MaximumSym0 :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (LengthSym0 :: TyFun [a] Nat -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (LastSym0 :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (IntersectSym0 :: TyFun [a] ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (IntercalateSym0 :: TyFun [a] ([[a]] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (InitsSym0 :: TyFun [a] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (InitSym0 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (HeadSym0 :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (GroupSym0 :: TyFun [a] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI ((!!@#@$) :: TyFun [a] (Nat ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SMonoid a => SingI (MconcatSym0 :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SingI d => SingI (EftNatSym1 d :: TyFun Nat [Nat] -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SNum a => SingI (FromIntegerSym0 :: TyFun Nat a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SEnum a => SingI (ToEnumSym0 :: TyFun Nat a -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SingI (ListtakeSym0 :: TyFun Nat ([a] ~> [a]) -> Type) | |
SingI (ListsplitAtSym0 :: TyFun Nat ([a] ~> ([a], [a])) -> Type) | |
SingI (ListdropSym0 :: TyFun Nat ([a] ~> [a]) -> Type) | |
SingI (TakeSym0 :: TyFun Nat ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (SplitAtSym0 :: TyFun Nat ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (DropSym0 :: TyFun Nat ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (EfdtNatSym1 d :: TyFun Nat (Nat ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SingI d => SingI (EfdtNatDnSym1 d :: TyFun Nat (Nat ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SingI d => SingI (EfdtNatUpSym1 d :: TyFun Nat (Nat ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SShow a => SingI (ShowsPrecSym0 :: TyFun Nat (a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI (ReplicateSym0 :: TyFun Nat (a ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (ShowCharSym1 d :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI d => SingI (ShowStringSym1 d :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI d => SingI (Show_tupleSym1 d :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SIsString a => SingI (FromStringSym0 :: TyFun Symbol a -> Type) | |
Defined in Data.Singletons.Prelude.IsString | |
SShow a => SingI (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SShow a => SingI (Show_Sym0 :: TyFun a Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SNum a => SingI (SubtractSym0 :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SNum a => SingI (SignumSym0 :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SNum a => SingI (NegateSym0 :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SNum a => SingI (AbsSym0 :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SNum a => SingI ((-@#@$) :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SNum a => SingI ((+@#@$) :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SNum a => SingI ((*@#@$) :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (ListintersperseSym0 :: TyFun a ([a] ~> [a]) -> Type) | |
SOrd a => SingI (ListinsertSym0 :: TyFun a ([a] ~> [a]) -> Type) | |
SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
SingI (PrependToAllSym0 :: TyFun a ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (IntersperseSym0 :: TyFun a ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SOrd a => SingI (InsertSym0 :: TyFun a ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (ElemIndicesSym0 :: TyFun a ([a] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (DeleteSym0 :: TyFun a ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SEnum a => SingI (SuccSym0 :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SEnum a => SingI (PredSym0 :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SEnum a => SingI (FromEnumSym0 :: TyFun a Nat -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SEnum a => SingI (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SEnum a => SingI (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI (IdSym0 :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI (IdentitySym0 :: TyFun a (Identity a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI ((:|@#@$) :: TyFun a ([a] ~> NonEmpty a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SOrd a => SingI (MinSym0 :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SOrd a => SingI (MaxSym0 :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SingI (DownSym0 :: TyFun a (Down a) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SingI (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (SumSym0 :: TyFun a (Sum a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (ProductSym0 :: TyFun a (Product a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (MinSym0 :: TyFun a (Min a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (MaxSym0 :: TyFun a (Max a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (LastSym0 :: TyFun a (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (FirstSym0 :: TyFun a (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI (DualSym0 :: TyFun a (Dual a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SSemigroup a => SingI ((<>@#@$) :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SMonoid a => SingI (MappendSym0 :: TyFun a (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
SSemigroup a => SingI (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI d => SingI (ShowParenSym1 d :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI (ShowListWithSym0 :: TyFun (a ~> (Symbol ~> Symbol)) ([a] ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
SingI (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
SingI (Listscanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) | |
SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
SingI (Listfoldr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) | |
SingI (Listfoldl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) | |
SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Foldl1'Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI (IntercalateSym1 d :: TyFun [[a]] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI (ListunzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) | |
SingI (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (ShowListWithSym1 d :: TyFun [a] (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI (ListzipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) | |
SingI d => SingI (ListtakeWhileSym1 d :: TyFun [a] [a] -> Type) | |
SingI d => SingI (ListtakeSym1 d a :: TyFun [a] [a] -> Type) | |
SingI d => SingI (ListsplitAtSym1 d a :: TyFun [a] ([a], [a]) -> Type) | |
SingI d => SingI (ListspanSym1 d :: TyFun [a] ([a], [a]) -> Type) | |
SingI d => SingI (ListsortBySym1 d :: TyFun [a] [a] -> Type) | |
SingI d => SingI (Listscanr1Sym1 d :: TyFun [a] [a] -> Type) | |
SingI d => SingI (ListpartitionSym1 d :: TyFun [a] ([a], [a]) -> Type) | |
SingI d => SingI (ListnubBySym1 d :: TyFun [a] [a] -> Type) | |
(SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
SingI d => SingI (ListintersperseSym1 d :: TyFun [a] [a] -> Type) | |
(SOrd a, SingI d) => SingI (ListinsertSym1 d :: TyFun [a] [a] -> Type) | |
SingI d => SingI (Listfoldr1Sym1 d :: TyFun [a] a -> Type) | |
SingI d => SingI (Listfoldl1Sym1 d :: TyFun [a] a -> Type) | |
SingI d => SingI (ListfilterSym1 d :: TyFun [a] [a] -> Type) | |
(SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type) | |
SingI d => SingI (ListdropWhileSym1 d :: TyFun [a] [a] -> Type) | |
SingI d => SingI (ListdropSym1 d a :: TyFun [a] [a] -> Type) | |
(SEq a, SingI d) => SingI ((\\@#@$$) d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (UnionSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (UnionBySym1 d :: TyFun [a] ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (TakeWhileSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (TakeSym1 d a :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (SplitAtSym1 d a :: TyFun [a] ([a], [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (SpanSym1 d :: TyFun [a] ([a], [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (SortBySym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Scanr1Sym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Scanl1Sym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (PrependToAllSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (PartitionSym1 d :: TyFun [a] ([a], [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (NubBySym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (MinimumBySym1 d :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (MaximumBySym1 d :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (IntersperseSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (IntersectSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (IntersectBySym1 d :: TyFun [a] ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SOrd a, SingI d) => SingI (InsertSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (GroupBySym1 d :: TyFun [a] [[a]] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SNum i => SingI (GenericLengthSym0 :: TyFun [a] i -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Foldr1Sym1 d :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Foldl1Sym1 d :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Foldl1'Sym1 d :: TyFun [a] a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (FindIndicesSym1 d :: TyFun [a] [Nat] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (FilterSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (ElemIndicesSym1 d :: TyFun [a] [Nat] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (DropWhileSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (DropWhileEndSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (DropSym1 d a :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SEq a, SingI d) => SingI (DeleteSym1 d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (DeleteFirstsBySym1 d :: TyFun [a] ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (BreakSym1 d :: TyFun [a] ([a], [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI ((++@#@$$) d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI ((:|@#@$$) d :: TyFun [a] (NonEmpty a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d => SingI ((:@#@$$) d :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
(SingI d1, SingI d2) => SingI (EfdtNatSym2 d1 d2 :: TyFun Nat [Nat] -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
(SingI d1, SingI d2) => SingI (EfdtNatDnSym2 d1 d2 :: TyFun Nat [Nat] -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
(SingI d1, SingI d2) => SingI (EfdtNatUpSym2 d1 d2 :: TyFun Nat [Nat] -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SingI d => SingI (ListindexSym1 d :: TyFun Nat a -> Type) | |
SingI d => SingI ((!!@#@$$) d :: TyFun Nat a -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (ShowParenSym2 d1 d2 :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
(SShow a, SingI d) => SingI (ShowListSym1 d :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
(SShow a, SingI d) => SingI (ShowsSym1 d :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SingI (ErrorWithoutStackTraceSym0 :: TyFun Symbol a -> Type) | |
Defined in Data.Singletons.TypeLits.Internal | |
SingI (ErrorSym0 :: TyFun Symbol a -> Type) | |
Defined in Data.Singletons.TypeLits.Internal | |
SingI (SwapSym0 :: TyFun (a, b) (b, a) -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
SingI (SndSym0 :: TyFun (a, b) b -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
SingI (FstSym0 :: TyFun (a, b) a -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
(SShow a, SingI d) => SingI (ShowsPrecSym1 d a :: TyFun a (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
(SNum a, SingI d) => SingI (SubtractSym1 d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
(SNum a, SingI d) => SingI ((-@#@$$) d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
(SNum a, SingI d) => SingI ((+@#@$$) d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
(SNum a, SingI d) => SingI ((*@#@$$) d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Num | |
(SApplicative f, SingI d) => SingI (WhenSym1 d f :: TyFun (f ()) (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SMonad m => SingI (ReturnSym0 :: TyFun a (m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI (PureSym0 :: TyFun a (f a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SMonad m => SingI (JoinSym0 :: TyFun (m (m a)) (m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI d => SingI (SelectSym1 d :: TyFun a (([a], [a]) ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (ReplicateSym1 d a :: TyFun a [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (InsertBySym1 d :: TyFun a ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (DeleteBySym1 d :: TyFun a ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SFoldable t => SingI (ToListSym0 :: TyFun (t a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SNum a) => SingI (SumSym0 :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SNum a) => SingI (ProductSym0 :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SOrd a) => SingI (MinimumSym0 :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SOrd a) => SingI (MaximumSym0 :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonoid m) => SingI (FoldSym0 :: TyFun (t m) m -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (ConcatSym0 :: TyFun (t [a]) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SEnum a, SingI d) => SingI (EnumFromToSym1 d :: TyFun a [a] -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
(SEnum a, SingI d) => SingI (EnumFromThenToSym1 d :: TyFun a (a ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI (SeqSym0 :: TyFun a (b ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (ConstSym0 :: TyFun a (b ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI (AsTypeOfSym1 d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
(SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
(SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
SingI (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SOrd a, SingI d) => SingI (MinSym1 d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SOrd a, SingI d) => SingI (MaxSym1 d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SSemigroup a, SingI d) => SingI ((<>@#@$$) d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
(SMonoid a, SingI d) => SingI (MappendSym1 d :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
SFunctor f => SingI (VoidSym0 :: TyFun (f a) (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Functor | |
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative | |
SingI (Option_Sym0 :: TyFun b ((a ~> b) ~> (Option a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
SingI (ArgSym0 :: TyFun a (b ~> Arg a b) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (ListscanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) | |
SingI (ListscanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) | |
SingI (ListmapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) | |
SingI (ListfoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> b)) -> Type) | |
SingI (ListfoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type) | |
SingI (Listfoldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type) | |
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (ConcatMapSym0 :: TyFun (a ~> [b]) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI d => SingI (UntilSym1 d :: TyFun (a ~> a) (a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SingI (ConstSym0 :: TyFun a6989586621679095402 (Const a6989586621679095402 b6989586621679095403) -> Type) | |
Defined in Data.Singletons.Prelude.Const | |
(SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
(SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Unzip3Sym0 :: TyFun [(a, b, c)] ([a], [b], [c]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (MapMaybeSym1 d :: TyFun [a] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI d => SingI (ListzipSym1 d b :: TyFun [b] [(a, b)] -> Type) | |
SingI d => SingI (ListmapSym1 d :: TyFun [a] [b] -> Type) | |
SingI d => SingI (ZipSym1 d b :: TyFun [b] [(a, b)] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (UnionBySym2 d1 d2 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (IntersectBySym2 d1 d2 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (InsertBySym2 d1 d2 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (DeleteFirstsBySym2 d1 d2 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (DeleteBySym2 d1 d2 :: TyFun [a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (ConcatMapSym1 d :: TyFun [a] [b] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (MapSym1 d :: TyFun [a] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
(SShow a, SingI d1, SingI d2) => SingI (ShowsPrecSym2 d1 d2 :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
(SingI d1, SingI d2) => SingI (ShowListWithSym2 d1 d2 :: TyFun Symbol Symbol -> Type) | |
Defined in Data.Singletons.Prelude.Show | |
SMonad m => SingI (FailSym0 :: TyFun Symbol (m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SingI d1, SingI d2) => SingI (SelectSym2 d1 d2 :: TyFun ([a], [a]) ([a], [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(STraversable t, SMonad m) => SingI (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SApplicative f) => SingI (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
SMonadPlus m => SingI (MplusSym0 :: TyFun (m a) (m a ~> m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SMonad m => SingI (ApSym0 :: TyFun (m (a ~> b)) (m a ~> m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SMonad m => SingI ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SAlternative f => SingI ((<|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI ((<**>@#@$) :: TyFun (f a) (f (a ~> b) ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SFunctor f => SingI ((<$@#@$) :: TyFun a (f b ~> f a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI d => SingI (ListscanrSym1 d :: TyFun b ([a] ~> [b]) -> Type) | |
SingI d => SingI (ListscanlSym1 d :: TyFun b ([a] ~> [b]) -> Type) | |
SingI d => SingI (ListfoldrSym1 d :: TyFun b ([a] ~> b) -> Type) | |
SingI d => SingI (ListfoldlSym1 d :: TyFun b ([a] ~> b) -> Type) | |
SingI d => SingI (Listfoldl'Sym1 d :: TyFun b ([a] ~> b) -> Type) | |
SingI d => SingI (UnfoldrSym1 d :: TyFun b [a] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (ScanrSym1 d :: TyFun b ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (ScanlSym1 d :: TyFun b ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Foldl'Sym1 d :: TyFun b ([a] ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SFoldable t, SMonad m) => SingI (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SApplicative f) => SingI (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (MinimumBySym1 d t :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (MaximumBySym1 d t :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (LengthSym0 :: TyFun (t a) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (Foldr1Sym1 d t :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (Foldl1Sym1 d t :: TyFun (t a) a -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (AnySym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (AllSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SEnum a, SingI d1, SingI d2) => SingI (EnumFromThenToSym2 d1 d2 :: TyFun a [a] -> Type) | |
Defined in Data.Singletons.Prelude.Enum | |
(SingI d1, SingI d2) => SingI (UntilSym2 d1 d2 :: TyFun a a -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI (SeqSym1 d b :: TyFun b b -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI (FoldrSym1 d :: TyFun b ([a] ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI (ConstSym1 d b :: TyFun b a -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI (($@#@$$) d :: TyFun a b -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI d => SingI (($!@#@$$) d :: TyFun a b -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d => SingI (Tuple2Sym1 d b :: TyFun b (a, b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d => SingI (FoldlSym1 d :: TyFun b ([a] ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
SFunctor f => SingI ((<&>@#@$) :: TyFun (f a) ((a ~> b) ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Functor | |
SFunctor f => SingI (($>@#@$) :: TyFun (f a) (b ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Functor | |
SingI d => SingI (ArgSym1 d b :: TyFun b (Arg a b) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
SingI (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
SingI (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
(STraversable t, SMonoid m) => SingI (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
STraversable t => SingI (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
SMonad m => SingI (LiftMSym0 :: TyFun (a1 ~> r) (m a1 ~> m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI (LiftASym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SFunctor f => SingI (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SMonad m => SingI ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI (ListzipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) | |
SingI (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (MapAccumRSym0 :: TyFun (acc ~> (x ~> (acc, y))) (acc ~> ([x] ~> (acc, [y]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (MapAccumLSym0 :: TyFun (acc ~> (x ~> (acc, y))) (acc ~> ([x] ~> (acc, [y]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SFoldable t => SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonoid m) => SingI (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SFoldable t => SingI (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SFunctor f => SingI ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Functor | |
SingI d => SingI (Option_Sym1 d a :: TyFun (a ~> b) (Option a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
SingI (Unzip4Sym0 :: TyFun [(a, b, c, d)] ([a], [b], [c], [d]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (ListzipWithSym1 d :: TyFun [a] ([b] ~> [c]) -> Type) | |
(SingI d1, SingI d2) => SingI (ListscanrSym2 d1 d2 :: TyFun [a] [b] -> Type) | |
(SingI d1, SingI d2) => SingI (ListscanlSym2 d1 d2 :: TyFun [a] [b] -> Type) | |
(SingI d1, SingI d2) => SingI (ListfoldrSym2 d1 d2 :: TyFun [a] b -> Type) | |
(SingI d1, SingI d2) => SingI (ListfoldlSym2 d1 d2 :: TyFun [a] b -> Type) | |
(SingI d1, SingI d2) => SingI (Listfoldl'Sym2 d1 d2 :: TyFun [a] b -> Type) | |
SingI d => SingI (ZipWithSym1 d :: TyFun [a] ([b] ~> [c]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (Zip3Sym1 d b c :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (ScanrSym2 d1 d2 :: TyFun [a] [b] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (ScanlSym2 d1 d2 :: TyFun [a] [b] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (Foldl'Sym2 d1 d2 :: TyFun [a] b -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun [a] b -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
(SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun [a] b -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe | |
SingI d => SingI (UncurrySym1 d :: TyFun (a, b) c -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
SingI d => SingI (CurrySym1 d :: TyFun a (b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
(STraversable t, SApplicative f) => SingI (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SMonad m) => SingI (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SMonoid m, SingI d) => SingI (FoldMapDefaultSym1 d t :: TyFun (t a) m -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SingI d) => SingI (FmapDefaultSym1 d t :: TyFun (t a) (t b) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(SMonadPlus m, SingI d) => SingI (MplusSym1 d :: TyFun (m a) (m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d) => SingI (LiftMSym1 d m :: TyFun (m a1) (m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d) => SingI (LiftASym1 d f :: TyFun (f a) (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SFunctor f, SingI d) => SingI (FmapSym1 d f :: TyFun (f a) (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d) => SingI (ApSym1 d :: TyFun (m a) (m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SMonad m => SingI ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d) => SingI ((=<<@#@$$) d :: TyFun (m a) (m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SAlternative f, SingI d) => SingI ((<|>@#@$$) d :: TyFun (f a) (f a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d) => SingI ((<*>@#@$$) d :: TyFun (f a) (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d) => SingI (d <**>@#@$$ b :: TyFun (f (a ~> b)) (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SFunctor f, SingI d) => SingI ((d <$@#@$$ b) f :: TyFun (f b) (f a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI d => SingI (MapAccumRSym1 d :: TyFun acc ([x] ~> (acc, [y])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d => SingI (MapAccumLSym1 d :: TyFun acc ([x] ~> (acc, [y])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SFoldable t, SMonadPlus m) => SingI (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SApplicative f) => SingI (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m) => SingI (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (FoldrSym1 d t :: TyFun b (t a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (Foldr'Sym1 d t :: TyFun b (t a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (FoldlSym1 d t :: TyFun b (t a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (Foldl'Sym1 d t :: TyFun b (t a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d t :: TyFun (t a) m -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (ConcatMapSym1 d t :: TyFun (t a) [b] -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SAlternative f) => SingI (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI d => SingI (FlipSym1 d :: TyFun b (a ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d => SingI (Tuple3Sym1 d b c :: TyFun b (c ~> (a, b, c)) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SOrd a, SingI d1, SingI d2) => SingI (ComparingSym2 d1 d2 :: TyFun b Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
(SFunctor f, SingI d) => SingI (d <$>@#@$$ f :: TyFun (f a) (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Functor | |
(SFunctor f, SingI d) => SingI (d $>@#@$$ b :: TyFun b (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Functor | |
(SingI d1, SingI d2) => SingI (Option_Sym2 d1 d2 :: TyFun (Option a) b -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
(STraversable t, SApplicative f) => SingI (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SMonad m) => SingI (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
STraversable t => SingI (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
STraversable t => SingI (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
SMonad m => SingI (LiftM2Sym0 :: TyFun (a1 ~> (a2 ~> r)) (m a1 ~> (m a2 ~> m r)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d) => SingI (d >>=@#@$$ b :: TyFun (a ~> m b) (m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SFoldable t, SApplicative f) => SingI (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m) => SingI (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m) => SingI (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m) => SingI (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
SingI d => SingI (d .@#@$$ a :: TyFun (a ~> b) (a ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
(SFunctor f, SingI d) => SingI (d <&>@#@$$ b :: TyFun (a ~> b) (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Functor | |
SingI k2 => SingI (k2 :-> v2 :: Mapping k1 v1) Source # | |
Defined in Data.NamedSOP.Type | |
SingI (Unzip5Sym0 :: TyFun [(a, b, c, d, e)] ([a], [b], [c], [d], [e]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (ListzipWithSym2 d1 d2 :: TyFun [b] [c] -> Type) | |
(SingI d1, SingI d2) => SingI (ZipWithSym2 d1 d2 :: TyFun [b] [c] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI d2 => SingI (ZipWith3Sym1 d2 :: TyFun [a] ([b] ~> ([c] ~> [d1])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (Zip3Sym2 d1 d2 c :: TyFun [c] [(a, b, c)] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (MapAccumRSym2 d1 d2 :: TyFun [x] (acc, [y]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (MapAccumLSym2 d1 d2 :: TyFun [x] (acc, [y]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
(SingI d1, SingI d2) => SingI (CurrySym2 d1 d2 :: TyFun b c -> Type) | |
Defined in Data.Singletons.Prelude.Tuple | |
(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d t :: TyFun (t a) (f (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SMonad m, SingI d) => SingI (MapMSym1 d t :: TyFun (t a) (m (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SingI d) => SingI (MapAccumRSym1 d t :: TyFun a (t b ~> (a, t c)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SingI d) => SingI (MapAccumLSym1 d t :: TyFun a (t b ~> (a, t c)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(SMonad m, SingI d) => SingI (LiftM2Sym1 d m :: TyFun (m a1) (m a2 ~> m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d) => SingI (LiftA2Sym1 d f :: TyFun (f a) (f b ~> f c) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d) => SingI (d >>@#@$$ b :: TyFun (m b) (m b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d) => SingI (d <*@#@$$ b :: TyFun (f b) (f a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d) => SingI (d *>@#@$$ b :: TyFun (f b) (f b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SFoldable t, SApplicative f, SingI d) => SingI (Traverse_Sym1 d t :: TyFun (t a) (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m, SingI d) => SingI (MapM_Sym1 d t :: TyFun (t a) (m ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 t :: TyFun (t a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m, SingI d) => SingI (FoldrMSym1 d t :: TyFun b (t a ~> m b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d1, SingI d2) => SingI (Foldr'Sym2 d1 d2 t :: TyFun (t a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 t :: TyFun (t a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m, SingI d) => SingI (FoldlMSym1 d t :: TyFun b (t a ~> m b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d1, SingI d2) => SingI (Foldl'Sym2 d1 d2 t :: TyFun (t a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SingI d1, SingI d2) => SingI (FlipSym2 d1 d2 :: TyFun a c -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
(SingI d1, SingI d2) => SingI (d1 .@#@$$$ d2 :: TyFun a c -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
SingI (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d2 => SingI (Tuple4Sym1 d2 b c d1 :: TyFun b (c ~> (d1 ~> (a, b, c, d1))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d1, SingI d2) => SingI (Tuple3Sym2 d1 d2 c :: TyFun c (a, b, c) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(STraversable t, SApplicative f, SingI d) => SingI (ForSym1 d b f :: TyFun (a ~> f b) (f (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SMonad m, SingI d) => SingI (ForMSym1 d b m :: TyFun (a ~> m b) (m (t b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
SMonad m => SingI (LiftM3Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> r))) (m a1 ~> (m a2 ~> (m a3 ~> m r))) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI (LiftA3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) (f a ~> (f b ~> (f c ~> f d))) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SFoldable t, SApplicative f, SingI d) => SingI (For_Sym1 d b f :: TyFun (a ~> f b) (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m, SingI d) => SingI (ForM_Sym1 d b m :: TyFun (a ~> m b) (m ()) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI (Unzip6Sym0 :: TyFun [(a, b, c, d, e, f)] ([a], [b], [c], [d], [e], [f]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d2, SingI d3) => SingI (ZipWith3Sym2 d2 d3 :: TyFun [b] ([c] ~> [d1]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumRSym2 d1 d2 t :: TyFun (t b) (a, t c) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumLSym2 d1 d2 t :: TyFun (t b) (a, t c) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable | |
(SMonad m, SingI d) => SingI (LiftM3Sym1 d m :: TyFun (m a1) (m a2 ~> (m a3 ~> m r)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d1, SingI d2) => SingI (LiftM2Sym2 d1 d2 :: TyFun (m a2) (m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d2) => SingI (LiftA3Sym1 d2 f :: TyFun (f a) (f b ~> (f c ~> f d1)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d1, SingI d2) => SingI (LiftA2Sym2 d1 d2 :: TyFun (f b) (f c) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldrMSym2 d1 d2 t :: TyFun (t a) (m b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldlMSym2 d1 d2 t :: TyFun (t a) (m b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d2 => SingI (Tuple5Sym1 d2 b c d1 e :: TyFun b (c ~> (d1 ~> (e ~> (a, b, c, d1, e)))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3) => SingI (Tuple4Sym2 d2 d3 c d1 :: TyFun c (d1 ~> (a, b, c, d1)) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SMonad m => SingI (LiftM4Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> (a4 ~> r)))) (m a1 ~> (m a2 ~> (m a3 ~> (m a4 ~> m r)))) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI (Unzip7Sym0 :: TyFun [(a, b, c, d, e, f, g)] ([a], [b], [c], [d], [e], [f], [g]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SingI d2, SingI d3, SingI d4) => SingI (ZipWith3Sym3 d2 d3 d4 :: TyFun [c] [d1] -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SMonad m, SingI d) => SingI (LiftM4Sym1 d m :: TyFun (m a1) (m a2 ~> (m a3 ~> (m a4 ~> m r))) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d1, SingI d2) => SingI (LiftM3Sym2 d1 d2 :: TyFun (m a2) (m a3 ~> m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d2, SingI d3) => SingI (LiftA3Sym2 d2 d3 :: TyFun (f b) (f c ~> f d1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI d2 => SingI (Tuple6Sym1 d2 b c d1 e f :: TyFun b (c ~> (d1 ~> (e ~> (f ~> (a, b, c, d1, e, f))))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3) => SingI (Tuple5Sym2 d2 d3 c d1 e :: TyFun c (d1 ~> (e ~> (a, b, c, d1, e))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3, SingI d4) => SingI (Tuple4Sym3 d2 d3 d4 d1 :: TyFun d1 (a, b, c, d1) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SMonad m => SingI (LiftM5Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> r))))) (m a1 ~> (m a2 ~> (m a3 ~> (m a4 ~> (m a5 ~> m r))))) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d) => SingI (LiftM5Sym1 d m :: TyFun (m a1) (m a2 ~> (m a3 ~> (m a4 ~> (m a5 ~> m r)))) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d1, SingI d2) => SingI (LiftM4Sym2 d1 d2 :: TyFun (m a2) (m a3 ~> (m a4 ~> m r)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d1, SingI d2, SingI d3) => SingI (LiftM3Sym3 d1 d2 d3 :: TyFun (m a3) (m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SApplicative f, SingI d2, SingI d3, SingI d4) => SingI (LiftA3Sym3 d2 d3 d4 :: TyFun (f c) (f d1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI d2 => SingI (Tuple7Sym1 d2 b c d1 e f g :: TyFun b (c ~> (d1 ~> (e ~> (f ~> (g ~> (a, b, c, d1, e, f, g)))))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3) => SingI (Tuple6Sym2 d2 d3 c d1 e f :: TyFun c (d1 ~> (e ~> (f ~> (a, b, c, d1, e, f)))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3, SingI d4) => SingI (Tuple5Sym3 d2 d3 d4 d1 e :: TyFun d1 (e ~> (a, b, c, d1, e)) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SMonad m, SingI d1, SingI d2) => SingI (LiftM5Sym2 d1 d2 :: TyFun (m a2) (m a3 ~> (m a4 ~> (m a5 ~> m r))) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d1, SingI d2, SingI d3) => SingI (LiftM4Sym3 d1 d2 d3 :: TyFun (m a3) (m a4 ~> m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SingI d2, SingI d3) => SingI (Tuple7Sym2 d2 d3 c d1 e f g :: TyFun c (d1 ~> (e ~> (f ~> (g ~> (a, b, c, d1, e, f, g))))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3, SingI d4) => SingI (Tuple6Sym3 d2 d3 d4 d1 e f :: TyFun d1 (e ~> (f ~> (a, b, c, d1, e, f))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3, SingI d4, SingI d5) => SingI (Tuple5Sym4 d2 d3 d4 d5 e :: TyFun e (a, b, c, d1, e) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SMonad m, SingI d1, SingI d2, SingI d3) => SingI (LiftM5Sym3 d1 d2 d3 :: TyFun (m a3) (m a4 ~> (m a5 ~> m r)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SMonad m, SingI d1, SingI d2, SingI d3, SingI d4) => SingI (LiftM4Sym4 d1 d2 d3 d4 :: TyFun (m a4) (m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SingI d2, SingI d3, SingI d4) => SingI (Tuple7Sym3 d2 d3 d4 d1 e f g :: TyFun d1 (e ~> (f ~> (g ~> (a, b, c, d1, e, f, g)))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3, SingI d4, SingI d5) => SingI (Tuple6Sym4 d2 d3 d4 d5 e f :: TyFun e (f ~> (a, b, c, d1, e, f)) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SMonad m, SingI d1, SingI d2, SingI d3, SingI d4) => SingI (LiftM5Sym4 d1 d2 d3 d4 :: TyFun (m a4) (m a5 ~> m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SingI d2, SingI d3, SingI d4, SingI d5) => SingI (Tuple7Sym4 d2 d3 d4 d5 e f g :: TyFun e (f ~> (g ~> (a, b, c, d1, e, f, g))) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3, SingI d4, SingI d5, SingI d6) => SingI (Tuple6Sym5 d2 d3 d4 d5 d6 f :: TyFun f (a, b, c, d1, e, f) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SMonad m, SingI d1, SingI d2, SingI d3, SingI d4, SingI d5) => SingI (LiftM5Sym5 d1 d2 d3 d4 d5 :: TyFun (m a5) (m r) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
(SingI d2, SingI d3, SingI d4, SingI d5, SingI d6) => SingI (Tuple7Sym5 d2 d3 d4 d5 d6 f g :: TyFun f (g ~> (a, b, c, d1, e, f, g)) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(SingI d2, SingI d3, SingI d4, SingI d5, SingI d6, SingI d7) => SingI (Tuple7Sym6 d2 d3 d4 d5 d6 d7 g :: TyFun g (a, b, c, d1, e, f, g) -> Type) | |
Defined in Data.Singletons.Prelude.Instances |
data family Sing (a :: k) :: Type #
Instances
data Sing (a :: Bool) | |
data Sing (a :: Ordering) | |
data Sing (n :: Nat) | |
data Sing (n :: Symbol) | |
Defined in Data.Singletons.TypeLits.Internal | |
data Sing (a :: ()) | |
Defined in Data.Singletons.Prelude.Instances | |
data Sing (a :: Void) | |
Defined in Data.Singletons.Prelude.Instances | |
data Sing (a :: All) | |
data Sing (a :: Any) | |
data Sing (b :: [a]) | |
data Sing (b :: Maybe a) | |
data Sing (b :: Min a) | |
data Sing (b :: Max a) | |
data Sing (b :: First a) | |
data Sing (b :: Last a) | |
data Sing (a :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal data Sing (a :: WrappedMonoid m) where
| |
data Sing (b :: Option a) | |
data Sing (b :: Identity a) | |
data Sing (b :: First a) | |
data Sing (b :: Last a) | |
data Sing (b :: Dual a) | |
data Sing (b :: Sum a) | |
data Sing (b :: Product a) | |
data Sing (b :: Down a) | |
data Sing (b :: NonEmpty a) | |
data Sing (b :: Endo a) | |
Defined in Data.Singletons.Prelude.Foldable | |
data Sing (b :: MinInternal a) | |
Defined in Data.Singletons.Prelude.Foldable data Sing (b :: MinInternal a) where
| |
data Sing (b :: MaxInternal a) | |
Defined in Data.Singletons.Prelude.Foldable data Sing (b :: MaxInternal a) where
| |
data Sing (c :: Either a b) | |
data Sing (c :: (a, b)) | |
data Sing (c :: Arg a b) | |
newtype Sing (f :: k1 ~> k2) | |
data Sing (a :: Mapping k v) Source # | |
data Sing (b :: StateL s a) | |
Defined in Data.Singletons.Prelude.Traversable | |
data Sing (b :: StateR s a) | |
Defined in Data.Singletons.Prelude.Traversable | |
data Sing (d :: (a, b, c)) | |
data Sing (c :: Const a b) | |
data Sing (e :: (a, b, c, d)) | |
data Sing (f :: (a, b, c, d, e)) | |
data Sing (g :: (a, b, c, d, e, f)) | |
Defined in Data.Singletons.Prelude.Instances | |
data Sing (h :: (a, b, c, d, e, f, g)) | |
Defined in Data.Singletons.Prelude.Instances |