Safe Haskell | None |
---|---|
Language | Haskell2010 |
Re-exports typed Value, CValue, some core types, some helpers and defines aliases for constructors of typed values.
Synopsis
- type Value = Value' Instr
- class WellTypedToT a => IsoValue a where
- type WellTypedIsoValue a = (WellTyped (ToT a), IsoValue a)
- data Integer
- data Natural
- data MText
- data Bool
- data ByteString
- data Address
- data EpAddress = EpAddress {}
- data Mutez
- data Never
- data Timestamp
- data ChainId
- data KeyHash
- data PublicKey
- data Signature
- data Bls12381Fr
- data Bls12381G1
- data Bls12381G2
- data Set a
- data Map k a
- newtype BigMapId (k2 :: k) (v :: k1) = BigMapId {}
- data BigMap k v
- mkBigMap :: ToBigMap m => m -> BigMap (ToBigMapKey m) (ToBigMapValue m)
- type Operation = Operation' Instr
- data Maybe a
- type List = []
- data ReadTicket a = ReadTicket {
- rtTicketer :: Address
- rtData :: a
- rtAmount :: Natural
- data ContractRef arg = ContractRef {
- crAddress :: Address
- crEntrypoint :: SomeEntrypointCall arg
- newtype TAddress (p :: Type) (vd :: Type) = TAddress {}
- newtype FutureContract arg = FutureContract {
- unFutureContract :: ContractRef arg
- data Ticket arg = Ticket {}
- data Chest
- data ChestKey
- data OpenChest
- data EpName
- pattern DefEpName :: EpName
- type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg)
- type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg)
- newtype Fixed (a :: k) = MkFixed Integer
- newtype NFixed p = MkNFixed Natural
- data DecBase p where
- data BinBase p where
- toMutez :: Word32 -> Mutez
- zeroMutez :: Mutez
- oneMutez :: Mutez
- mt :: QuasiQuoter
- timestampFromSeconds :: Integer -> Timestamp
- timestampFromUTCTime :: UTCTime -> Timestamp
- timestampQuote :: QuasiQuoter
- coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b
- callingAddress :: forall cp vd addr mname. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname)
- callingDefAddress :: forall cp vd addr. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> ContractRef (GetDefaultEntrypointArg cp)
- callingTAddress :: forall cp vd mname. NiceParameterFull cp => TAddress cp vd -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname)
- callingDefTAddress :: forall cp vd. NiceParameterFull cp => TAddress cp vd -> ContractRef (GetDefaultEntrypointArg cp)
- class ToAddress a where
- class ToTAddress (cp :: Type) (vd :: Type) (a :: Type) where
- toTAddress :: a -> TAddress cp vd
- class ToContractRef (cp :: Type) (contract :: Type) where
- toContractRef :: HasCallStack => contract -> ContractRef cp
- class FromContractRef (cp :: Type) (contract :: Type) where
- fromContractRef :: ContractRef cp -> contract
- convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2
- class Show a
- class Default a where
- def :: a
- data Label (name :: Symbol) where
- Label :: forall (name :: Symbol). KnownSymbol name => Label name
- newtype PrintAsValue a = PrintAsValue a
Documentation
class WellTypedToT a => IsoValue a where #
Nothing
Instances
type WellTypedIsoValue a = (WellTyped (ToT a), IsoValue a) #
Primitive types
Arbitrary precision integers. In contrast with fixed-size integral types
such as Int
, the Integer
type represents the entire infinite range of
integers.
For more information about this type's representation, see the comments in its implementation.
Instances
Type representing arbitrary-precision non-negative integers.
>>>
2^100 :: Natural
1267650600228229401496703205376
Operations whose result would be negative
,throw
(Underflow
:: ArithException
)
>>>
-1 :: Natural
*** Exception: arithmetic underflow
Since: base-4.8.0.0
Instances
Instances
Instances
Bounded Bool | Since: base-2.1 |
Enum Bool | Since: base-2.1 |
Eq Bool | |
Ord Bool | |
Read Bool | Since: base-2.1 |
Show Bool | Since: base-2.1 |
Generic Bool | Since: base-4.6.0.0 |
UniformRange Bool | |
Defined in System.Random.Internal | |
Uniform Bool | |
Defined in System.Random.Internal uniformM :: StatefulGen g m => g -> m Bool # | |
Hashable Bool | |
Defined in Data.Hashable.Class | |
ToJSON Bool | |
Defined in Data.Aeson.Types.ToJSON | |
ToJSONKey Bool | |
Defined in Data.Aeson.Types.ToJSON | |
Storable Bool | Since: base-2.1 |
Defined in Foreign.Storable | |
NFData Bool | |
Defined in Control.DeepSeq | |
Buildable Bool | |
Defined in Formatting.Buildable | |
Unbox Bool | |
Defined in Data.Vector.Unboxed.Base | |
Semiring Bool | |
PShow Bool | |
SShow Bool | |
Defined in Data.Singletons.Prelude.Show sShowsPrec :: forall (t1 :: Nat) (t2 :: Bool) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Bool). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Bool]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
PEnum Bool | |
Defined in Data.Singletons.Prelude.Enum | |
SEnum Bool | |
Defined in Data.Singletons.Prelude.Enum sSucc :: forall (t :: Bool). Sing t -> Sing (Apply SuccSym0 t) # sPred :: forall (t :: Bool). Sing t -> Sing (Apply PredSym0 t) # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: forall (t :: Bool). Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: forall (t1 :: Bool) (t2 :: Bool) (t3 :: Bool). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) # | |
PBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
SBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
POrd Bool | |
SOrd Bool | |
Defined in Data.Singletons.Prelude.Ord sCompare :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
SEq Bool | |
PEq Bool | |
Pretty Bool | |
Defined in Text.PrettyPrint.Leijen.Text | |
Boolean Bool | |
SingKind Bool | Since: base-4.9.0.0 |
Defined in GHC.Generics type DemoteRep Bool | |
TypeHasDoc Bool | |
Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions Bool :: FieldDescriptions # typeDocName :: Proxy Bool -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Bool -> WithinParens -> Markdown # typeDocDependencies :: Proxy Bool -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Bool # typeDocMichelsonRep :: TypeDocMichelsonRep Bool # | |
IsoValue Bool | |
HasAnnotation Bool Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT Bool) Source # | |
Lift Bool | |
TestCoercion SBool | |
Defined in Data.Singletons.Prelude.Instances | |
TestEquality SBool | |
Defined in Data.Singletons.Prelude.Instances | |
Vector Vector Bool | |
Defined in Data.Vector.Unboxed.Base basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) # basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () # | |
MVector MVector Bool | |
Defined in Data.Vector.Unboxed.Base basicLength :: MVector s Bool -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool # basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) # | |
SingI 'False | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
SingI 'True | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
UnaryArithOpHs Not Bool Source # | |
Defined in Lorentz.Arith type UnaryArithResHs Not Bool Source # evalUnaryArithOpHs :: forall (s :: [Type]). (Bool ': s) :-> (UnaryArithResHs Not Bool ': s) Source # | |
r ~ Bool => ArithOpHs And Bool Bool r Source # | |
Defined in Lorentz.Arith | |
r ~ Bool => ArithOpHs Or Bool Bool r Source # | |
Defined in Lorentz.Arith | |
r ~ Bool => ArithOpHs Xor Bool Bool r Source # | |
Defined in Lorentz.Arith | |
() :=> (Bounded Bool) | |
() :=> (Enum Bool) | |
() :=> (Eq Bool) | |
() :=> (Ord Bool) | |
() :=> (Read Bool) | |
() :=> (Show Bool) | |
() :=> (Bits Bool) | |
SuppressUnusedWarnings NotSym0 | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings FromEnum_6989586621680204213Sym0 | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings All_Sym0 | |
SuppressUnusedWarnings AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings Any_Sym0 | |
SuppressUnusedWarnings AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings Compare_6989586621679848969Sym0 | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ToEnum_6989586621680204200Sym0 | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ShowsPrec_6989586621680654022Sym0 | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SingI NotSym0 | |
Defined in Data.Singletons.Prelude.Bool | |
SingI (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
SingI (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal | |
SingI All_Sym0 | |
SingI AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI Any_Sym0 | |
SingI AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SingI ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show sing :: Sing ShowParenSym0 # | |
SingI OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal sing :: Sing GetAllSym0 # | |
SingI GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal sing :: Sing GetAnySym0 # | |
SuppressUnusedWarnings ((||@#@$$) a6989586621679816296 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((&&@#@$$) a6989586621679815994 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Compare_6989586621679848969Sym1 a6989586621679848974 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ShowsPrec_6989586621680654022Sym1 a6989586621680654032 :: TyFun Bool (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListnullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621680823225Sym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((<=?@#@$$) a6989586621679910712 :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814090Scrutinee_6989586621680814032Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814066Scrutinee_6989586621680814030Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823849Sym0 :: TyFun a (Product a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823674Sym0 :: TyFun a (Sum a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823499Sym0 :: TyFun a (Dual a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823091Sym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837455Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837439Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837423Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837407Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837496Scrutinee_6989586621679837324Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837480Scrutinee_6989586621679837322Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837399Scrutinee_6989586621679837312Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837395Scrutinee_6989586621679837310Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680787230Scrutinee_6989586621680786635Sym0 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Proxy suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621681012518Sym0 :: TyFun a (Identity a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Identity suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621681012634Sym0 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621680823631Sym0 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621680823806Sym0 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621680823981Sym0 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379490ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379490YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379490X_6989586621680379491Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379455ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379455YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379455X_6989586621680379456Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () # | |
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 sing :: Sing ((<=?@#@$$) x) # | |
SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad sing :: Sing UnlessSym0 # | |
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SingI (ListnullSym0 :: TyFun [a] Bool -> Type) | |
SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
SingI (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing IsSuffixOfSym0 # | |
SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing IsPrefixOfSym0 # | |
SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing IsInfixOfSym0 # | |
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing IsNothingSym0 # | |
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing IsJustSym0 # | |
SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> 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 | |
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 (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
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 (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([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 sing :: Sing UnionBySym0 # | |
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing TakeWhileSym0 # | |
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([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 (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing PartitionSym0 # | |
SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([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 sing :: Sing IntersectBySym0 # | |
SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing GroupBySym0 # | |
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 sing :: Sing FindIndicesSym0 # | |
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing FindIndexSym0 # | |
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing FilterSym0 # | |
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 sing :: Sing DropWhileSym0 # | |
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 sing :: Sing DeleteBySym0 # | |
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 | |
SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680749475 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListelemSym1 a6989586621680749403 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (NotElemSym1 a6989586621680379973 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680379996 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680380003 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680379989 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemSym1 a6989586621680379981 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AnySym1 a6989586621680380198 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AllSym1 a6989586621680380206 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823091Sym1 a6989586621680823100 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379278Scrutinee_6989586621680375723Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_bySym1 a6989586621680379209 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814090Scrutinee_6989586621680814032Sym1 x6989586621680814085 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814066Scrutinee_6989586621680814030Sym1 x6989586621680814061 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680822981Sym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (DefaultEqSym1 a6989586621679819383 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((==@#@$$) a6989586621679819377 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((/=@#@$$) a6989586621679819380 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Bool_Sym1 a6989586621679815190 :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837455Sym1 a6989586621679837460 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837439Sym1 a6989586621679837444 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837423Sym1 a6989586621679837428 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621679837407Sym1 a6989586621679837412 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837496Scrutinee_6989586621679837324Sym1 x6989586621679837494 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837480Scrutinee_6989586621679837322Sym1 x6989586621679837478 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837399Scrutinee_6989586621679837312Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679837395Scrutinee_6989586621679837310Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((>@#@$$) a6989586621679837367 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((>=@#@$$) a6989586621679837372 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((<@#@$$) a6989586621679837357 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings ((<=@#@$$) a6989586621679837362 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621681203563Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621681012518Sym1 a6989586621681012523 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823499Sym1 a6989586621680823508 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823674Sym1 a6989586621680823683 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823849Sym1 a6989586621680823858 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Proxy suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379357ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379357YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379357X_6989586621680379358Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379223NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680379518Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680822514Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679990244GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Base suppressUnusedWarnings :: () # | |
(SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
(SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type) | |
(SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> 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 sing :: Sing (IsSuffixOfSym1 d) # | |
(SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (IsPrefixOfSym1 d) # | |
(SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (IsInfixOfSym1 d) # | |
(SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> 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 (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing IsRightSym0 # | |
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either sing :: Sing IsLeftSym0 # | |
SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing NotElemSym0 # | |
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(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 d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
(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 | |
SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad sing :: Sing MfilterSym0 # | |
SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad sing :: Sing FilterMSym0 # | |
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 | |
SuppressUnusedWarnings (Bool_Sym2 a6989586621679815190 a6989586621679815191 :: TyFun Bool a -> Type) | |
Defined in Data.Singletons.Prelude.Bool suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_bySym2 a6989586621680379209 a6989586621680379210 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621681501382Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379522Scrutinee_6989586621680375701Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379434Scrutinee_6989586621680375707Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379421Scrutinee_6989586621680375709Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379278Scrutinee_6989586621680375723Sym1 n6989586621680379276 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379259Scrutinee_6989586621680375725Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379246Scrutinee_6989586621680375727Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Null_6989586621680822945Sym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680822953Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Elem_6989586621680822981Sym1 a6989586621680822990 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemSym1 a6989586621680822781 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AnySym1 a6989586621680822586 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (AllSym1 a6989586621680822577 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621681203563Sym1 a6989586621681203568 :: TyFun (Arg a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Proxy suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621681501379Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621681501217Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
(SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
(SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable sing :: Sing (NotElemSym1 d) # | |
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SuppressUnusedWarnings (Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621681501382Sym1 x6989586621681501381 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379434Scrutinee_6989586621680375707Sym1 n6989586621680379431 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379421Scrutinee_6989586621680375709Sym1 n6989586621680379418 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379259Scrutinee_6989586621680375725Sym1 x6989586621680379256 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680822953Sym1 a_69895866216808229476989586621680822952 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621681501382Sym2 x6989586621681501381 p6989586621681501377 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379434Scrutinee_6989586621680375707Sym2 n6989586621680379431 x6989586621680379432 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379421Scrutinee_6989586621680375709Sym2 n6989586621680379418 x6989586621680379419 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379259Scrutinee_6989586621680375725Sym2 x6989586621680379256 xs6989586621680379257 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680379571Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 :: TyFun Bool ([k1] ~> [k1]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum suppressUnusedWarnings :: () # | |
type Rep Bool | |
newtype Vector Bool | |
type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680176837Sym0 | |
type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680176834Sym0 | |
type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
type Demote Bool | |
Defined in Data.Singletons.Prelude.Instances | |
type DemoteRep Bool | |
Defined in GHC.Generics | |
data Sing (a :: Bool) | |
type TypeDocFieldDescriptions Bool | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
type ToT Bool | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
newtype MVector s Bool | |
type Show_ (arg :: Bool) | |
type FromEnum (a :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
type ToEnum a | |
Defined in Data.Singletons.Prelude.Enum | |
type Pred (arg :: Bool) | |
type Succ (arg :: Bool) | |
type UnaryArithResHs Not Bool Source # | |
Defined in Lorentz.Arith | |
type ShowList (arg1 :: [Bool]) arg2 | |
type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) | |
type Min (arg1 :: Bool) (arg2 :: Bool) | |
type Max (arg1 :: Bool) (arg2 :: Bool) | |
type (arg1 :: Bool) >= (arg2 :: Bool) | |
type (arg1 :: Bool) > (arg2 :: Bool) | |
type (arg1 :: Bool) <= (arg2 :: Bool) | |
type (arg1 :: Bool) < (arg2 :: Bool) | |
type Compare (a1 :: Bool) (a2 :: Bool) | |
type (x :: Bool) /= (y :: Bool) | |
type (a :: Bool) == (b :: Bool) | |
Defined in Data.Singletons.Prelude.Eq | |
type ShowsPrec a1 (a2 :: Bool) a3 | |
type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) | |
type Apply NotSym0 (a6989586621679816577 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
type Apply FromEnum_6989586621680204213Sym0 (a6989586621680204217 :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
type Apply All_Sym0 (a6989586621680362855 :: Bool) | |
type Apply AllSym0 (a6989586621680250034 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
type Apply Any_Sym0 (a6989586621680362849 :: Bool) | |
type Apply AnySym0 (a6989586621680250051 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
type Apply ToEnum_6989586621680204200Sym0 (a6989586621680204204 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
type Apply GetAllSym0 (a6989586621680250037 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
type Apply GetAnySym0 (a6989586621680250054 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
type Apply ((||@#@$$) a6989586621679816296 :: TyFun Bool Bool -> Type) (a6989586621679816297 :: Bool) | |
type Apply ((&&@#@$$) a6989586621679815994 :: TyFun Bool Bool -> Type) (a6989586621679815995 :: Bool) | |
type Apply (Compare_6989586621679848969Sym1 a6989586621679848974 :: TyFun Bool Ordering -> Type) (a6989586621679848975 :: Bool) | |
type Apply ((<=?@#@$$) a6989586621679910712 :: TyFun Nat Bool -> Type) (a6989586621679910713 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
type Apply (Let6989586621680787230Scrutinee_6989586621680786635Sym0 :: TyFun k1 Bool -> Type) (n6989586621680787229 :: k1) | |
Defined in Data.Singletons.Prelude.Proxy | |
type Apply (Let6989586621680814066Scrutinee_6989586621680814030Sym1 x6989586621680814061 :: TyFun k1 Bool -> Type) (y6989586621680814062 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680814090Scrutinee_6989586621680814032Sym1 x6989586621680814085 :: TyFun k1 Bool -> Type) (y6989586621680814086 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply ((==@#@$$) a6989586621679819377 :: TyFun a Bool -> Type) (a6989586621679819378 :: a) | |
type Apply ((/=@#@$$) a6989586621679819380 :: TyFun a Bool -> Type) (a6989586621679819381 :: a) | |
type Apply (DefaultEqSym1 a6989586621679819383 :: TyFun k Bool -> Type) (a6989586621679819384 :: k) | |
Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym1 a6989586621679819383 :: TyFun k Bool -> Type) (a6989586621679819384 :: k) = DefaultEqSym2 a6989586621679819383 a6989586621679819384 | |
type Apply (Let6989586621679837395Scrutinee_6989586621679837310Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) (y6989586621679837394 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply (TFHelper_6989586621679837455Sym1 a6989586621679837460 :: TyFun a Bool -> Type) (a6989586621679837461 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply (TFHelper_6989586621679837439Sym1 a6989586621679837444 :: TyFun a Bool -> Type) (a6989586621679837445 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply (TFHelper_6989586621679837423Sym1 a6989586621679837428 :: TyFun a Bool -> Type) (a6989586621679837429 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply (TFHelper_6989586621679837407Sym1 a6989586621679837412 :: TyFun a Bool -> Type) (a6989586621679837413 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply ((<=@#@$$) a6989586621679837362 :: TyFun a Bool -> Type) (a6989586621679837363 :: a) | |
type Apply ((>=@#@$$) a6989586621679837372 :: TyFun a Bool -> Type) (a6989586621679837373 :: a) | |
type Apply ((>@#@$$) a6989586621679837367 :: TyFun a Bool -> Type) (a6989586621679837368 :: a) | |
type Apply (Let6989586621679837496Scrutinee_6989586621679837324Sym1 x6989586621679837494 :: TyFun k1 Bool -> Type) (y6989586621679837495 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply (Let6989586621679837480Scrutinee_6989586621679837322Sym1 x6989586621679837478 :: TyFun k1 Bool -> Type) (y6989586621679837479 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply (Let6989586621679837399Scrutinee_6989586621679837312Sym1 x6989586621679837393 :: TyFun k1 Bool -> Type) (y6989586621679837394 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply ((<@#@$$) a6989586621679837357 :: TyFun a Bool -> Type) (a6989586621679837358 :: a) | |
type Apply (Bool_Sym2 a6989586621679815190 a6989586621679815191 :: TyFun Bool a -> Type) (a6989586621679815192 :: Bool) | |
type Apply (Let6989586621680379278Scrutinee_6989586621680375723Sym1 n6989586621680379276 :: TyFun k Bool -> Type) (x6989586621680379277 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym2 x6989586621680379256 xs6989586621680379257 :: TyFun k3 Bool -> Type) (n6989586621680379258 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym2 n6989586621680379418 x6989586621680379419 :: TyFun k3 Bool -> Type) (xs6989586621680379420 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym2 n6989586621680379431 x6989586621680379432 :: TyFun k3 Bool -> Type) (xs6989586621680379433 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type) (arg_69895866216808223416989586621680822956 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type) (arg_69895866216808223416989586621680822956 :: k3) = Lambda_6989586621680822953Sym3 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 arg_69895866216808223416989586621680822956 | |
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type) (xys6989586621680379343 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type) (xys6989586621680379343 :: k3) = Let6989586621680379344Scrutinee_6989586621680375719Sym4 key6989586621680379340 x6989586621680379341 y6989586621680379342 xys6989586621680379343 | |
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type) (l6989586621680379238 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type) (l6989586621680379238 :: k3) = Let6989586621680379246Scrutinee_6989586621680375727Sym4 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 l6989586621680379238 | |
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type) (a_69895866216803795096989586621680379517 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type) (a_69895866216803795096989586621680379517 :: k) = Let6989586621680379522Scrutinee_6989586621680375701Sym4 x6989586621680379520 xs6989586621680379521 p6989586621680379516 a_69895866216803795096989586621680379517 | |
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: TyFun k3 Bool -> Type) (l6989586621680379222 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: TyFun k3 Bool -> Type) (l6989586621680379222 :: k3) = Let6989586621680379230Scrutinee_6989586621680375729Sym5 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 l6989586621680379222 | |
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type) (arg_69895866216801807366989586621680180921 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type) (arg_69895866216801807366989586621680180921 :: k4) = Let6989586621680180930Scrutinee_6989586621680180738Sym5 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 arg_69895866216801807366989586621680180921 | |
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: TyFun k5 Bool -> Type) (arg_69895866216801807606989586621680180831 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: TyFun k5 Bool -> Type) (arg_69895866216801807606989586621680180831 :: k5) = Let6989586621680180839Scrutinee_6989586621680180762Sym6 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 arg_69895866216801807606989586621680180831 | |
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: TyFun k5 Bool -> Type) (arg_69895866216801807506989586621680180868 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: TyFun k5 Bool -> Type) (arg_69895866216801807506989586621680180868 :: k5) = Let6989586621680180876Scrutinee_6989586621680180752Sym6 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 arg_69895866216801807506989586621680180868 | |
type Eval (Not 'False) | |
Defined in Fcf.Data.Bool | |
type Eval (Not 'True) | |
Defined in Fcf.Data.Bool | |
type Apply (GuardSym0 :: TyFun Bool (f ()) -> Type) (a6989586621680011677 :: Bool) | |
type Eval (Null (a2 ': as) :: Bool -> Type) | |
type Eval (Null ('[] :: [a]) :: Bool -> Type) | |
type Eval (And lst :: Bool -> Type) | |
type Eval (Or lst :: Bool -> Type) | |
type Eval (a <= b :: Bool -> Type) | |
type Eval (a >= b :: Bool -> Type) | |
type Eval (a < b :: Bool -> Type) | |
type Eval (a > b :: Bool -> Type) | |
type Eval (IsNothing ('Nothing :: Maybe a) :: Bool -> Type) | |
type Eval (IsNothing ('Just _a) :: Bool -> Type) | |
type Eval (IsJust ('Nothing :: Maybe a) :: Bool -> Type) | |
type Eval (IsJust ('Just _a) :: Bool -> Type) | |
type Eval ('False || b :: Bool -> Type) | |
type Eval ('True || b :: Bool -> Type) | |
type Eval (a || 'False :: Bool -> Type) | |
type Eval (a || 'True :: Bool -> Type) | |
type Eval ('False && b :: Bool -> Type) | |
type Eval ('True && b :: Bool -> Type) | |
type Eval (a && 'True :: Bool -> Type) | |
type Eval (a && 'False :: Bool -> Type) | |
type Apply (||@#@$) (a6989586621679816296 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
type Apply (&&@#@$) (a6989586621679815994 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
type Apply Compare_6989586621679848969Sym0 (a6989586621679848974 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
type Apply ShowParenSym0 (a6989586621680636659 :: Bool) | |
Defined in Data.Singletons.Prelude.Show | |
type Apply ShowsPrec_6989586621680654022Sym0 (a6989586621680654032 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
type Apply (<=?@#@$) (a6989586621679910712 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
type Apply (ShowsPrec_6989586621680654022Sym1 a6989586621680654032 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680654033 :: Bool) | |
type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621681501242 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621681501242 :: Bool) = UnlessSym1 a6989586621681501242 :: TyFun (f ()) (f ()) -> Type | |
type Apply (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621680011821 :: Bool) | |
type Apply (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680749403 :: a) | |
type Apply (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379973 :: a) | |
type Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379981 :: a) | |
type Apply (Let6989586621680814066Scrutinee_6989586621680814030Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680814061 :: k1) | |
type Apply (Let6989586621680814090Scrutinee_6989586621680814032Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680814085 :: k1) | |
type Apply (Elem_6989586621680823091Sym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680823100 :: a) | |
type Apply (Elem_6989586621680823467Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680823472 :: a) | |
type Apply (Elem_6989586621680823499Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680823508 :: a) | |
type Apply (Elem_6989586621680823674Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680823683 :: a) | |
type Apply (Elem_6989586621680823849Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680823858 :: a) | |
type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679819377 :: a) | |
type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679819380 :: a) | |
type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679819383 :: k) | |
Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679819383 :: k) = DefaultEqSym1 a6989586621679819383 | |
type Apply (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) (a6989586621679815190 :: a) | |
type Apply (Let6989586621679837395Scrutinee_6989586621679837310Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837393 :: k1) | |
type Apply (TFHelper_6989586621679837455Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837460 :: a) | |
type Apply (TFHelper_6989586621679837439Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837444 :: a) | |
type Apply (TFHelper_6989586621679837423Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837428 :: a) | |
type Apply (TFHelper_6989586621679837407Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679837412 :: a) | |
type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837362 :: a) | |
type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837372 :: a) | |
type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837367 :: a) | |
type Apply (Let6989586621679837496Scrutinee_6989586621679837324Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837494 :: k1) | |
type Apply (Let6989586621679837480Scrutinee_6989586621679837322Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837478 :: k1) | |
type Apply (Let6989586621679837399Scrutinee_6989586621679837312Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679837393 :: k1) | |
type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679837357 :: a) | |
type Apply (Elem_6989586621681012518Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621681012523 :: a) | |
type Apply (Let6989586621680379278Scrutinee_6989586621680375723Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680379276 :: k1) | |
type Apply (Elem_bySym1 a6989586621680379209 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680379210 :: a) | |
type Apply (Elem_6989586621680822981Sym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822990 :: a) | |
type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822781 :: a) | |
type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822528 :: a) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680822528 :: a) = NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type | |
type Apply (Bool_Sym1 a6989586621679815190 :: TyFun a (Bool ~> a) -> Type) (a6989586621679815191 :: a) | |
type Apply (Lambda_6989586621681501382Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) -> Type) (x6989586621681501381 :: k1) | |
Defined in Data.Singletons.Prelude.Monad | |
type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680379256 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680379340 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680379340 :: k1) = Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type | |
type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680379418 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680379431 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680379227 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680379227 :: k1) = Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379243 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379243 :: k1) = Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type | |
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379520 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680379520 :: k1) = Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type | |
type Apply (Lambda_6989586621680822953Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216808229476989586621680822952 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Lambda_6989586621681501382Sym1 x6989586621681501381 :: TyFun k2 (TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) -> Type) (p6989586621681501377 :: k2) | |
Defined in Data.Singletons.Prelude.Monad | |
type Apply (Let6989586621680379259Scrutinee_6989586621680375725Sym1 x6989586621680379256 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680379257 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680379341 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym1 key6989586621680379340 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680379341 :: k1) = Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type | |
type Apply (Let6989586621680379421Scrutinee_6989586621680375709Sym1 n6989586621680379418 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680379419 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379434Scrutinee_6989586621680375707Sym1 n6989586621680379431 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680379432 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680379228 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym1 y6989586621680379227 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680379228 :: k2) = Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type | |
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379244 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym1 x6989586621680379243 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379244 :: k2) = Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type | |
type Apply (Lambda_6989586621680822953Sym1 a_69895866216808229476989586621680822952 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216808223396989586621680822955 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680822953Sym1 a_69895866216808229476989586621680822952 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216808223396989586621680822955 :: k2) = Lambda_6989586621680822953Sym2 a_69895866216808229476989586621680822952 arg_69895866216808223396989586621680822955 :: TyFun k3 Bool -> Type | |
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680180929 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680180929 :: k1) = Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type | |
type Apply (Lambda_6989586621681501382Sym2 x6989586621681501381 p6989586621681501377 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216815013706989586621681501378 :: k3) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501382Sym2 x6989586621681501381 p6989586621681501377 :: TyFun k3 (TyFun Bool ([k1] ~> [k1]) -> Type) -> Type) (a_69895866216815013706989586621681501378 :: k3) = Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 | |
type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680379342 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379344Scrutinee_6989586621680375719Sym2 key6989586621680379340 x6989586621680379341 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680379342 :: k2) = Let6989586621680379344Scrutinee_6989586621680375719Sym3 key6989586621680379340 x6989586621680379341 y6989586621680379342 :: TyFun k3 Bool -> Type | |
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180834 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180834 :: k1) = Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180871 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680180871 :: k1) = Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680180924 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym1 x6989586621680180929 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680180924 :: k2) = Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type | |
type Apply (Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621681501384 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681501382Sym3 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 :: TyFun Bool ([k1] ~> [k1]) -> Type) (flg6989586621681501384 :: Bool) = Lambda_6989586621681501382Sym4 x6989586621681501381 p6989586621681501377 a_69895866216815013706989586621681501378 flg6989586621681501384 | |
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180835 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym1 x16989586621680180834 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180835 :: k2) = Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180872 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym1 x16989586621680180871 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680180872 :: k2) = Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680180925 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym2 x6989586621680180929 x06989586621680180924 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680180925 :: k1) = Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type | |
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180836 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym2 x16989586621680180834 x26989586621680180835 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180836 :: k1) = Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180873 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym2 x16989586621680180871 x26989586621680180872 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680180873 :: k1) = Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801807346989586621680180920 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180930Scrutinee_6989586621680180738Sym3 x6989586621680180929 x06989586621680180924 y6989586621680180925 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801807346989586621680180920 :: k3) = Let6989586621680180930Scrutinee_6989586621680180738Sym4 x6989586621680180929 x06989586621680180924 y6989586621680180925 arg_69895866216801807346989586621680180920 :: TyFun k4 Bool -> Type | |
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807566989586621680180829 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym3 x16989586621680180834 x26989586621680180835 y6989586621680180836 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807566989586621680180829 :: k3) = Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807466989586621680180866 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym3 x16989586621680180871 x26989586621680180872 y6989586621680180873 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801807466989586621680180866 :: k3) = Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807586989586621680180830 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180839Scrutinee_6989586621680180762Sym4 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807586989586621680180830 :: k4) = Let6989586621680180839Scrutinee_6989586621680180762Sym5 x16989586621680180834 x26989586621680180835 y6989586621680180836 arg_69895866216801807566989586621680180829 arg_69895866216801807586989586621680180830 :: TyFun k5 Bool -> Type | |
type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807486989586621680180867 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680180876Scrutinee_6989586621680180752Sym4 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801807486989586621680180867 :: k4) = Let6989586621680180876Scrutinee_6989586621680180752Sym5 x16989586621680180871 x26989586621680180872 y6989586621680180873 arg_69895866216801807466989586621680180866 arg_69895866216801807486989586621680180867 :: TyFun k5 Bool -> Type | |
type Eval (IsPrefixOf xs ys :: Bool -> Type) | |
Defined in Fcf.Data.List | |
type Eval (IsSuffixOf xs ys :: Bool -> Type) | |
Defined in Fcf.Data.List | |
type Eval (IsInfixOf xs ys :: Bool -> Type) | |
type Eval (Elem a2 as :: Bool -> Type) | |
type Eval (IsLeft ('Right _a :: Either a b) :: Bool -> Type) | |
type Eval (IsLeft ('Left _a :: Either a b) :: Bool -> Type) | |
type Eval (IsRight ('Right _a :: Either a b) :: Bool -> Type) | |
type Eval (IsRight ('Left _a :: Either a b) :: Bool -> Type) | |
type Eval (TyEq a b :: Bool -> Type) | |
type Eval (All p lst :: Bool -> Type) | |
type Eval (Any p lst :: Bool -> Type) | |
type Eval (TyEqSing a b :: Bool -> Type) | |
Defined in Morley.Util.Fcf | |
type Apply OrSym0 (a6989586621680380213 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply AndSym0 (a6989586621680380218 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680749312 :: [a]) | |
type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680380391 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Null_6989586621680823225Sym0 :: TyFun [a] Bool -> Type) (a6989586621680823231 :: [a]) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a) = IsNothingSym1 a6989586621679959424 | |
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a) = IsJustSym1 a6989586621679959427 | |
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680822600 :: t Bool) | |
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680822594 :: t Bool) | |
type Apply (Null_6989586621681012634Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621681012638 :: Identity a) | |
type Apply (Null_6989586621680823631Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680823635 :: Dual a) | |
type Apply (Null_6989586621680823806Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680823810 :: Sum a) | |
type Apply (Null_6989586621680823981Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680823985 :: Product a) | |
type Apply (ListelemSym1 a6989586621680749403 :: TyFun [a] Bool -> Type) (a6989586621680749404 :: [a]) | |
type Apply (ListisPrefixOfSym1 a6989586621680749475 :: TyFun [a] Bool -> Type) (a6989586621680749476 :: [a]) | |
type Apply (NotElemSym1 a6989586621680379973 :: TyFun [a] Bool -> Type) (a6989586621680379974 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (ElemSym1 a6989586621680379981 :: TyFun [a] Bool -> Type) (a6989586621680379982 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (IsPrefixOfSym1 a6989586621680380003 :: TyFun [a] Bool -> Type) (a6989586621680380004 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680380003 :: TyFun [a] Bool -> Type) (a6989586621680380004 :: [a]) = IsPrefixOfSym2 a6989586621680380003 a6989586621680380004 | |
type Apply (AnySym1 a6989586621680380198 :: TyFun [a] Bool -> Type) (a6989586621680380199 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (IsInfixOfSym1 a6989586621680379989 :: TyFun [a] Bool -> Type) (a6989586621680379990 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym1 a6989586621680379989 :: TyFun [a] Bool -> Type) (a6989586621680379990 :: [a]) = IsInfixOfSym2 a6989586621680379989 a6989586621680379990 | |
type Apply (AllSym1 a6989586621680380206 :: TyFun [a] Bool -> Type) (a6989586621680380207 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (IsSuffixOfSym1 a6989586621680379996 :: TyFun [a] Bool -> Type) (a6989586621680379997 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680379996 :: TyFun [a] Bool -> Type) (a6989586621680379997 :: [a]) = IsSuffixOfSym2 a6989586621680379996 a6989586621680379997 | |
type Apply (Elem_6989586621680823091Sym1 a6989586621680823100 :: TyFun [a] Bool -> Type) (a6989586621680823101 :: [a]) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Elem_6989586621681012518Sym1 a6989586621681012523 :: TyFun (Identity a) Bool -> Type) (a6989586621681012524 :: Identity a) | |
type Apply (Elem_6989586621680823499Sym1 a6989586621680823508 :: TyFun (Dual a) Bool -> Type) (a6989586621680823509 :: Dual a) | |
type Apply (Elem_6989586621680823674Sym1 a6989586621680823683 :: TyFun (Sum a) Bool -> Type) (a6989586621680823684 :: Sum a) | |
type Apply (Elem_6989586621680823849Sym1 a6989586621680823858 :: TyFun (Product a) Bool -> Type) (a6989586621680823859 :: Product a) | |
type Apply (Elem_bySym2 a6989586621680379209 a6989586621680379210 :: TyFun [a] Bool -> Type) (a6989586621680379211 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Elem_6989586621680822981Sym1 a6989586621680822990 :: TyFun (t a) Bool -> Type) (a6989586621680822991 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Null_6989586621680822945Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680822951 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (AnySym1 a6989586621680822586 :: TyFun (t a) Bool -> Type) (a6989586621680822587 :: t a) | |
type Apply (ElemSym1 a6989586621680822781 :: TyFun (t a) Bool -> Type) (a6989586621680822782 :: t a) | |
type Apply (NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type) (a6989586621680822529 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym1 a6989586621680822528 :: TyFun (t a) Bool -> Type) (a6989586621680822529 :: t a) = NotElemSym2 a6989586621680822528 a6989586621680822529 | |
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680822774 :: t a) | |
type Apply (AllSym1 a6989586621680822577 :: TyFun (t a) Bool -> Type) (a6989586621680822578 :: t a) | |
type Apply (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680749475 :: [a]) | |
type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680380003 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680380003 :: [a]) = IsPrefixOfSym1 a6989586621680380003 | |
type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379989 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379989 :: [a]) = IsInfixOfSym1 a6989586621680379989 | |
type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379996 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680379996 :: [a]) = IsSuffixOfSym1 a6989586621680379996 | |
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680379521 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym1 x6989586621680379520 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680379521 :: [a]) = Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type | |
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379229 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym2 y6989586621680379227 ys6989586621680379228 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680379229 :: [k1]) = Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type | |
type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680379245 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379246Scrutinee_6989586621680375727Sym2 x6989586621680379243 xs6989586621680379244 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680379245 :: [k1]) = Let6989586621680379246Scrutinee_6989586621680375727Sym3 x6989586621680379243 xs6989586621680379244 ls6989586621680379245 :: TyFun k3 Bool -> Type | |
type Apply (Null_6989586621680823386Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680823392 :: Either a1 a2) | |
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804000 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804000 :: Either a b) = IsRightSym1 a6989586621680804000 | |
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804003 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680804003 :: Either a b) = IsLeftSym1 a6989586621680804003 | |
type Apply (Elem_6989586621680823467Sym1 a6989586621680823472 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823473 :: Proxy a) | |
type Apply (Null_6989586621680823460Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680823464 :: Proxy a) | |
type Apply (TFHelper_6989586621681203563Sym1 a6989586621681203568 :: TyFun (Arg a b) Bool -> Type) (a6989586621681203569 :: Arg a b) | |
type Apply (TFHelper_6989586621680787174Sym1 a6989586621680787179 :: TyFun (Proxy s) Bool -> Type) (a6989586621680787180 :: Proxy s) | |
type Apply (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680749437 :: a ~> (a ~> Bool)) | |
type Apply (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680749497 :: a ~> Bool) | |
type Apply (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749508 :: a ~> Bool) | |
type Apply (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680749519 :: a ~> Bool) | |
type Apply (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749530 :: a ~> Bool) | |
type Apply (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680749541 :: a ~> Bool) | |
type Apply (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) (a6989586621680379209 :: a ~> (a ~> Bool)) | |
type Apply (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680379219 :: a ~> (a ~> Bool)) | |
type Apply (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) (a6989586621680379315 :: a ~> Bool) | |
type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379330 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379330 :: a ~> Bool) = PartitionSym1 a6989586621680379330 | |
type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379442 :: a ~> Bool) | |
type Apply (Let6989586621680379455YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool) | |
type Apply (Let6989586621680379455ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool) | |
type Apply (Let6989586621680379455X_6989586621680379456Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680379446 :: k ~> Bool) | |
type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680379477 :: a ~> Bool) | |
type Apply (Let6989586621680379490YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool) | |
type Apply (Let6989586621680379490ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool) | |
type Apply (Let6989586621680379490X_6989586621680379491Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680379481 :: k ~> Bool) | |
type Apply (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) (a6989586621680379352 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379531 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379531 :: a ~> Bool) = DropWhileSym1 a6989586621680379531 | |
type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379546 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379546 :: a ~> Bool) = TakeWhileSym1 a6989586621680379546 | |
type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379646 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379646 :: a ~> Bool) = FilterSym1 a6989586621680379646 | |
type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool) | |
type Apply (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) (a6989586621680379745 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379735 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379199 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) (a6989586621680379589 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680380198 :: a ~> Bool) | |
type Apply (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680379560 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680380206 :: a ~> Bool) | |
type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379514 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680379514 :: a ~> Bool) = DropWhileEndSym1 a6989586621680379514 | |
type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679990238 :: a ~> Bool) | |
type Apply (TFHelper_6989586621681203563Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) (a6989586621681203568 :: Arg a b) | |
type Apply (TFHelper_6989586621680787174Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680787179 :: Proxy s) | |
type Apply (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) (a6989586621681501213 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.Monad | |
type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621681501375 :: a ~> m Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) (a6989586621681501375 :: a ~> m Bool) = FilterMSym1 a6989586621681501375 | |
type Apply (Let6989586621680379223NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680379221 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Let6989586621680379357YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool)) | |
type Apply (Let6989586621680379357ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool)) | |
type Apply (Let6989586621680379357X_6989586621680379358Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) (eq6989586621680379354 :: k1 ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Lambda_6989586621680379518Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) (p6989586621680379516 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Lambda_6989586621680822514Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680822512 :: a ~> Bool) | |
type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680822586 :: a ~> Bool) | |
type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680822577 :: a ~> Bool) | |
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool) | |
type Apply (Let6989586621679990244GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679990241 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Base | |
type Apply (Lambda_6989586621681501217Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m k1) -> Type) -> Type) -> Type) (p6989586621681501215 :: k1 ~> Bool) | |
type Apply (Lambda_6989586621681501379Sym0 :: TyFun (k2 ~> f Bool) (TyFun k3 (TyFun k2 (f [k2] ~> f [k2]) -> Type) -> Type) -> Type) (p6989586621681501377 :: k2 ~> f Bool) | |
Defined in Data.Singletons.Prelude.Monad | |
type Apply (Lambda_6989586621680379571Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680379563 :: b ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680379571Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680379563 :: b ~> (a ~> Bool)) = Lambda_6989586621680379571Sym1 eq6989586621680379563 :: TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680379516 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379522Scrutinee_6989586621680375701Sym2 x6989586621680379520 xs6989586621680379521 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680379516 :: k1 ~> Bool) = Let6989586621680379522Scrutinee_6989586621680375701Sym3 x6989586621680379520 xs6989586621680379521 p6989586621680379516 :: TyFun k Bool -> Type | |
type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680379221 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680379230Scrutinee_6989586621680375729Sym3 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680379221 :: k1 ~> (k1 ~> Bool)) = Let6989586621680379230Scrutinee_6989586621680375729Sym4 y6989586621680379227 ys6989586621680379228 xs6989586621680379229 eq6989586621680379221 :: TyFun k3 Bool -> Type |
data ByteString #
A space-efficient representation of a Word8
vector, supporting many
efficient operations.
A ByteString
contains 8-bit bytes, or by using the operations from
Data.ByteString.Char8 it can be interpreted as containing 8-bit
characters.
Instances
Instances
Instances
Instances
Instances
Eq Never Source # | |
Ord Never Source # | |
Show Never Source # | |
Generic Never Source # | |
NFData Never Source # | |
Defined in Lorentz.Value | |
Buildable Never Source # | |
Defined in Lorentz.Value | |
TypeHasDoc Never Source # | |
Defined in Lorentz.Value type TypeDocFieldDescriptions Never :: FieldDescriptions # typeDocName :: Proxy Never -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Never -> WithinParens -> Markdown # typeDocDependencies :: Proxy Never -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep Never # typeDocMichelsonRep :: TypeDocMichelsonRep Never # | |
IsoValue Never Source # | |
HasAnnotation Never Source # | |
Defined in Lorentz.Value getAnnotation :: FollowEntrypointFlag -> Notes (ToT Never) Source # | |
type Rep Never Source # | |
type TypeDocFieldDescriptions Never Source # | |
Defined in Lorentz.Value | |
type ToT Never Source # | |
Defined in Lorentz.Value |
Instances
Instances
Instances
Instances
Instances
data Bls12381Fr #
Instances
data Bls12381G1 #
Instances
data Bls12381G2 #
Instances
A set of values a
.
Instances
Foldable Set | Folds in order of increasing key. |
Defined in Data.Set.Internal fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
ToJSON1 Set | |
Defined in Data.Aeson.Types.ToJSON | |
Eq1 Set | Since: containers-0.5.9 |
Ord1 Set | Since: containers-0.5.9 |
Defined in Data.Set.Internal | |
Show1 Set | Since: containers-0.5.9 |
Ord a => IsList (Set a) | Since: containers-0.5.6.2 |
Eq a => Eq (Set a) | |
(Data a, Ord a) => Data (Set a) | |
Defined in Data.Set.Internal gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) # dataTypeOf :: Set a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) # gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # | |
Ord a => Ord (Set a) | |
(Read a, Ord a) => Read (Set a) | |
Show a => Show (Set a) | |
Ord a => Semigroup (Set a) | Since: containers-0.5.7 |
Ord a => Monoid (Set a) | |
ToJSON a => ToJSON (Set a) | |
Defined in Data.Aeson.Types.ToJSON | |
NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
Ord a => Contains (Set a) | |
Ord k => Ixed (Set k) | |
Defined in Control.Lens.At | |
Ord k => At (Set k) | |
Ord a => Wrapped (Set a) | |
(Ord a, Monoid a) => Semiring (Set a) | The multiplication laws are satisfied for
any underlying |
Ord v => Container (Set v) | |
Defined in Universum.Container.Class toList :: Set v -> [Element (Set v)] # foldr :: (Element (Set v) -> b -> b) -> b -> Set v -> b # foldl :: (b -> Element (Set v) -> b) -> b -> Set v -> b # foldl' :: (b -> Element (Set v) -> b) -> b -> Set v -> b # elem :: Element (Set v) -> Set v -> Bool # foldMap :: Monoid m => (Element (Set v) -> m) -> Set v -> m # fold :: Set v -> Element (Set v) # foldr' :: (Element (Set v) -> b -> b) -> b -> Set v -> b # notElem :: Element (Set v) -> Set v -> Bool # all :: (Element (Set v) -> Bool) -> Set v -> Bool # any :: (Element (Set v) -> Bool) -> Set v -> Bool # find :: (Element (Set v) -> Bool) -> Set v -> Maybe (Element (Set v)) # safeHead :: Set v -> Maybe (Element (Set v)) # safeMaximum :: Set v -> Maybe (Element (Set v)) # safeMinimum :: Set v -> Maybe (Element (Set v)) # safeFoldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) # safeFoldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v)) # | |
One (Set v) | |
PolyCTypeHasDocC '[a] => TypeHasDoc (Set a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Set a) :: FieldDescriptions # typeDocName :: Proxy (Set a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Set a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Set a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Set a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Set a) # | |
(Comparable (ToT c), Ord c, IsoValue c) => IsoValue (Set c) | |
KnownIsoT v => HasAnnotation (Set v) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Set v)) Source # | |
NiceComparable a => UpdOpHs (Set a) Source # | |
Defined in Lorentz.Polymorphic type UpdOpKeyHs (Set a) Source # type UpdOpParamsHs (Set a) Source # | |
SizeOpHs (Set a) Source # | |
Defined in Lorentz.Polymorphic | |
NiceComparable e => IterOpHs (Set e) Source # | |
Defined in Lorentz.Polymorphic type IterOpElHs (Set e) Source # | |
NiceComparable e => MemOpHs (Set e) Source # | |
Defined in Lorentz.Polymorphic type MemOpKeyHs (Set e) Source # | |
LDefault (Set k) Source # | |
(t ~ Set a', Ord a) => Rewrapped (Set a) t | Use |
Defined in Control.Lens.Wrapped | |
CanCastTo k1 k2 => CanCastTo (Set k1 :: Type) (Set k2 :: Type) Source # | |
(NiceComparable key, Ord key, Dupable key) => StoreHasSubmap (Set key) SelfRef key () Source # | |
Defined in Lorentz.StoreClass storeSubmapOps :: StoreSubmapOps (Set key) SelfRef key () Source # | |
type Item (Set a) | |
Defined in Data.Set.Internal | |
type Index (Set a) | |
Defined in Control.Lens.At | |
type IxValue (Set k) | |
Defined in Control.Lens.At | |
type Unwrapped (Set a) | |
Defined in Control.Lens.Wrapped | |
type Element (Set v) | |
Defined in Universum.Container.Class | |
type OneItem (Set v) | |
Defined in Universum.Container.Class | |
type TypeDocFieldDescriptions (Set a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
type ToT (Set c) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
type UpdOpKeyHs (Set a) Source # | |
Defined in Lorentz.Polymorphic | |
type UpdOpParamsHs (Set a) Source # | |
Defined in Lorentz.Polymorphic | |
type IterOpElHs (Set e) Source # | |
Defined in Lorentz.Polymorphic | |
type MemOpKeyHs (Set e) Source # | |
Defined in Lorentz.Polymorphic |
A Map from keys k
to values a
.
The Semigroup
operation for Map
is union
, which prefers
values from the left operand. If m1
maps a key k
to a value
a1
, and m2
maps the same key to a different value a2
, then
their union m1 <> m2
maps k
to a1
.
Instances
Bifoldable Map | Since: containers-0.6.3.1 |
Eq2 Map | Since: containers-0.5.9 |
Ord2 Map | Since: containers-0.5.9 |
Defined in Data.Map.Internal | |
Show2 Map | Since: containers-0.5.9 |
Functor (Map k) | |
Foldable (Map k) | Folds in order of increasing key. |
Defined in Data.Map.Internal fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
Traversable (Map k) | Traverses in order of increasing key. |
ToJSONKey k => ToJSON1 (Map k) | |
Defined in Data.Aeson.Types.ToJSON liftToJSON :: (a -> Value) -> ([a] -> Value) -> Map k a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Map k a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Map k a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Map k a] -> Encoding # | |
Eq k => Eq1 (Map k) | Since: containers-0.5.9 |
Ord k => Ord1 (Map k) | Since: containers-0.5.9 |
Defined in Data.Map.Internal | |
(Ord k, Read k) => Read1 (Map k) | Since: containers-0.5.9 |
Defined in Data.Map.Internal | |
Show k => Show1 (Map k) | Since: containers-0.5.9 |
(CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (Map k1 v1 :: Type) (Map k2 v2 :: Type) Source # | |
Ord k => IsList (Map k v) | Since: containers-0.5.6.2 |
(Eq k, Eq a) => Eq (Map k a) | |
(Data k, Data a, Ord k) => Data (Map k a) | |
Defined in Data.Map.Internal gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) # toConstr :: Map k a -> Constr # dataTypeOf :: Map k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) # gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # | |
(Ord k, Ord v) => Ord (Map k v) | |
(Ord k, Read k, Read e) => Read (Map k e) | |
(Show k, Show a) => Show (Map k a) | |
Ord k => Semigroup (Map k v) | |
Ord k => Monoid (Map k v) | |
(ToJSON v, ToJSONKey k) => ToJSON (Map k v) | |
Defined in Data.Aeson.Types.ToJSON | |
(NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
Ord k => Ixed (Map k a) | |
Defined in Control.Lens.At | |
Ord k => At (Map k a) | |
Ord k => Wrapped (Map k a) | |
(Ord k, Monoid k, Semiring v) => Semiring (Map k v) | The multiplication laws are satisfied for
any underlying |
ToPairs (Map k v) | |
Container (Map k v) | |
Defined in Universum.Container.Class toList :: Map k v -> [Element (Map k v)] # foldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # foldl :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # foldl' :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # elem :: Element (Map k v) -> Map k v -> Bool # foldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # fold :: Map k v -> Element (Map k v) # foldr' :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # notElem :: Element (Map k v) -> Map k v -> Bool # all :: (Element (Map k v) -> Bool) -> Map k v -> Bool # any :: (Element (Map k v) -> Bool) -> Map k v -> Bool # find :: (Element (Map k v) -> Bool) -> Map k v -> Maybe (Element (Map k v)) # safeHead :: Map k v -> Maybe (Element (Map k v)) # safeMaximum :: Map k v -> Maybe (Element (Map k v)) # safeMinimum :: Map k v -> Maybe (Element (Map k v)) # safeFoldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) # safeFoldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v)) # | |
One (Map k v) | |
(PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Map k v) :: FieldDescriptions # typeDocName :: Proxy (Map k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Map k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Map k v) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Map k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (Map k v) # | |
(Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v) | |
ToBigMap (Map k v) | |
(HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Map k v)) Source # | |
NiceComparable k => GetOpHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic type GetOpKeyHs (Map k v) Source # type GetOpValHs (Map k v) Source # | |
NiceComparable k => UpdOpHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic type UpdOpKeyHs (Map k v) Source # type UpdOpParamsHs (Map k v) Source # | |
SizeOpHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
NiceComparable k => IterOpHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic type IterOpElHs (Map k v) Source # | |
NiceComparable k => MapOpHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic type MapOpInpHs (Map k v) Source # | |
NiceComparable k => MemOpHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic type MemOpKeyHs (Map k v) Source # | |
LDefault (Map k v) Source # | |
(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t | Use |
Defined in Control.Lens.Wrapped | |
(NiceComparable key, KnownValue value) => StoreHasSubmap (Map key value) SelfRef key value Source # | |
Defined in Lorentz.StoreClass storeSubmapOps :: StoreSubmapOps (Map key value) SelfRef key value Source # | |
type Item (Map k v) | |
Defined in Data.Map.Internal | |
type Index (Map k a) | |
Defined in Control.Lens.At | |
type IxValue (Map k a) | |
Defined in Control.Lens.At | |
type Unwrapped (Map k a) | |
Defined in Control.Lens.Wrapped | |
type Val (Map k v) | |
Defined in Universum.Container.Class | |
type Key (Map k v) | |
Defined in Universum.Container.Class | |
type Element (Map k v) | |
Defined in Universum.Container.Class | |
type OneItem (Map k v) | |
Defined in Universum.Container.Class | |
type TypeDocFieldDescriptions (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
type ToT (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
type ToBigMapKey (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Value type ToBigMapKey (Map k v) = k | |
type ToBigMapValue (Map k v) | |
Defined in Morley.Michelson.Typed.Haskell.Value type ToBigMapValue (Map k v) = v | |
type GetOpKeyHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
type GetOpValHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
type UpdOpKeyHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
type UpdOpParamsHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
type IterOpElHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
type MapOpInpHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
type MapOpResHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic | |
type MemOpKeyHs (Map k v) Source # | |
Defined in Lorentz.Polymorphic |
newtype BigMapId (k2 :: k) (v :: k1) #
Instances
(Typeable k2, Typeable v, Typeable k1, Typeable k3) => Data (BigMapId k2 v) | |
Defined in Morley.Michelson.Typed.Haskell.Value gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BigMapId k2 v -> c (BigMapId k2 v) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BigMapId k2 v) # toConstr :: BigMapId k2 v -> Constr # dataTypeOf :: BigMapId k2 v -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BigMapId k2 v)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BigMapId k2 v)) # gmapT :: (forall b. Data b => b -> b) -> BigMapId k2 v -> BigMapId k2 v # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BigMapId k2 v -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BigMapId k2 v -> r # gmapQ :: (forall d. Data d => d -> u) -> BigMapId k2 v -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BigMapId k2 v -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BigMapId k2 v -> m (BigMapId k2 v) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BigMapId k2 v -> m (BigMapId k2 v) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BigMapId k2 v -> m (BigMapId k2 v) # | |
Num (BigMapId k2 v) | |
Defined in Morley.Michelson.Typed.Haskell.Value (+) :: BigMapId k2 v -> BigMapId k2 v -> BigMapId k2 v # (-) :: BigMapId k2 v -> BigMapId k2 v -> BigMapId k2 v # (*) :: BigMapId k2 v -> BigMapId k2 v -> BigMapId k2 v # negate :: BigMapId k2 v -> BigMapId k2 v # abs :: BigMapId k2 v -> BigMapId k2 v # signum :: BigMapId k2 v -> BigMapId k2 v # fromInteger :: Integer -> BigMapId k2 v # | |
Show (BigMapId k2 v) | |
Buildable (BigMapId k2 v) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
IsoValue (BigMapId k2 v) | |
(HasAnnotation k, HasAnnotation v) => HasAnnotation (BigMapId k v) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (BigMapId k v)) Source # | |
type ToT (BigMapId k2 v) | |
Defined in Morley.Michelson.Typed.Haskell.Value |
Instances
The Maybe
type encapsulates an optional value. A value of type
either contains a value of type Maybe
aa
(represented as
),
or it is empty (represented as Just
aNothing
). Using Maybe
is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error
.
The Maybe
type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing
. A richer
error monad can be built using the Either
type.
Instances
Monad Maybe | Since: base-2.1 |
Functor Maybe | Since: base-2.1 |
MonadFail Maybe | Since: base-4.9.0.0 |
Defined in Control.Monad.Fail | |
Applicative Maybe | Since: base-2.1 |
Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
Traversable Maybe | Since: base-2.1 |
MonadPlus Maybe | Since: base-2.1 |
ToJSON1 Maybe | |
Defined in Data.Aeson.Types.ToJSON liftToJSON :: (a -> Value) -> ([a] -> Value) -> Maybe a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Maybe a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Maybe a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Maybe a] -> Encoding # | |
Alternative Maybe | Since: base-2.1 |
Eq1 Maybe | Since: base-4.9.0.0 |
Ord1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Read1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
Show1 Maybe | Since: base-4.9.0.0 |
MonadFailure Maybe | |
NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
MonadThrow Maybe | |
Defined in Control.Monad.Catch | |
Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
InjValue Maybe | |
Defined in Named.Internal | |
PTraversable Maybe | |
STraversable Maybe | |
Defined in Data.Singletons.Prelude.Traversable sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Maybe a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Maybe (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Maybe a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t1 :: Maybe (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
PFoldable Maybe | |
SFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
SMonadFail Maybe | |
PFunctor Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
PApplicative Maybe | |
PMonad Maybe | |
SFunctor Maybe | |
SApplicative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: Maybe (a ~> b)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Maybe a) (t3 :: Maybe b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
SMonad Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
SAlternative Maybe | |
SMonadPlus Maybe | |
KnownNamedFunctor Maybe | |
LorentzFunctor Maybe Source # | |
Defined in Lorentz.Instr | |
MonadError () Maybe | Since: mtl-2.2.2 |
Defined in Control.Monad.Error.Class throwError :: () -> Maybe a # catchError :: Maybe a -> (() -> Maybe a) -> Maybe a # | |
(Selector s, GToJSON' enc arity (K1 i (Maybe a) :: Type -> Type), KeyValuePair enc pairs, Monoid pairs) => RecordToPairs enc pairs arity (S1 s (K1 i (Maybe a) :: Type -> Type)) | |
Defined in Data.Aeson.Types.ToJSON | |
Lift a => Lift (Maybe a :: Type) | |
() :=> (Functor Maybe) | |
() :=> (Applicative Maybe) | |
Defined in Data.Constraint ins :: () :- Applicative Maybe # | |
() :=> (MonadPlus Maybe) | |
() :=> (Alternative Maybe) | |
Defined in Data.Constraint ins :: () :- Alternative Maybe # | |
Eq a => Eq (Maybe a) | Since: base-2.1 |
Ord a => Ord (Maybe a) | Since: base-2.1 |
Read a => Read (Maybe a) | Since: base-2.1 |
Show a => Show (Maybe a) | Since: base-2.1 |
Generic (Maybe a) | Since: base-4.6.0.0 |
Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
ToJSON a => ToJSON (Maybe a) | |
Defined in Data.Aeson.Types.ToJSON | |
NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
Default (Maybe a) | |
Defined in Data.Default.Class | |
Buildable a => Buildable (Maybe a) | |
Defined in Formatting.Buildable | |
Ixed (Maybe a) | |
Defined in Control.Lens.At | |
At (Maybe a) | |
Semiring a => Semiring (Maybe a) | |
PMonoid (Maybe a) | |
SSemigroup a => SMonoid (Maybe a) | |
PShow (Maybe a) | |
SShow a => SShow (Maybe a) | |
Defined in Data.Singletons.Prelude.Show sShowsPrec :: forall (t1 :: Nat) (t2 :: Maybe a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Maybe a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
PSemigroup (Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
SSemigroup a => SSemigroup (Maybe a) | |
POrd (Maybe a) | |
SOrd a => SOrd (Maybe a) | |
Defined in Data.Singletons.Prelude.Ord sCompare :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
SEq a => SEq (Maybe a) | |
PEq (Maybe a) | |
(TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a) | |
Defined in Universum.Container.Class toList :: Maybe a -> [Element (Maybe a)] # foldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # foldl' :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # elem :: Element (Maybe a) -> Maybe a -> Bool # foldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # fold :: Maybe a -> Element (Maybe a) # foldr' :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # safeHead :: Maybe a -> Maybe (Element (Maybe a)) # safeMaximum :: Maybe a -> Maybe (Element (Maybe a)) # safeMinimum :: Maybe a -> Maybe (Element (Maybe a)) # safeFoldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # safeFoldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Maybe (Element (Maybe a)) # | |
Pretty a => Pretty (Maybe a) | |
Defined in Text.PrettyPrint.Leijen.Text | |
SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics type DemoteRep (Maybe a) | |
PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Maybe a) :: FieldDescriptions # typeDocName :: Proxy (Maybe a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Maybe a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Maybe a) # | |
IsoValue a => IsoValue (Maybe a) | |
HasAnnotation a => HasAnnotation (Maybe a) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Maybe a)) Source # | |
Generic1 Maybe | Since: base-4.6.0.0 |
PMonadFail Maybe | |
Defined in Data.Singletons.Prelude.Monad.Fail | |
PAlternative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
PMonadPlus Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
IsoHKD Maybe (a :: Type) | |
SDecide a => TestCoercion (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SDecide a => TestEquality (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
(Eq a) :=> (Eq (Maybe a)) | |
(Ord a) :=> (Ord (Maybe a)) | |
(Read a) :=> (Read (Maybe a)) | |
(Show a) :=> (Show (Maybe a)) | |
(Semigroup a) :=> (Semigroup (Maybe a)) | |
(Monoid a) :=> (Monoid (Maybe a)) | |
SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
Each (Maybe a) (Maybe b) a b | |
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) Source # | |
SingI a2 => SingI ('Just a2 :: Maybe a1) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
SuppressUnusedWarnings (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Fail suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing CatMaybesSym0 # | |
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing ListToMaybeSym0 # | |
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing MaybeToListSym0 # | |
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing IsNothingSym0 # | |
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing IsJustSym0 # | |
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing FromJustSym0 # | |
SingI (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal sing :: Sing OptionSym0 # | |
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 (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing FromMaybeSym0 # | |
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing ElemIndexSym0 # | |
SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
SingI (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal sing :: Sing GetOptionSym0 # | |
SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid sing :: Sing GetFirstSym0 # | |
SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid sing :: Sing GetLastSym0 # | |
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing FindIndexSym0 # | |
SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> 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 sing :: Sing (FindIndexSym1 d) # | |
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (ElemIndexSym1 d) # | |
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (FromMaybeSym1 d) # | |
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing Maybe_Sym0 # | |
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing LookupSym0 # | |
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative sing :: Sing OptionalSym0 # | |
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing MapMaybeSym0 # | |
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing UnfoldrSym0 # | |
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SuppressUnusedWarnings (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680701092Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680701013Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Traverse_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
(SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal sing :: Sing (LookupSym1 d) # | |
(SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (Maybe_Sym1 d) # | |
SuppressUnusedWarnings (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe sing :: Sing (Maybe_Sym2 d1 d2) # | |
SuppressUnusedWarnings (LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
SuppressUnusedWarnings (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable suppressUnusedWarnings :: () # | |
IsoValue a => IsoValue (NamedF Maybe a name) | |
(HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (NamedF Maybe a name)) Source # | |
Wrappable (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable | |
Unwrappable (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable type Unwrappabled (NamedF Maybe a name) Source # | |
type Failure Maybe | |
Defined in Basement.Monad | |
type Product (arg :: Maybe a) | |
type Sum (arg :: Maybe a) | |
type Minimum (arg :: Maybe a) | |
type Maximum (arg :: Maybe a) | |
type Length (arg :: Maybe a) | |
type Null (arg :: Maybe a) | |
type ToList (arg :: Maybe a) | |
type Fold (arg :: Maybe m) | |
type Pure (a :: k1) | |
type Return (arg :: a) | |
type Sequence (arg :: Maybe (m a)) | |
type SequenceA (arg :: Maybe (f a)) | |
type Elem (arg1 :: a) (arg2 :: Maybe a) | |
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1) | |
type (a1 :: k1) <$ (a2 :: Maybe b) | |
type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1) | |
type (arg1 :: Maybe a) <* (arg2 :: Maybe b) | |
type (a2 :: Maybe a1) *> (a3 :: Maybe b) | |
type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1) | |
type (a2 :: Maybe a1) >> (a3 :: Maybe b) | |
type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b) | |
type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) | |
type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1) | |
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b) | |
type Apply (Pure_6989586621680072784Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680072790 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (Let6989586621680073051LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800721496989586621680073050 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679750104 :: a) | |
type Apply (Let6989586621680814063NSym1 x6989586621680814061 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814062 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680814063MSym1 x6989586621680814061 :: TyFun k (Maybe k1) -> Type) (y6989586621680814062 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680814087NSym1 x6989586621680814085 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680814086 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680814087MSym1 x6989586621680814085 :: TyFun k (Maybe k1) -> Type) (y6989586621680814086 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) (a6989586621680823006 :: a6989586621680822175) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) (a6989586621680823021 :: a6989586621680822176) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (Lambda_6989586621680701013Sym2 a6989586621680701011 k6989586621680701012 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701015 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Lambda_6989586621680701092Sym2 a6989586621680701090 k6989586621680701091 :: TyFun k1 (Maybe a) -> Type) (x6989586621680701094 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Let6989586621680822925MfSym3 f6989586621680822923 xs6989586621680822924 a6989586621680822926 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680822927 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (ShowsPrec_6989586621680653904Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680653914 :: Nat) | |
type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679959410 :: a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621679959410 :: a) = FromMaybeSym1 a6989586621679959410 | |
type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680379630 :: a) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680379630 :: a) = ElemIndexSym1 a6989586621680379630 | |
type Apply (TFHelper_6989586621680072673Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621680072678 :: a) | |
type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621679957844 :: b) | |
Defined in Data.Singletons.Prelude.Maybe | |
type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680379337 :: a) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680379337 :: a) = LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type | |
type Apply (Let6989586621680814063NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k) | |
type Apply (Let6989586621680814063MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814061 :: k1) | |
type Apply (Let6989586621680814087NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k) | |
type Apply (Let6989586621680814087MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680814085 :: k1) | |
type Apply (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type) (a_69895866216808229976989586621680823002 :: k) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823003MkJustSym0 :: TyFun k (TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type) -> Type) (a_69895866216808229976989586621680823002 :: k) = Let6989586621680823003MkJustSym1 a_69895866216808229976989586621680823002 :: TyFun a6989586621680822175 (Maybe a6989586621680822175) -> Type | |
type Apply (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type) (a_69895866216808230126989586621680823017 :: k) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680823018MkJustSym0 :: TyFun k (TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type) -> Type) (a_69895866216808230126989586621680823017 :: k) = Let6989586621680823018MkJustSym1 a_69895866216808230126989586621680823017 :: TyFun a6989586621680822176 (Maybe a6989586621680822176) -> Type | |
type Apply (Foldr_6989586621680823060Sym1 a6989586621680823066 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823067 :: b) | |
type Apply (Foldl_6989586621680823076Sym1 a6989586621680823082 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680823083 :: b) | |
type Apply (Lambda_6989586621680701013Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701011 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Lambda_6989586621680701092Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680701090 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
type Apply (Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680822903 :: k) | |
type Apply (Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680822924 :: k) | |
type Apply (Let6989586621680822904MfSym2 f6989586621680822902 xs6989586621680822903 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680822905 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Eval (FoldMap f ('Just x) :: a2 -> Type) | |
type Eval (FoldMap f ('Nothing :: Maybe a1) :: a2 -> Type) | |
type Eval (Foldr f y ('Just x) :: a2 -> Type) | |
type Eval (Foldr f y ('Nothing :: Maybe a1) :: a2 -> Type) | |
type Rep (Maybe a) | |
Defined in GHC.Generics | |
type MEmpty | |
Defined in Fcf.Class.Monoid | |
type Index (Maybe a) | |
Defined in Control.Lens.At | |
type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
type Element (Maybe a) | |
Defined in Universum.Container.Class | |
type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
data Sing (b :: Maybe a) | |
type TypeDocFieldDescriptions (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
type ToT (Maybe a) | |
Defined in Morley.Michelson.Typed.Haskell.Value | |
type Rep1 Maybe | |
type Mconcat (arg :: [Maybe a]) | |
type Show_ (arg :: Maybe a) | |
type Sconcat (arg :: NonEmpty (Maybe a)) | |
type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) | |
type ShowList (arg1 :: [Maybe a]) arg2 | |
type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
type Empty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Mzero | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
type Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) >= (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) > (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) <= (arg2 :: Maybe a) | |
type (arg1 :: Maybe a) < (arg2 :: Maybe a) | |
type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) | |
type (x :: Maybe a) /= (y :: Maybe a) | |
type (a2 :: Maybe a1) == (b :: Maybe a1) | |
Defined in Data.Singletons.Prelude.Eq | |
type HKD Maybe (a :: Type) | |
Defined in Data.Vinyl.XRec | |
type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
type Fail a2 | |
type (a2 :: Maybe a1) <|> (a3 :: Maybe a1) | |
type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) | |
type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1) | |
Defined in Fcf.Class.Monoid | |
type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679959420 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679959420 :: Maybe a) = FromJustSym1 a6989586621679959420 | |
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959424 :: Maybe a) = IsNothingSym1 a6989586621679959424 | |
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679959427 :: Maybe a) = IsJustSym1 a6989586621679959427 | |
type Apply (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type) (a6989586621679959411 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym1 a6989586621679959410 :: TyFun (Maybe a) a -> Type) (a6989586621679959411 :: Maybe a) = FromMaybeSym2 a6989586621679959410 a6989586621679959411 | |
type Apply (Compare_6989586621679848468Sym1 a6989586621679848473 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679848474 :: Maybe a) | |
type Apply (FoldMap_6989586621680823044Sym1 a6989586621680823053 :: TyFun (Maybe a) m -> Type) (a6989586621680823054 :: Maybe a) | |
type Apply (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type) (a6989586621679957846 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621679957844 a6989586621679957845 :: TyFun (Maybe a) b -> Type) (a6989586621679957846 :: Maybe a) = Maybe_Sym3 a6989586621679957844 a6989586621679957845 a6989586621679957846 | |
type Apply (Foldr_6989586621680823060Sym2 a6989586621680823066 a6989586621680823067 :: TyFun (Maybe a) b -> Type) (a6989586621680823068 :: Maybe a) | |
type Apply (Foldl_6989586621680823076Sym2 a6989586621680823082 a6989586621680823083 :: TyFun (Maybe a) b -> Type) (a6989586621680823084 :: Maybe a) | |
type ('Nothing :: Maybe a) <> (b :: Maybe a) | |
Defined in Fcf.Class.Monoid | |
type Apply (Fail_6989586621680156221Sym0 :: TyFun [Char] (Maybe a) -> Type) (a6989586621680156225 :: [Char]) | |
type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679959395 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679959395 :: [Maybe a]) = CatMaybesSym1 a6989586621679959395 | |
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679959401 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679959401 :: [a]) = ListToMaybeSym1 a6989586621679959401 | |
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679959405 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679959405 :: Maybe a) = MaybeToListSym1 a6989586621679959405 | |
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680812483 :: Maybe a) | |
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680812486 :: Maybe a) | |
type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680249994 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680249994 :: Maybe a) = OptionSym1 a6989586621680249994 | |
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680694787 :: Maybe a) | |
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680694814 :: Maybe a) | |
type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680249997 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680249997 :: Option a) = GetOptionSym1 a6989586621680249997 | |
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680694790 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680694790 :: First a) = GetFirstSym1 a6989586621680694790 | |
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680694817 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680694817 :: Last a) = GetLastSym1 a6989586621680694817 | |
type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680812493 :: MaxInternal a) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680812489 :: MinInternal a) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Apply (FindSym1 a6989586621680379639 :: TyFun [a] (Maybe a) -> Type) (a6989586621680379640 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379613 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym1 a6989586621680379612 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379613 :: [a]) = FindIndexSym2 a6989586621680379612 a6989586621680379613 | |
type Apply (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379631 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym1 a6989586621680379630 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680379631 :: [a]) = ElemIndexSym2 a6989586621680379630 a6989586621680379631 | |
type Apply (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680498962 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680498961 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680498962 :: [a]) = StripPrefixSym2 a6989586621680498961 a6989586621680498962 | |
type Apply (TFHelper_6989586621680073042Sym1 a6989586621680073047 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680073048 :: Maybe a) | |
type Apply (TFHelper_6989586621680240791Sym1 a6989586621680240796 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680240797 :: Maybe a) | |
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681492707 :: f a) | |
Defined in Data.Singletons.Prelude.Applicative type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681492707 :: f a) = OptionalSym1 a6989586621681492707 | |
type Apply (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680379338 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym1 a6989586621680379337 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680379338 :: [(a, b)]) = LookupSym2 a6989586621680379337 a6989586621680379338 | |
type Apply (Fmap_6989586621680072661Sym1 a6989586621680072666 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072667 :: Maybe a) | |
type Apply (TFHelper_6989586621680072673Sym1 a6989586621680072678 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680072679 :: Maybe b) | |
type Apply (TFHelper_6989586621680072794Sym1 a6989586621680072799 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680072800 :: Maybe a) | |
type Apply (TFHelper_6989586621680072821Sym1 a6989586621680072826 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072827 :: Maybe b) | |
type Apply (TFHelper_6989586621680072966Sym1 a6989586621680072975 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680072976 :: Maybe b) | |
type Apply (FindSym1 a6989586621680822510 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680822511 :: t a) | |
type Apply (Traverse_6989586621681088263Sym1 a6989586621681088268 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621681088269 :: Maybe a) | |
type Apply (LiftA2_6989586621680072807Sym2 a6989586621680072813 a6989586621680072814 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680072815 :: Maybe b) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
type Apply (Let6989586621680822904MfSym3 f6989586621680822902 xs6989586621680822903 a6989586621680822905 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680822906 :: Maybe k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Eval (Init '[a2] :: Maybe [a1] -> Type) | |
type Eval (Init ('[] :: [a]) :: Maybe [a] -> Type) | |
type Eval (Tail (_a ': as) :: Maybe [a] -> Type) | |
type Eval (Tail ('[] :: [a]) :: Maybe [a] -> Type) | |
type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) | |
type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) | |
type Eval (Head ('[] :: [a]) :: Maybe a -> Type) | |
type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) | |
type Eval (Last '[a2] :: Maybe a1 -> Type) | |
type Eval (Last ('[] :: [a]) :: Maybe a -> Type) | |
type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680498961 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680498961 :: [a]) = StripPrefixSym1 a6989586621680498961 | |
type Apply (TFHelper_6989586621680073042Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680073047 :: Maybe a) | |
type Apply (Compare_6989586621679848468Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679848473 :: Maybe a) | |
type Apply (TFHelper_6989586621680240791Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680240796 :: Maybe a) | |
type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1) | |
type Apply (ShowsPrec_6989586621680653904Sym1 a6989586621680653914 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680653915 :: Maybe a) | |
type Apply (TFHelper_6989586621680072821Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072826 :: Maybe a) | |
type Apply (TFHelper_6989586621680072955Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621680072960 :: Maybe a) | |
type Apply (TFHelper_6989586621680072966Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621680072975 :: Maybe a) | |
type Apply (TFHelper_6989586621680072794Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621680072799 :: Maybe (a ~> b)) | |
type Apply (LiftA2_6989586621680072807Sym1 a6989586621680072813 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621680072814 :: Maybe a) | |
type Apply (Let6989586621680822925MfSym2 f6989586621680822923 xs6989586621680822924 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680822926 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) | |
type Eval (FindIndex _p ('[] :: [a]) :: Maybe Nat -> Type) | |
type Eval (NumIter a s :: Maybe (k, Nat) -> Type) | |
type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) | |
type Eval (Find _p ('[] :: [a]) :: Maybe a -> Type) | |
type Eval (Lookup a as :: Maybe b -> Type) | |
type Eval (Map f ('Just a3) :: Maybe a2 -> Type) | |
type Eval (Map f ('Nothing :: Maybe a) :: Maybe b -> Type) | |
type Eval ('Just x <|> _1 :: Maybe a -> Type) | |
type Eval (('Nothing :: Maybe a) <|> m :: Maybe a -> Type) | |
type Apply (TFHelper_6989586621680072955Sym1 a6989586621680072960 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680072961 :: a ~> Maybe b) | |
type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680379639 :: a ~> Bool) | |
type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680379612 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
type Apply (Fmap_6989586621680072661Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621680072666 :: a ~> b) | |
type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679959380 :: a ~> Maybe b) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621679959380 :: a ~> Maybe b) = MapMaybeSym1 a6989586621679959380 | |
type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680380029 :: b ~> Maybe (a, b)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680380029 :: b ~> Maybe (a, b)) = UnfoldrSym1 a6989586621680380029 | |
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680822510 :: a ~> Bool) | |
type Apply (FoldMap_6989586621680823044Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680823053 :: a ~> m) | |
type Apply (Foldr_6989586621680823060Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823066 :: a ~> (b ~> b)) | |
type Apply (Foldl_6989586621680823076Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680823082 :: b ~> (a ~> b)) | |
type Apply (Traverse_6989586621681088263Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621681088268 :: a ~> f b) | |
type Apply (LiftA2_6989586621680072807Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621680072813 :: a ~> (b ~> c)) | |
type Apply (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679957845 :: a ~> b) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679957844 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621679957845 :: a ~> b) = Maybe_Sym2 a6989586621679957844 a6989586621679957845 | |
type Apply (Let6989586621679959385RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621679959382 :: a ~> Maybe k1) | |
type Apply (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680822902 :: k2 ~> (k3 ~> k2)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822904MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680822902 :: k2 ~> (k3 ~> k2)) = Let6989586621680822904MfSym1 f6989586621680822902 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type | |
type Apply (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680822923 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680822925MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680822923 :: k2 ~> (k3 ~> k3)) = Let6989586621680822925MfSym1 f6989586621680822923 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type | |
type Apply (Lambda_6989586621680701013Sym1 a6989586621680701011 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701012 :: k1 ~> First a) | |
type Apply (Lambda_6989586621680701092Sym1 a6989586621680701090 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680701091 :: k1 ~> Last a) | |
type ToT (NamedF Maybe a name) | |
type Unwrappabled (NamedF Maybe a name) Source # | |
Defined in Lorentz.Wrappable |
data ReadTicket a Source #
Value returned by READ_TICKET
instruction.
ReadTicket | |
|
Instances
data ContractRef arg #
Instances
newtype TAddress (p :: Type) (vd :: Type) Source #
Address which remembers the parameter and views types of the contract it refers to.
It differs from Michelson's contract
type because it cannot contain
entrypoint, and it always refers to entire contract parameter even if this
contract has explicit default entrypoint.
Instances
newtype FutureContract arg Source #
Address associated with value of contract arg
type.
Places where ContractRef
can appear are now severely limited,
this type gives you type-safety of ContractRef
but still can be used
everywhere.
This type is not a full-featured one rather a helper; in particular, once
pushing it on stack, you cannot return it back to Haskell world.
Note that it refers to an entrypoint of the contract, not just the contract
as a whole. In this sense this type differs from TAddress
.
Unlike with ContractRef
, having this type you still cannot be sure that
the referred contract exists and need to perform a lookup before calling it.
Instances
Instances
Eq arg => Eq (Ticket arg) | |
Show arg => Show (Ticket arg) | |
PolyTypeHasDocC '[a] => TypeHasDoc (Ticket a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc type TypeDocFieldDescriptions (Ticket a) :: FieldDescriptions # typeDocName :: Proxy (Ticket a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Ticket a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Ticket a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Ticket a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Ticket a) # | |
(Comparable (ToT a), IsoValue a) => IsoValue (Ticket a) | |
HasAnnotation d => HasAnnotation (Ticket d) Source # | |
Defined in Lorentz.Annotation getAnnotation :: FollowEntrypointFlag -> Notes (ToT (Ticket d)) Source # | |
NiceComparable d => NonZero (Ticket d) Source # | |
type TypeDocFieldDescriptions (Ticket a) | |
Defined in Morley.Michelson.Typed.Haskell.Doc | |
type ToT (Ticket a) | |
Defined in Morley.Michelson.Typed.Haskell.Value |
Instances
Instances
Instances
Instances
Eq EpName | |
Ord EpName | |
Show EpName | |
Generic EpName | |
ToJSON EpName | |
Defined in Morley.Michelson.Untyped.Entrypoints | |
FromJSON EpName | |
NFData EpName | |
Defined in Morley.Michelson.Untyped.Entrypoints | |
Buildable EpName | |
Defined in Morley.Michelson.Untyped.Entrypoints | |
HasCLReader EpName | |
Defined in Morley.Michelson.Untyped.Entrypoints getMetavar :: String | |
type Rep EpName | |
Defined in Morley.Michelson.Untyped.Entrypoints |
type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg) #
type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg) #
Custom datatypes
The type parameter should be an instance of HasResolution
.
Instances
Like Fixed
but with a Natural
value inside constructor
Instances
Datatypes, representing base of the fixed-point values
Instances
Instances
Constructors
mt :: QuasiQuoter #
Conversions
coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b #
callingAddress :: forall cp vd addr mname. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname) Source #
Generalization of callingTAddress
to any typed address.
callingDefAddress :: forall cp vd addr. (ToTAddress cp vd addr, NiceParameterFull cp) => addr -> ContractRef (GetDefaultEntrypointArg cp) Source #
Generalization of callingDefTAddress
to any typed address.
callingTAddress :: forall cp vd mname. NiceParameterFull cp => TAddress cp vd -> EntrypointRef mname -> ContractRef (GetEntrypointArgCustom cp mname) Source #
Deprecated: Use callingAddress
Turn TAddress
to ContractRef
in Haskell world.
This is an analogy of address
to contract
convertion in Michelson world,
thus you have to supply an entrypoint (or call the default one explicitly).
callingDefTAddress :: forall cp vd. NiceParameterFull cp => TAddress cp vd -> ContractRef (GetDefaultEntrypointArg cp) Source #
Deprecated: Use callingDefAddress
Specification of callingTAddress
to call the default entrypoint.
class ToAddress a where Source #
Convert something to Address
in Haskell world.
Use this when you want to access state of the contract and are not interested in calling it.
Instances
ToAddress EpAddress Source # | |
ToAddress Address Source # | |
ToAddress (ContractRef cp) Source # | |
Defined in Lorentz.Address toAddress :: ContractRef cp -> Address Source # | |
ToAddress (FutureContract cp) Source # | |
Defined in Lorentz.Address toAddress :: FutureContract cp -> Address Source # | |
ToAddress (TAddress cp vd) Source # | |
class ToTAddress (cp :: Type) (vd :: Type) (a :: Type) where Source #
Convert something referring to a contract (not specific entrypoint)
to TAddress
in Haskell world.
toTAddress :: a -> TAddress cp vd Source #
Instances
ToTAddress cp vd Address Source # | |
Defined in Lorentz.Address toTAddress :: Address -> TAddress cp vd Source # | |
(cp ~ cp', vd ~ vd') => ToTAddress cp vd (TAddress cp' vd') Source # | |
Defined in Lorentz.Address toTAddress :: TAddress cp' vd' -> TAddress cp vd Source # |
class ToContractRef (cp :: Type) (contract :: Type) where Source #
Convert something to ContractRef
in Haskell world.
toContractRef :: HasCallStack => contract -> ContractRef cp Source #
Instances
(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp') Source # | |
Defined in Lorentz.Address toContractRef :: FutureContract cp' -> ContractRef cp Source # | |
cp ~ cp' => ToContractRef cp (ContractRef cp') Source # | |
Defined in Lorentz.Address toContractRef :: ContractRef cp' -> ContractRef cp Source # | |
(FailWhen cond msg, cond ~ (CanHaveEntrypoints cp && Not (ParameterEntrypointsDerivation cp == EpdNone)), msg ~ (((('Text "Cannot apply `ToContractRef` to `TAddress`" :$$: 'Text "Consider using call(Def)TAddress first`") :$$: 'Text "(or if you know your parameter type is primitive,") :$$: 'Text " make sure typechecker also knows about that)") :$$: (('Text "For parameter `" :<>: 'ShowType cp) :<>: 'Text "`")), cp ~ arg, NiceParameter arg, NiceParameterFull cp, GetDefaultEntrypointArg cp ~ cp) => ToContractRef arg (TAddress cp vd) Source # | |
Defined in Lorentz.Address toContractRef :: TAddress cp vd -> ContractRef arg Source # |
class FromContractRef (cp :: Type) (contract :: Type) where Source #
Convert something from ContractRef
in Haskell world.
fromContractRef :: ContractRef cp -> contract Source #
Instances
FromContractRef cp Address Source # | |
Defined in Lorentz.Address fromContractRef :: ContractRef cp -> Address Source # | |
FromContractRef cp EpAddress Source # | |
Defined in Lorentz.Address fromContractRef :: ContractRef cp -> EpAddress Source # | |
cp ~ cp' => FromContractRef cp (FutureContract cp') Source # | |
Defined in Lorentz.Address fromContractRef :: ContractRef cp -> FutureContract cp' Source # | |
cp ~ cp' => FromContractRef cp (ContractRef cp') Source # | |
Defined in Lorentz.Address fromContractRef :: ContractRef cp -> ContractRef cp' Source # |
convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2 Source #
Misc
Conversion of values to readable String
s.
Derived instances of Show
have the following properties, which
are compatible with derived instances of Read
:
- The result of
show
is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used. - If the constructor is defined to be an infix operator, then
showsPrec
will produce infix applications of the constructor. - the representation will be enclosed in parentheses if the
precedence of the top-level constructor in
x
is less thand
(associativity is ignored). Thus, ifd
is0
then the result is never surrounded in parentheses; ifd
is11
it is always surrounded in parentheses, unless it is an atomic expression. - If the constructor is defined using record syntax, then
show
will produce the record-syntax form, with the fields given in the same order as the original declaration.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Show
is equivalent to
instance (Show a) => Show (Tree a) where showsPrec d (Leaf m) = showParen (d > app_prec) $ showString "Leaf " . showsPrec (app_prec+1) m where app_prec = 10 showsPrec d (u :^: v) = showParen (d > up_prec) $ showsPrec (up_prec+1) u . showString " :^: " . showsPrec (up_prec+1) v where up_prec = 5
Note that right-associativity of :^:
is ignored. For example,
produces the stringshow
(Leaf 1 :^: Leaf 2 :^: Leaf 3)"Leaf 1 :^: (Leaf 2 :^: Leaf 3)"
.
Instances
A class for types with a default value.
Nothing
Instances
data Label (name :: Symbol) where #
Label :: forall (name :: Symbol). KnownSymbol name => Label name |
Instances
(KnownSymbol name, s ~ name) => IsLabel s (Label name) | |
Defined in Morley.Util.Label | |
Eq (Label name) | |
Show (Label name) | |
Buildable (Label name) | |
Defined in Morley.Util.Label |
newtype PrintAsValue a Source #
Provides Buildable
instance that prints Lorentz value via Michelson's
Value
.
Result won't be very pretty, but this avoids requiring Show
or
Buildable
instances.
Instances
NiceUntypedValue a => Buildable (PrintAsValue a) Source # | |
Defined in Lorentz.Value build :: PrintAsValue a -> Builder # |