Safe Haskell	Safe-Inferred
Language	Haskell2010

Morley.Michelson.Typed

Synopsis

type Value = Value' Instr
data And
data T
- = TKey
- | TUnit
- | TSignature
- | TChainId
- | TOption T
- | TList T
- | TSet T
- | TOperation
- | TContract T
- | TTicket T
- | TPair T T
- | TOr T T
- | TLambda T T
- | TMap T T
- | TBigMap T T
- | TInt
- | TNat
- | TString
- | TBytes
- | TMutez
- | TBool
- | TKeyHash
- | TBls12381Fr
- | TBls12381G1
- | TBls12381G2
- | TTimestamp
- | TAddress
- | TChest
- | TChestKey
- | TSaplingState Peano
- | TSaplingTransaction Peano
- | TNever
data Not
data Xor
data Compare
class SingI (a :: k) where
- sing :: Sing a
newtype a :- b = Sub (a => Dict b)
data Sub
data Dict a where
- Dict :: forall a. a => Dict a
type View = View' Instr
data Or
data Mul
data Add
data Abs
data DType where
- DType :: TypeHasDoc a => Proxy a -> DType
data Neg
type Path = [Branch]
data Contract' instr cp st = (ParameterScope cp, StorageScope st) => Contract {
- cCode :: ContractCode' instr cp st
- cParamNotes :: ParamNotes cp
- cStoreNotes :: Notes st
- cViews :: ViewsSet' instr st
- cEntriesOrder :: EntriesOrder
}
data SomeContract where
- SomeContract :: Contract cp st -> SomeContract
type Contract = Contract' Instr
data Instr (inp :: [T]) (out :: [T]) where
- WithLoc :: ErrorSrcPos -> Instr a b -> Instr a b
- Meta :: SomeMeta -> Instr a b -> Instr a b
- Seq :: Instr a b -> Instr b c -> Instr a c
- Nop :: Instr s s
- Ext :: ExtInstr s -> Instr s s
- Nested :: Instr inp out -> Instr inp out
- DocGroup :: DocGrouping -> Instr inp out -> Instr inp out
- AnnCAR :: Anns '[VarAnn, FieldAnn] -> Instr ('TPair a b ': s) (a ': s)
- AnnCDR :: Anns '[VarAnn, FieldAnn] -> Instr ('TPair a b ': s) (b ': s)
- DROP :: Instr (a ': s) s
- DROPN :: forall (n :: Peano) s. RequireLongerOrSameLength s n => PeanoNatural n -> Instr s (Drop n s)
- AnnDUP :: DupableScope a => AnnVar -> Instr (a ': s) (a ': (a ': s))
- AnnDUPN :: forall (n :: Peano) inp out a. (ConstraintDUPN n inp out a, DupableScope a) => AnnVar -> PeanoNatural n -> Instr inp out
- SWAP :: Instr (a ': (b ': s)) (b ': (a ': s))
- DIG :: forall (n :: Peano) inp out a. ConstraintDIG n inp out a => PeanoNatural n -> Instr inp out
- DUG :: forall (n :: Peano) inp out a. ConstraintDUG n inp out a => PeanoNatural n -> Instr inp out
- AnnPUSH :: forall t s. ConstantScope t => Anns '[VarAnn, Notes t] -> Value' Instr t -> Instr s (t ': s)
- AnnSOME :: Anns '[TypeAnn, VarAnn] -> Instr (a ': s) ('TOption a ': s)
- AnnNONE :: forall a s. SingI a => Anns '[TypeAnn, VarAnn, Notes a] -> Instr s ('TOption a ': s)
- AnnUNIT :: Anns '[TypeAnn, VarAnn] -> Instr s ('TUnit ': s)
- IF_NONE :: Instr s s' -> Instr (a ': s) s' -> Instr ('TOption a ': s) s'
- AnnPAIR :: Anns '[TypeAnn, VarAnn, FieldAnn, FieldAnn] -> Instr (a ': (b ': s)) ('TPair a b ': s)
- AnnUNPAIR :: Anns '[VarAnn, VarAnn, FieldAnn, FieldAnn] -> Instr ('TPair a b ': s) (a ': (b ': s))
- AnnPAIRN :: forall n inp. ConstraintPairN n inp => AnnVar -> PeanoNatural n -> Instr inp (PairN n inp)
- UNPAIRN :: forall (n :: Peano) (pair :: T) (s :: [T]). ConstraintUnpairN n pair => PeanoNatural n -> Instr (pair : s) (UnpairN n pair ++ s)
- AnnLEFT :: SingI b => Anns '[TypeAnn, VarAnn, FieldAnn, FieldAnn, Notes b] -> Instr (a ': s) ('TOr a b ': s)
- AnnRIGHT :: SingI a => Anns '[TypeAnn, VarAnn, FieldAnn, FieldAnn, Notes a] -> Instr (b ': s) ('TOr a b ': s)
- IF_LEFT :: Instr (a ': s) s' -> Instr (b ': s) s' -> Instr ('TOr a b ': s) s'
- AnnNIL :: SingI p => Anns '[TypeAnn, VarAnn, Notes p] -> Instr s ('TList p ': s)
- AnnCONS :: AnnVar -> Instr (a ': ('TList a ': s)) ('TList a ': s)
- IF_CONS :: Instr (a ': ('TList a ': s)) s' -> Instr s s' -> Instr ('TList a ': s) s'
- AnnSIZE :: SizeOp c => AnnVar -> Instr (c ': s) ('TNat ': s)
- AnnEMPTY_SET :: Comparable e => Anns '[TypeAnn, VarAnn, Notes e] -> Instr s ('TSet e ': s)
- AnnEMPTY_MAP :: (SingI b, Comparable a) => Anns '[TypeAnn, VarAnn, Notes a, Notes b] -> Instr s ('TMap a b ': s)
- AnnEMPTY_BIG_MAP :: (SingI b, Comparable a, ForbidBigMap b) => Anns '[TypeAnn, VarAnn, Notes a, Notes b] -> Instr s ('TBigMap a b ': s)
- AnnMAP :: (MapOp c, SingI b) => AnnVar -> Instr (MapOpInp c ': s) (b ': s) -> Instr (c ': s) (MapOpRes c b ': s)
- ITER :: IterOp c => Instr (IterOpEl c ': s) s -> Instr (c ': s) s
- AnnMEM :: MemOp c => AnnVar -> Instr (MemOpKey c ': (c ': s)) ('TBool ': s)
- AnnGET :: (GetOp c, SingI (GetOpVal c)) => AnnVar -> Instr (GetOpKey c ': (c ': s)) ('TOption (GetOpVal c) ': s)
- AnnGETN :: forall (ix :: Peano) (pair :: T) (s :: [T]). ConstraintGetN ix pair => AnnVar -> PeanoNatural ix -> Instr (pair : s) (GetN ix pair ': s)
- AnnUPDATE :: UpdOp c => AnnVar -> Instr (UpdOpKey c ': (UpdOpParams c ': (c ': s))) (c ': s)
- AnnUPDATEN :: forall (ix :: Peano) (val :: T) (pair :: T) (s :: [T]). ConstraintUpdateN ix pair => AnnVar -> PeanoNatural ix -> Instr (val : (pair : s)) (UpdateN ix val pair ': s)
- AnnGET_AND_UPDATE :: (GetOp c, UpdOp c, SingI (GetOpVal c), UpdOpKey c ~ GetOpKey c) => AnnVar -> Instr (UpdOpKey c ': (UpdOpParams c ': (c ': s))) ('TOption (GetOpVal c) : (c ': s))
- IF :: Instr s s' -> Instr s s' -> Instr ('TBool ': s) s'
- LOOP :: Instr s ('TBool ': s) -> Instr ('TBool ': s) s
- LOOP_LEFT :: Instr (a ': s) ('TOr a b ': s) -> Instr ('TOr a b ': s) (b ': s)
- AnnLAMBDA :: forall i o s. (SingI i, SingI o) => Anns '[VarAnn, Notes i, Notes o] -> RemFail Instr '[i] '[o] -> Instr s ('TLambda i o ': s)
- AnnLAMBDA_REC :: forall i o s. (SingI i, SingI o) => Anns '[VarAnn, Notes i, Notes o] -> RemFail Instr '[i, 'TLambda i o] '[o] -> Instr s ('TLambda i o ': s)
- AnnEXEC :: AnnVar -> Instr (t1 ': ('TLambda t1 t2 ': s)) (t2 ': s)
- AnnAPPLY :: forall a b c s. (ConstantScope a, SingI b) => AnnVar -> Instr (a ': ('TLambda ('TPair a b) c ': s)) ('TLambda b c ': s)
- DIP :: Instr a c -> Instr (b ': a) (b ': c)
- DIPN :: forall (n :: Peano) inp out s s'. ConstraintDIPN n inp out s s' => PeanoNatural n -> Instr s s' -> Instr inp out
- FAILWITH :: (SingI a, ConstantScope a) => Instr (a ': s) t
- AnnCAST :: forall a s. SingI a => Anns '[VarAnn, Notes a] -> Instr (a ': s) (a ': s)
- AnnRENAME :: AnnVar -> Instr (a ': s) (a ': s)
- AnnPACK :: PackedValScope a => AnnVar -> Instr (a ': s) ('TBytes ': s)
- AnnUNPACK :: (UnpackedValScope a, SingI a) => Anns '[TypeAnn, VarAnn, Notes a] -> Instr ('TBytes ': s) ('TOption a ': s)
- AnnCONCAT :: ConcatOp c => AnnVar -> Instr (c ': (c ': s)) (c ': s)
- AnnCONCAT' :: ConcatOp c => AnnVar -> Instr ('TList c ': s) (c ': s)
- AnnSLICE :: (SliceOp c, SingI c) => AnnVar -> Instr ('TNat ': ('TNat ': (c ': s))) ('TOption c ': s)
- AnnISNAT :: AnnVar -> Instr ('TInt ': s) ('TOption 'TNat ': s)
- AnnADD :: ArithOp Add n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes Add n m ': s)
- AnnSUB :: ArithOp Sub n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes Sub n m ': s)
- AnnSUB_MUTEZ :: AnnVar -> Instr ('TMutez ': ('TMutez ': s)) ('TOption 'TMutez ': s)
- AnnMUL :: ArithOp Mul n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes Mul n m ': s)
- AnnEDIV :: ArithOp EDiv n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes EDiv n m ': s)
- AnnABS :: UnaryArithOp Abs n => AnnVar -> Instr (n ': s) (UnaryArithRes Abs n ': s)
- AnnNEG :: UnaryArithOp Neg n => AnnVar -> Instr (n ': s) (UnaryArithRes Neg n ': s)
- AnnLSL :: ArithOp Lsl n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes Lsl n m ': s)
- AnnLSR :: ArithOp Lsr n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes Lsr n m ': s)
- AnnOR :: ArithOp Or n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes Or n m ': s)
- AnnAND :: ArithOp And n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes And n m ': s)
- AnnXOR :: ArithOp Xor n m => AnnVar -> Instr (n ': (m ': s)) (ArithRes Xor n m ': s)
- AnnNOT :: (SingI n, UnaryArithOp Not n) => AnnVar -> Instr (n ': s) (UnaryArithRes Not n ': s)
- AnnCOMPARE :: Comparable n => AnnVar -> Instr (n ': (n ': s)) ('TInt ': s)
- AnnEQ :: UnaryArithOp Eq' n => AnnVar -> Instr (n ': s) (UnaryArithRes Eq' n ': s)
- AnnNEQ :: UnaryArithOp Neq n => AnnVar -> Instr (n ': s) (UnaryArithRes Neq n ': s)
- AnnLT :: UnaryArithOp Lt n => AnnVar -> Instr (n ': s) (UnaryArithRes Lt n ': s)
- AnnGT :: UnaryArithOp Gt n => AnnVar -> Instr (n ': s) (UnaryArithRes Gt n ': s)
- AnnLE :: UnaryArithOp Le n => AnnVar -> Instr (n ': s) (UnaryArithRes Le n ': s)
- AnnGE :: UnaryArithOp Ge n => AnnVar -> Instr (n ': s) (UnaryArithRes Ge n ': s)
- AnnINT :: ToIntArithOp n => AnnVar -> Instr (n ': s) ('TInt ': s)
- AnnBYTES :: ToBytesArithOp n => AnnVar -> Instr (n ': s) ('TBytes ': s)
- AnnNAT :: AnnVar -> Instr ('TBytes ': s) ('TNat ': s)
- AnnVIEW :: (SingI arg, ViewableScope ret) => Anns '[VarAnn, Notes ret] -> ViewName -> Instr (arg ': ('TAddress ': s)) ('TOption ret ': s)
- AnnSELF :: forall (arg :: T) s. (ParameterScope arg, IsNotInView) => AnnVar -> SomeEntrypointCallT arg -> Instr s ('TContract arg ': s)
- AnnCONTRACT :: ParameterScope p => Anns '[VarAnn, Notes p] -> EpName -> Instr ('TAddress ': s) ('TOption ('TContract p) ': s)
- AnnTRANSFER_TOKENS :: (ParameterScope p, IsNotInView) => AnnVar -> Instr (p ': ('TMutez ': ('TContract p ': s))) ('TOperation ': s)
- AnnSET_DELEGATE :: IsNotInView => AnnVar -> Instr ('TOption 'TKeyHash ': s) ('TOperation ': s)
- AnnCREATE_CONTRACT :: (ParameterScope p, StorageScope g, IsNotInView) => Anns '[VarAnn, VarAnn] -> Contract' Instr p g -> Instr ('TOption 'TKeyHash ': ('TMutez ': (g ': s))) ('TOperation ': ('TAddress ': s))
- AnnIMPLICIT_ACCOUNT :: AnnVar -> Instr ('TKeyHash ': s) ('TContract 'TUnit ': s)
- AnnNOW :: AnnVar -> Instr s ('TTimestamp ': s)
- AnnAMOUNT :: AnnVar -> Instr s ('TMutez ': s)
- AnnBALANCE :: AnnVar -> Instr s ('TMutez ': s)
- AnnVOTING_POWER :: AnnVar -> Instr ('TKeyHash ': s) ('TNat ': s)
- AnnTOTAL_VOTING_POWER :: AnnVar -> Instr s ('TNat ': s)
- AnnCHECK_SIGNATURE :: AnnVar -> Instr ('TKey ': ('TSignature ': ('TBytes ': s))) ('TBool ': s)
- AnnSHA256 :: AnnVar -> Instr ('TBytes ': s) ('TBytes ': s)
- AnnSHA512 :: AnnVar -> Instr ('TBytes ': s) ('TBytes ': s)
- AnnBLAKE2B :: AnnVar -> Instr ('TBytes ': s) ('TBytes ': s)
- AnnSHA3 :: AnnVar -> Instr ('TBytes ': s) ('TBytes ': s)
- AnnKECCAK :: AnnVar -> Instr ('TBytes ': s) ('TBytes ': s)
- AnnHASH_KEY :: AnnVar -> Instr ('TKey ': s) ('TKeyHash ': s)
- AnnPAIRING_CHECK :: AnnVar -> Instr ('TList ('TPair 'TBls12381G1 'TBls12381G2) ': s) ('TBool ': s)
- AnnSOURCE :: AnnVar -> Instr s ('TAddress ': s)
- AnnSENDER :: AnnVar -> Instr s ('TAddress ': s)
- AnnADDRESS :: AnnVar -> Instr ('TContract a ': s) ('TAddress ': s)
- AnnCHAIN_ID :: AnnVar -> Instr s ('TChainId ': s)
- AnnLEVEL :: AnnVar -> Instr s ('TNat ': s)
- AnnSELF_ADDRESS :: AnnVar -> Instr s ('TAddress ': s)
- NEVER :: Instr ('TNever ': s) t
- AnnTICKET_DEPRECATED :: Comparable a => AnnVar -> Instr (a ': ('TNat ': s)) ('TTicket a ': s)
- AnnTICKET :: Comparable a => AnnVar -> Instr (a ': ('TNat ': s)) ('TOption ('TTicket a) ': s)
- AnnREAD_TICKET :: AnnVar -> Instr ('TTicket a ': s) (RightComb ['TAddress, a, 'TNat] ': ('TTicket a ': s))
- AnnSPLIT_TICKET :: AnnVar -> Instr ('TTicket a ': ('TPair 'TNat 'TNat ': s)) ('TOption ('TPair ('TTicket a) ('TTicket a)) ': s)
- AnnJOIN_TICKETS :: AnnVar -> Instr ('TPair ('TTicket a) ('TTicket a) ': s) ('TOption ('TTicket a) ': s)
- AnnOPEN_CHEST :: AnnVar -> Instr ('TChestKey ': ('TChest ': ('TNat ': s))) ('TOr 'TBytes 'TBool ': s)
- AnnSAPLING_EMPTY_STATE :: AnnVar -> Sing n -> Instr s ('TSaplingState n ': s)
- AnnSAPLING_VERIFY_UPDATE :: AnnVar -> Instr ('TSaplingTransaction n : ('TSaplingState n ': s)) ('TOption ('TPair 'TBytes ('TPair 'TInt ('TSaplingState n))) ': s)
- AnnMIN_BLOCK_TIME :: [AnyAnn] -> Instr s ('TNat ': s)
- AnnEMIT :: PackedValScope t => AnnVar -> FieldAnn -> Maybe (Notes t) -> Instr (t ': s) ('TOperation : s)
- pattern NAT :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TBytes s, out ~ '(:) 'TNat s) => Instr inp out
- pattern BYTES :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) 'TBytes s, ToBytesArithOp n) => Instr inp out
- pattern EMIT :: forall {inp} {out}. () => forall (t :: T) (s :: [T]). (inp ~ '(:) t s, out ~ '(:) 'TOperation s, PackedValScope t) => FieldAnn -> Maybe (Notes t) -> Instr inp out
- pattern MIN_BLOCK_TIME :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TNat s) => Instr inp out
- pattern SAPLING_VERIFY_UPDATE :: forall {inp} {out}. () => forall (n :: Peano) (s :: [T]). (inp ~ '(:) ('TSaplingTransaction n) ('(:) ('TSaplingState n) s), out ~ '(:) ('TOption ('TPair 'TBytes ('TPair 'TInt ('TSaplingState n)))) s) => Instr inp out
- pattern SAPLING_EMPTY_STATE :: forall {inp} {out}. () => forall (n :: Peano) (s :: [T]). (inp ~ s, out ~ '(:) ('TSaplingState n) s) => Sing n -> Instr inp out
- pattern OPEN_CHEST :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TChestKey ('(:) 'TChest ('(:) 'TNat s)), out ~ '(:) ('TOr 'TBytes 'TBool) s) => Instr inp out
- pattern JOIN_TICKETS :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) ('TPair ('TTicket a) ('TTicket a)) s, out ~ '(:) ('TOption ('TTicket a)) s) => Instr inp out
- pattern SPLIT_TICKET :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) ('TTicket a) ('(:) ('TPair 'TNat 'TNat) s), out ~ '(:) ('TOption ('TPair ('TTicket a) ('TTicket a))) s) => Instr inp out
- pattern READ_TICKET :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) ('TTicket a) s, out ~ '(:) (RightComb ('(:) 'TAddress ('(:) a ('(:) 'TNat ('[] :: [T]))))) ('(:) ('TTicket a) s)) => Instr inp out
- pattern TICKET_DEPRECATED :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a ('(:) 'TNat s), out ~ '(:) ('TTicket a) s, Comparable a) => Instr inp out
- pattern TICKET :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a ('(:) 'TNat s), out ~ '(:) ('TOption ('TTicket a)) s, Comparable a) => Instr inp out
- pattern SELF_ADDRESS :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TAddress s) => Instr inp out
- pattern LEVEL :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TNat s) => Instr inp out
- pattern CHAIN_ID :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TChainId s) => Instr inp out
- pattern ADDRESS :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) ('TContract a) s, out ~ '(:) 'TAddress s) => Instr inp out
- pattern SENDER :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TAddress s) => Instr inp out
- pattern SOURCE :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TAddress s) => Instr inp out
- pattern PAIRING_CHECK :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) ('TList ('TPair 'TBls12381G1 'TBls12381G2)) s, out ~ '(:) 'TBool s) => Instr inp out
- pattern HASH_KEY :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TKey s, out ~ '(:) 'TKeyHash s) => Instr inp out
- pattern KECCAK :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TBytes s, out ~ '(:) 'TBytes s) => Instr inp out
- pattern SHA3 :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TBytes s, out ~ '(:) 'TBytes s) => Instr inp out
- pattern BLAKE2B :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TBytes s, out ~ '(:) 'TBytes s) => Instr inp out
- pattern CHECK_SIGNATURE :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TKey ('(:) 'TSignature ('(:) 'TBytes s)), out ~ '(:) 'TBool s) => Instr inp out
- pattern TOTAL_VOTING_POWER :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TNat s) => Instr inp out
- pattern VOTING_POWER :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TKeyHash s, out ~ '(:) 'TNat s) => Instr inp out
- pattern BALANCE :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TMutez s) => Instr inp out
- pattern AMOUNT :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TMutez s) => Instr inp out
- pattern NOW :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TTimestamp s) => Instr inp out
- pattern IMPLICIT_ACCOUNT :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TKeyHash s, out ~ '(:) ('TContract 'TUnit) s) => Instr inp out
- pattern CREATE_CONTRACT :: forall {inp} {out}. () => forall (p :: T) (g :: T) (s :: [T]). (inp ~ '(:) ('TOption 'TKeyHash) ('(:) 'TMutez ('(:) g s)), out ~ '(:) 'TOperation ('(:) 'TAddress s), ParameterScope p, StorageScope g, IsNotInView) => Contract' Instr p g -> Instr inp out
- pattern SET_DELEGATE :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) ('TOption 'TKeyHash) s, out ~ '(:) 'TOperation s, IsNotInView) => Instr inp out
- pattern TRANSFER_TOKENS :: forall {inp} {out}. () => forall (p :: T) (s :: [T]). (inp ~ '(:) p ('(:) 'TMutez ('(:) ('TContract p) s)), out ~ '(:) 'TOperation s, ParameterScope p, IsNotInView) => Instr inp out
- pattern CONTRACT :: forall {inp} {out}. () => forall (p :: T) (s :: [T]). (inp ~ '(:) 'TAddress s, out ~ '(:) ('TOption ('TContract p)) s, ParameterScope p) => EpName -> Instr inp out
- pattern SELF :: forall {inp} {out}. () => forall (arg :: T) (s :: [T]). (inp ~ s, out ~ '(:) ('TContract arg) s, ParameterScope arg, IsNotInView) => SomeEntrypointCallT arg -> Instr inp out
- pattern VIEW :: forall {inp} {out}. () => forall (arg :: T) (ret :: T) (s :: [T]). (inp ~ '(:) arg ('(:) 'TAddress s), out ~ '(:) ('TOption ret) s, SingI arg, ViewableScope ret) => ViewName -> Instr inp out
- pattern INT :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) 'TInt s, ToIntArithOp n) => Instr inp out
- pattern NEQ :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Neq n) s, UnaryArithOp Neq n) => Instr inp out
- pattern COMPARE :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n ('(:) n s), out ~ '(:) 'TInt s, Comparable n) => Instr inp out
- pattern NOT :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Not n) s, SingI n, UnaryArithOp Not n) => Instr inp out
- pattern XOR :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes Xor n m) s, ArithOp Xor n m) => Instr inp out
- pattern AND :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes And n m) s, ArithOp And n m) => Instr inp out
- pattern OR :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes Or n m) s, ArithOp Or n m) => Instr inp out
- pattern LSR :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes Lsr n m) s, ArithOp Lsr n m) => Instr inp out
- pattern LSL :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes Lsl n m) s, ArithOp Lsl n m) => Instr inp out
- pattern NEG :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Neg n) s, UnaryArithOp Neg n) => Instr inp out
- pattern ABS :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Abs n) s, UnaryArithOp Abs n) => Instr inp out
- pattern EDIV :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes EDiv n m) s, ArithOp EDiv n m) => Instr inp out
- pattern MUL :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes Mul n m) s, ArithOp Mul n m) => Instr inp out
- pattern SUB_MUTEZ :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TMutez ('(:) 'TMutez s), out ~ '(:) ('TOption 'TMutez) s) => Instr inp out
- pattern SUB :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes Sub n m) s, ArithOp Sub n m) => Instr inp out
- pattern ADD :: forall {inp} {out}. () => forall (n :: T) (m :: T) (s :: [T]). (inp ~ '(:) n ('(:) m s), out ~ '(:) (ArithRes Add n m) s, ArithOp Add n m) => Instr inp out
- pattern ISNAT :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TInt s, out ~ '(:) ('TOption 'TNat) s) => Instr inp out
- pattern SLICE :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) 'TNat ('(:) 'TNat ('(:) c s)), out ~ '(:) ('TOption c) s, SliceOp c, SingI c) => Instr inp out
- pattern CONCAT' :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) ('TList c) s, out ~ '(:) c s, ConcatOp c) => Instr inp out
- pattern CONCAT :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) c ('(:) c s), out ~ '(:) c s, ConcatOp c) => Instr inp out
- pattern UNPACK :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) 'TBytes s, out ~ '(:) ('TOption a) s, UnpackedValScope a, SingI a) => Instr inp out
- pattern PACK :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a s, out ~ '(:) 'TBytes s, PackedValScope a) => Instr inp out
- pattern RENAME :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a s, out ~ '(:) a s) => Instr inp out
- pattern CAST :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a s, out ~ '(:) a s, SingI a) => Instr inp out
- pattern APPLY :: forall {inp} {out}. () => forall (a :: T) (b :: T) (c :: T) (s :: [T]). (inp ~ '(:) a ('(:) ('TLambda ('TPair a b) c) s), out ~ '(:) ('TLambda b c) s, ConstantScope a, SingI b) => Instr inp out
- pattern EXEC :: forall {inp} {out}. () => forall (t1 :: T) (t2 :: T) (s :: [T]). (inp ~ '(:) t1 ('(:) ('TLambda t1 t2) s), out ~ '(:) t2 s) => Instr inp out
- pattern LAMBDA_REC :: forall s r. () => forall i o. (SingI i, SingI o, r ~ ('TLambda i o ': s)) => (IsNotInView => RemFail Instr '[i, 'TLambda i o] '[o]) -> Instr s r
- pattern LAMBDA :: forall s r. () => forall i o. (SingI i, SingI o, r ~ ('TLambda i o ': s)) => (IsNotInView => RemFail Instr '[i] '[o]) -> Instr s r
- pattern GET_AND_UPDATE :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) (UpdOpKey c) ('(:) (UpdOpParams c) ('(:) c s)), out ~ '(:) ('TOption (GetOpVal c)) ('(:) c s), GetOp c, UpdOp c, SingI (GetOpVal c), (~) (UpdOpKey c) (GetOpKey c)) => Instr inp out
- pattern UPDATEN :: forall {inp} {out}. () => forall (ix :: Peano) (val :: T) (pair :: T) (s :: [T]). (inp ~ '(:) val ('(:) pair s), out ~ '(:) (UpdateN ix val pair) s, ConstraintUpdateN ix pair) => PeanoNatural ix -> Instr inp out
- pattern UPDATE :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) (UpdOpKey c) ('(:) (UpdOpParams c) ('(:) c s)), out ~ '(:) c s, UpdOp c) => Instr inp out
- pattern GETN :: forall {inp} {out}. () => forall (ix :: Peano) (pair :: T) (s :: [T]). (inp ~ '(:) pair s, out ~ '(:) (GetN ix pair) s, ConstraintGetN ix pair) => PeanoNatural ix -> Instr inp out
- pattern GET :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) (GetOpKey c) ('(:) c s), out ~ '(:) ('TOption (GetOpVal c)) s, GetOp c, SingI (GetOpVal c)) => Instr inp out
- pattern MEM :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) (MemOpKey c) ('(:) c s), out ~ '(:) 'TBool s, MemOp c) => Instr inp out
- pattern MAP :: forall {inp} {out}. () => forall (c :: T) (b :: T) (s :: [T]). (inp ~ '(:) c s, out ~ '(:) (MapOpRes c b) s, MapOp c, SingI b) => Instr ('(:) (MapOpInp c) s) ('(:) b s) -> Instr inp out
- pattern EMPTY_BIG_MAP :: forall {inp} {out}. () => forall (b :: T) (a :: T) (s :: [T]). (inp ~ s, out ~ '(:) ('TBigMap a b) s, SingI b, Comparable a, ForbidBigMap b) => Instr inp out
- pattern EMPTY_MAP :: forall {inp} {out}. () => forall (b :: T) (a :: T) (s :: [T]). (inp ~ s, out ~ '(:) ('TMap a b) s, SingI b, Comparable a) => Instr inp out
- pattern EMPTY_SET :: forall {inp} {out}. () => forall (e :: T) (s :: [T]). (inp ~ s, out ~ '(:) ('TSet e) s, Comparable e) => Instr inp out
- pattern SIZE :: forall {inp} {out}. () => forall (c :: T) (s :: [T]). (inp ~ '(:) c s, out ~ '(:) 'TNat s, SizeOp c) => Instr inp out
- pattern CONS :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a ('(:) ('TList a) s), out ~ '(:) ('TList a) s) => Instr inp out
- pattern NIL :: forall {inp} {out}. () => forall (p :: T) (s :: [T]). (inp ~ s, out ~ '(:) ('TList p) s, SingI p) => Instr inp out
- pattern RIGHT :: forall {inp} {out}. () => forall (a :: T) (b :: T) (s :: [T]). (inp ~ '(:) b s, out ~ '(:) ('TOr a b) s, SingI a) => Instr inp out
- pattern LEFT :: forall {inp} {out}. () => forall (b :: T) (a :: T) (s :: [T]). (inp ~ '(:) a s, out ~ '(:) ('TOr a b) s, SingI b) => Instr inp out
- pattern PAIRN :: forall {inp} {out}. () => forall (n :: Peano) (inp :: [T]). (inp ~ inp, out ~ PairN n inp, ConstraintPairN n inp) => PeanoNatural n -> Instr inp out
- pattern UNPAIR :: forall {inp} {out}. () => forall (a :: T) (b :: T) (s :: [T]). (inp ~ '(:) ('TPair a b) s, out ~ '(:) a ('(:) b s)) => Instr inp out
- pattern PAIR :: forall {inp} {out}. () => forall (a :: T) (b :: T) (s :: [T]). (inp ~ '(:) a ('(:) b s), out ~ '(:) ('TPair a b) s) => Instr inp out
- pattern UNIT :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ s, out ~ '(:) 'TUnit s) => Instr inp out
- pattern SOME :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a s, out ~ '(:) ('TOption a) s) => Instr inp out
- pattern PUSH :: forall {inp} {out}. () => forall (t :: T) (s :: [T]). (inp ~ s, out ~ '(:) t s, ConstantScope t) => Value' Instr t -> Instr inp out
- pattern DUPN :: forall {inp} {out}. () => forall (n :: Peano) (inp :: [T]) (out :: [T]) (a :: T). (inp ~ inp, out ~ out, ConstraintDUPN n inp out a, DupableScope a) => PeanoNatural n -> Instr inp out
- pattern DUP :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ '(:) a s, out ~ '(:) a ('(:) a s), DupableScope a) => Instr inp out
- pattern CDR :: forall {inp} {out}. () => forall (a :: T) (b :: T) (s :: [T]). (inp ~ '(:) ('TPair a b) s, out ~ '(:) b s) => Instr inp out
- pattern CAR :: forall {inp} {out}. () => forall (a :: T) (b :: T) (s :: [T]). (inp ~ '(:) ('TPair a b) s, out ~ '(:) a s) => Instr inp out
- pattern GE :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Ge n) s, UnaryArithOp Ge n) => Instr inp out
- pattern SHA256 :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TBytes s, out ~ '(:) 'TBytes s) => Instr inp out
- pattern SHA512 :: forall {inp} {out}. () => forall (s :: [T]). (inp ~ '(:) 'TBytes s, out ~ '(:) 'TBytes s) => Instr inp out
- pattern LE :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Le n) s, UnaryArithOp Le n) => Instr inp out
- pattern NONE :: forall {inp} {out}. () => forall (a :: T) (s :: [T]). (inp ~ s, out ~ '(:) ('TOption a) s, SingI a) => Instr inp out
- pattern EQ :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Eq' n) s, UnaryArithOp Eq' n) => Instr inp out
- pattern GT :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Gt n) s, UnaryArithOp Gt n) => Instr inp out
- pattern LT :: forall {inp} {out}. () => forall (n :: T) (s :: [T]). (inp ~ '(:) n s, out ~ '(:) (UnaryArithRes Lt n) s, UnaryArithOp Lt n) => Instr inp out
newtype EpName = UnsafeEpName {
- unEpName :: Text
}
type ForbidOp = ForbidT 'PSOp
data LambdaCode' instr inp out where
- LambdaCode :: (forall i o. Show (instr i o), forall i o. Eq (instr i o), forall i o. NFData (instr i o)) => RemFail instr (inp ': '[]) (out ': '[]) -> LambdaCode' instr inp out
- LambdaCodeRec :: (forall i o. Show (instr i o), forall i o. Eq (instr i o), forall i o. NFData (instr i o)) => RemFail instr (inp ': ('TLambda inp out ': '[])) (out ': '[]) -> LambdaCode' instr inp out
data Notes t where
- NTKey :: TypeAnn -> Notes 'TKey
- NTUnit :: TypeAnn -> Notes 'TUnit
- NTSignature :: TypeAnn -> Notes 'TSignature
- NTChainId :: TypeAnn -> Notes 'TChainId
- NTOption :: TypeAnn -> Notes t -> Notes ('TOption t)
- NTList :: TypeAnn -> Notes t -> Notes ('TList t)
- NTSet :: TypeAnn -> Notes t -> Notes ('TSet t)
- NTOperation :: TypeAnn -> Notes 'TOperation
- NTContract :: TypeAnn -> Notes t -> Notes ('TContract t)
- NTTicket :: TypeAnn -> Notes t -> Notes ('TTicket t)
- NTPair :: TypeAnn -> FieldAnn -> FieldAnn -> VarAnn -> VarAnn -> Notes p -> Notes q -> Notes ('TPair p q)
- NTOr :: TypeAnn -> FieldAnn -> FieldAnn -> Notes p -> Notes q -> Notes ('TOr p q)
- NTLambda :: TypeAnn -> Notes p -> Notes q -> Notes ('TLambda p q)
- NTMap :: TypeAnn -> Notes k -> Notes v -> Notes ('TMap k v)
- NTBigMap :: TypeAnn -> Notes k -> Notes v -> Notes ('TBigMap k v)
- NTInt :: TypeAnn -> Notes 'TInt
- NTNat :: TypeAnn -> Notes 'TNat
- NTString :: TypeAnn -> Notes 'TString
- NTBytes :: TypeAnn -> Notes 'TBytes
- NTMutez :: TypeAnn -> Notes 'TMutez
- NTBool :: TypeAnn -> Notes 'TBool
- NTKeyHash :: TypeAnn -> Notes 'TKeyHash
- NTBls12381Fr :: TypeAnn -> Notes 'TBls12381Fr
- NTBls12381G1 :: TypeAnn -> Notes 'TBls12381G1
- NTBls12381G2 :: TypeAnn -> Notes 'TBls12381G2
- NTTimestamp :: TypeAnn -> Notes 'TTimestamp
- NTAddress :: TypeAnn -> Notes 'TAddress
- NTChest :: TypeAnn -> Notes 'TChest
- NTChestKey :: TypeAnn -> Notes 'TChestKey
- NTNever :: TypeAnn -> Notes 'TNever
- NTSaplingState :: forall (n :: Peano). TypeAnn -> Sing n -> Notes ('TSaplingState n)
- NTSaplingTransaction :: forall (n :: Peano). TypeAnn -> Sing n -> Notes ('TSaplingTransaction n)
data Value' instr t where
- VKey :: PublicKey -> Value' instr 'TKey
- VUnit :: Value' instr 'TUnit
- VSignature :: Signature -> Value' instr 'TSignature
- VChainId :: ChainId -> Value' instr 'TChainId
- VOption :: forall t instr. SingI t => Maybe (Value' instr t) -> Value' instr ('TOption t)
- VList :: forall t instr. SingI t => [Value' instr t] -> Value' instr ('TList t)
- VSet :: forall t instr. Comparable t => Set (Value' instr t) -> Value' instr ('TSet t)
- VOp :: Operation' instr -> Value' instr 'TOperation
- VContract :: forall arg instr. (SingI arg, ForbidOp arg) => Address -> SomeEntrypointCallT arg -> Value' instr ('TContract arg)
- VTicket :: forall arg instr. Comparable arg => Address -> Value' instr arg -> Natural -> Value' instr ('TTicket arg)
- VPair :: forall l r instr. (Value' instr l, Value' instr r) -> Value' instr ('TPair l r)
- VOr :: forall l r instr. (SingI l, SingI r) => Either (Value' instr l) (Value' instr r) -> Value' instr ('TOr l r)
- VLam :: forall inp out instr. (SingI inp, SingI out) => LambdaCode' instr inp out -> Value' instr ('TLambda inp out)
- VMap :: forall k v instr. (SingI v, Comparable k) => Map (Value' instr k) (Value' instr v) -> Value' instr ('TMap k v)
- VBigMap :: forall k v instr. (SingI v, Comparable k, ForbidBigMap v) => Maybe Natural -> Map (Value' instr k) (Value' instr v) -> Value' instr ('TBigMap k v)
- VInt :: Integer -> Value' instr 'TInt
- VNat :: Natural -> Value' instr 'TNat
- VString :: MText -> Value' instr 'TString
- VBytes :: ByteString -> Value' instr 'TBytes
- VMutez :: Mutez -> Value' instr 'TMutez
- VBool :: Bool -> Value' instr 'TBool
- VKeyHash :: KeyHash -> Value' instr 'TKeyHash
- VTimestamp :: Timestamp -> Value' instr 'TTimestamp
- VAddress :: EpAddress -> Value' instr 'TAddress
- VBls12381Fr :: Bls12381Fr -> Value' instr 'TBls12381Fr
- VBls12381G1 :: Bls12381G1 -> Value' instr 'TBls12381G1
- VBls12381G2 :: Bls12381G2 -> Value' instr 'TBls12381G2
- VChest :: Chest -> Value' instr 'TChest
- VChestKey :: ChestKey -> Value' instr 'TChestKey
newtype ViewName where
- UnsafeViewName {
  - unViewName :: Text
  }
- pattern ViewName :: Text -> ViewName
type ViewsSet = ViewsSet' Instr
data Branch
- = L
- | S
- | R
type Operation = Operation' Instr
class UnpackedValScopeC (UnpackedValScope t) t => UnpackedValScope t
data DfsSettings m = DfsSettings {
- dsGoToValues :: Bool
- dsCtorEffectsApp :: CtorEffectsApp m
- dsInstrStep :: forall i o. Instr i o -> m (Instr i o)
- dsValueStep :: forall t'. Value t' -> m (Value t')
}
data SingT :: T -> Type where
- STKey :: SingT ('TKey :: T)
- STUnit :: SingT ('TUnit :: T)
- STSignature :: SingT ('TSignature :: T)
- STChainId :: SingT ('TChainId :: T)
- STOption :: forall (n :: T). (Sing n) -> SingT ('TOption n :: T)
- STList :: forall (n :: T). (Sing n) -> SingT ('TList n :: T)
- STSet :: forall (n :: T). (Sing n) -> SingT ('TSet n :: T)
- STOperation :: SingT ('TOperation :: T)
- STContract :: forall (n :: T). (Sing n) -> SingT ('TContract n :: T)
- STTicket :: forall (n :: T). (Sing n) -> SingT ('TTicket n :: T)
- STPair :: forall (n :: T) (n :: T). (Sing n) -> (Sing n) -> SingT ('TPair n n :: T)
- STOr :: forall (n :: T) (n :: T). (Sing n) -> (Sing n) -> SingT ('TOr n n :: T)
- STLambda :: forall (n :: T) (n :: T). (Sing n) -> (Sing n) -> SingT ('TLambda n n :: T)
- STMap :: forall (n :: T) (n :: T). (Sing n) -> (Sing n) -> SingT ('TMap n n :: T)
- STBigMap :: forall (n :: T) (n :: T). (Sing n) -> (Sing n) -> SingT ('TBigMap n n :: T)
- STInt :: SingT ('TInt :: T)
- STNat :: SingT ('TNat :: T)
- STString :: SingT ('TString :: T)
- STBytes :: SingT ('TBytes :: T)
- STMutez :: SingT ('TMutez :: T)
- STBool :: SingT ('TBool :: T)
- STKeyHash :: SingT ('TKeyHash :: T)
- STBls12381Fr :: SingT ('TBls12381Fr :: T)
- STBls12381G1 :: SingT ('TBls12381G1 :: T)
- STBls12381G2 :: SingT ('TBls12381G2 :: T)
- STTimestamp :: SingT ('TTimestamp :: T)
- STAddress :: SingT ('TAddress :: T)
- STChest :: SingT ('TChest :: T)
- STChestKey :: SingT ('TChestKey :: T)
- STSaplingState :: forall (n :: Nat). (Sing n) -> SingT ('TSaplingState n :: T)
- STSaplingTransaction :: forall (n :: Nat). (Sing n) -> SingT ('TSaplingTransaction n :: T)
- STNever :: SingT ('TNever :: T)
class ConstantScopeC (ConstantScope t) t => ConstantScope t
class PackedValScopeC (PackedValScope t) t => PackedValScope t
data Constrained c f where
- pattern SomePackedVal :: () => PackedValScope t => Value t -> SomePackedVal
- pattern SomeConstant :: () => ConstantScope t => Value t -> SomeConstant
- pattern SomeConstrainedValue :: forall c. () => forall a. c a => Value a -> SomeConstrainedValue c
- pattern SomeStorage :: () => StorageScope t => Value t -> SomeStorage
- pattern SomeValue :: () => SingI t => Value t -> SomeValue
data CreateContract instr cp st = (forall i o. Show (instr i o), forall i o. Eq (instr i o)) => CreateContract {
- ccOriginator :: L1Address
- ccDelegate :: Maybe KeyHash
- ccBalance :: Mutez
- ccStorageVal :: Value' instr st
- ccContract :: Contract' instr cp st
- ccCounter :: GlobalCounter
}
data EntrypointCallT (param :: T) (arg :: T) = ParameterScope arg => EntrypointCall {
- epcName :: EpName
- epcParamProxy :: Proxy param
- epcLiftSequence :: EpLiftSequence arg param
}
data Operation' instr where
- OpTransferTokens :: ParameterScope p => TransferTokens instr p -> Operation' instr
- OpSetDelegate :: SetDelegate -> Operation' instr
- OpCreateContract :: (forall i o. Show (instr i o), forall i o. NFData (instr i o), Typeable instr, ParameterScope cp, StorageScope st) => CreateContract instr cp st -> Operation' instr
- OpEmit :: PackedValScope t => Emit instr t -> Operation' instr
data SomeContractAndStorage where
- SomeContractAndStorage :: forall cp st. (StorageScope st, ParameterScope cp) => Contract cp st -> Value st -> SomeContractAndStorage
type SomeStorage = SomeConstrainedValue StorageScope
data TransferTokens instr p = TransferTokens {
- ttTransferArgument :: Value' instr p
- ttAmount :: Mutez
- ttContract :: Value' instr ('TContract p)
- ttCounter :: GlobalCounter
}
class ParameterScopeC (ParameterScope t) t => ParameterScope t
class StorageScopeC (StorageScope t) t => StorageScope t
type SomeValue = SomeConstrainedValue SingI
data BadTypeForScope
- = BtNotComparable
- | BtIsOperation
- | BtHasBigMap
- | BtHasNestedBigMap
- | BtHasContract
- | BtHasTicket
- | BtHasSaplingState
data CommentType
- = FunctionStarts Text
- | FunctionEnds Text
- | StatementStarts Text
- | StatementEnds Text
- | JustComment Text
- | StackTypeComment (Maybe [T])
class (SingI t, RecSuperC Comparable t, ForbidNonComparable t) => Comparable t
data ExtInstr s
- = TEST_ASSERT (TestAssert s)
- | PRINT (PrintComment s)
- | DOC_ITEM SomeDocItem
- | COMMENT_ITEM CommentType
- | STACKTYPE StackTypePattern
class (SingI t, RecSuperC WellTyped t, WellTypedConstraints t) => WellTyped t
class (Typeable n, Typeable m) => ArithOp aop (n :: T) (m :: T) where
- type ArithRes aop n m :: T
- evalOp :: proxy aop -> Value' instr n -> Value' instr m -> Either (ArithError (Value' instr n) (Value' instr m)) (Value' instr (ArithRes aop n m))
- commutativityProof :: Maybe $ Dict (ArithRes aop n m ~ ArithRes aop m n, ArithOp aop m n)
data EDiv
class UnaryArithOp aop (n :: T) where
- type UnaryArithRes aop n :: T
- evalUnaryArithOp :: proxy aop -> Value' instr n -> Value' instr (UnaryArithRes aop n)
class ConcatOp (c :: T) where
- evalConcat :: Value' instr c -> Value' instr c -> Value' instr c
- evalConcat' :: [Value' instr c] -> Value' instr c
class EDivOp (n :: T) (m :: T) where
- type EDivOpRes n m :: T
- type EModOpRes n m :: T
- evalEDivOp :: Value' instr n -> Value' instr m -> Value' instr ('TOption ('TPair (EDivOpRes n m) (EModOpRes n m)))
class GetOp (c :: T) where
- type GetOpKey c :: T
- type GetOpVal c :: T
- evalGet :: Value' instr (GetOpKey c) -> Value' instr c -> Maybe (Value' instr (GetOpVal c))
class MemOp (c :: T) where
- type MemOpKey c :: T
- evalMem :: Value' instr (MemOpKey c) -> Value' instr c -> Bool
class SizeOp (c :: T) where
- evalSize :: Value' instr c -> Int
class SliceOp (c :: T) where
- evalSlice :: Natural -> Natural -> Value' instr c -> Maybe (Value' instr c)
class UpdOp (c :: T) where
- type UpdOpKey c :: T
- type UpdOpParams c :: T
- evalUpd :: Value' instr (UpdOpKey c) -> Value' instr (UpdOpParams c) -> Value' instr c -> Value' instr c
data SomeVBigMap where
- SomeVBigMap :: forall k v. Value ('TBigMap k v) -> SomeVBigMap
data SomeView' instr st where
- SomeView :: View' instr arg st ret -> SomeView' instr st
data View' instr arg st ret = (ViewableScope arg, SingI st, ViewableScope ret) => View {
- vName :: ViewName
- vArgument :: Notes arg
- vReturn :: Notes ret
- vCode :: ViewCode' instr arg st ret
}
data EpAddress where
- EpAddress' {
  - eaAddress :: Address
  - eaEntrypoint :: EpName
  }
- pattern EpAddress :: KindedAddress kind -> EpName -> EpAddress
data AnnotatedValue v = AnnotatedValue {
- avNotes :: Notes (ToT v)
- avValue :: Value (ToT v)
}
data SomeAnnotatedValue where
- SomeAnnotatedValue :: forall t. SingI t => Notes t -> Value t -> SomeAnnotatedValue
type ContractCode cp st = ContractCode' Instr cp st
type ViewCode arg st ret = ViewCode' Instr arg st ret
type SomeView = SomeView' Instr
type SomeViewsSet = SomeViewsSet' Instr
class WellTypedToT a => IsoValue a where
- type ToT a :: T
- toVal :: a -> Value (ToT a)
- fromVal :: Value (ToT a) -> a
type AnnVar = Anns '[VarAnn]
data Anns xs where
- AnnsCons :: Typeable tag => !(Annotation tag) -> Anns xs -> Anns (Annotation tag ': xs)
- AnnsTyCons :: SingI t => !(Notes t) -> Anns xs -> Anns (Notes t ': xs)
- AnnsNil :: Anns '[]
- pattern Anns5' :: (Each '[Typeable] '[a, b, c, d], SingI t) => Annotation a -> Annotation b -> Annotation c -> Annotation d -> Notes t -> Anns '[Annotation a, Annotation b, Annotation c, Annotation d, Notes t]
- pattern Anns4'' :: (Each '[Typeable] '[a, b], SingI t, SingI u) => Annotation a -> Annotation b -> Notes t -> Notes u -> Anns '[Annotation a, Annotation b, Notes t, Notes u]
- pattern Anns4 :: Each '[Typeable] '[a, b, c, d] => Annotation a -> Annotation b -> Annotation c -> Annotation d -> Anns '[Annotation a, Annotation b, Annotation c, Annotation d]
- pattern Anns3'' :: (Typeable a, SingI t, SingI u) => Annotation a -> Notes t -> Notes u -> Anns '[Annotation a, Notes t, Notes u]
- pattern Anns3' :: (Each '[Typeable] '[a, b], SingI t) => Annotation a -> Annotation b -> Notes t -> Anns '[Annotation a, Annotation b, Notes t]
- pattern Anns3 :: Each '[Typeable] '[a, b, c] => Annotation a -> Annotation b -> Annotation c -> Anns '[Annotation a, Annotation b, Annotation c]
- pattern Anns2' :: (Typeable a, SingI t) => Annotation a -> Notes t -> Anns '[Annotation a, Notes t]
- pattern Anns1 :: Typeable a => Annotation a -> Anns '[Annotation a]
- pattern Anns2 :: Each '[Typeable] '[a, b] => Annotation a -> Annotation b -> Anns '[Annotation a, Annotation b]
class AnnotateInstr (xs :: [Type]) r where
- annotateInstr :: Anns xs -> AnnotateInstrArg xs r -> r
class ToIntArithOp (n :: T) where
- evalToIntOp :: Value' instr n -> Value' instr 'TInt
class ToBytesArithOp (n :: T) where
- evalToBytesOp :: Value' instr n -> Value' instr 'TBytes
data ArithError n m
- = MutezArithError MutezArithErrorType n m
- | ShiftArithError ShiftArithErrorType n m
data ShiftArithErrorType
- = LslOverflow
- | LsrUnderflow
data MutezArithErrorType
- = AddOverflow
- | MulOverflow
data SubMutez
data Lsl
data Lsr
data Eq'
data Neq
data Lt
data Gt
data Le
data Ge
type Bls12381MulBadOrder a1 a2 = DelayError (((('Text "Multiplication of " ':<>: 'ShowType a2) ':<>: 'Text " and ") ':<>: 'ShowType a1) ':<>: 'Text " works only other way around")
type ContractInp1 param st = 'TPair param st
type ContractInp param st = '[ContractInp1 param st]
type ContractOut1 st = 'TPair ('TList 'TOperation) st
type ContractOut st = '[ContractOut1 st]
newtype ContractCode' instr cp st = ContractCode {
- unContractCode :: instr (ContractInp cp st) (ContractOut st)
}
class IsNotInView
data HandleImplicitDefaultEp
- = WithoutImplicitDefaultEp
- | WithImplicitDefaultEp
data ParseEpAddressError
- = ParseEpAddressBadAddress ParseAddressError
- | ParseEpAddressRawBadAddress ParseAddressRawError
- | ParseEpAddressBadEntryopint ByteString UnicodeException
- | ParseEpAddressBadRefAnn Text
- | ParseEpAddressRefAnnError EpNameFromRefAnnError
- | ParseEpAddressInvalidLength Int
data ParamNotes (t :: T) = UnsafeParamNotes {
- pnNotes :: Notes t
- pnRootAnn :: RootAnn
}
data ArmCoord
- = AcLeft
- | AcRight
type ArmCoords = [ArmCoord]
data ParamEpError
- = ParamEpDuplicatedNames (NonEmpty EpName)
- | ParamEpUncallableArm ArmCoords
data EpLiftSequence (arg :: T) (param :: T) where
- EplArgHere :: EpLiftSequence arg arg
- EplWrapLeft :: (SingI subparam, SingI r) => EpLiftSequence arg subparam -> EpLiftSequence arg ('TOr subparam r)
- EplWrapRight :: (SingI l, SingI subparam) => EpLiftSequence arg subparam -> EpLiftSequence arg ('TOr l subparam)
data SomeEntrypointCallT (arg :: T) = forall param.ParameterScope param => SomeEpc (EntrypointCallT param arg)
type family ForbidOr (t :: T) :: Constraint where ...
data MkEntrypointCallRes param where
- MkEntrypointCallRes :: ParameterScope arg => Notes arg -> EntrypointCallT param arg -> MkEntrypointCallRes param
data EpNameFromRefAnnError = InEpNameBadAnnotation FieldAnn
type SomeConstrainedValue c = Constrained c Value
type SomeConstant = SomeConstrainedValue ConstantScope
type SomePackedVal = SomeConstrainedValue PackedValScope
data SomeIsoValue where
- SomeIsoValue :: KnownIsoT a => a -> SomeIsoValue
type KnownIsoT a = (IsoValue a, SingI (ToT a))
data BigMap k v
type ADTRep a = [ConstructorRep a]
data ConstructorRep a = ConstructorRep {
- crName :: Text
- crDescription :: Maybe Text
- crFields :: [FieldRep a]
}
data FieldRep a = FieldRep {
- frName :: Maybe Text
- frDescription :: Maybe Text
- frTypeRep :: a
}
newtype WithinParens = WithinParens Bool
class (Typeable a, SingI (TypeDocFieldDescriptions a), FieldDescriptionsValid (TypeDocFieldDescriptions a) a) => TypeHasDoc a where
- type TypeDocFieldDescriptions a :: FieldDescriptions
- typeDocName :: Proxy a -> Text
- typeDocMdDescription :: Markdown
- typeDocMdReference :: Proxy a -> WithinParens -> Markdown
- typeDocDependencies :: Proxy a -> [SomeDocDefinitionItem]
- typeDocHaskellRep :: TypeDocHaskellRep a
- typeDocMichelsonRep :: TypeDocMichelsonRep a
class TypeHasFieldNamingStrategy a where
- typeFieldNamingStrategy :: Text -> Text
data FieldCamelCase
data FieldSnakeCase
type TypeDocHaskellRep a = Proxy a -> FieldDescriptionsV -> Maybe (Maybe DocTypeRepLHS, ADTRep SomeTypeWithDoc)
type TypeDocMichelsonRep a = Proxy a -> (Maybe DocTypeRepLHS, T)
type FieldDescriptions = [(Symbol, (Maybe Symbol, [(Symbol, Symbol)]))]
type PolyTypeHasDocC ts = Each '[TypeHasDoc] ts
data SomeTypeWithDoc where
- SomeTypeWithDoc :: TypeHasDoc td => Proxy td -> SomeTypeWithDoc
type family HaveCommonTypeCtor a b where ...
class IsHomomorphic a
newtype DStorageType = DStorageType DType
class GTypeHasDoc (x :: Type -> Type)
class GProductHasDoc (x :: Type -> Type)
type InstrGetFieldC dt name = (GenericIsoValue dt, GInstrGet name (GRep dt) (LnrBranch (GetNamed name dt)) (LnrFieldType (GetNamed name dt)))
type InstrSetFieldC dt name = (GenericIsoValue dt, GInstrSetField name (GRep dt) (LnrBranch (GetNamed name dt)) (LnrFieldType (GetNamed name dt)))
type InstrConstructC dt = (GenericIsoValue dt, GInstrConstruct (GRep dt) '[])
type InstrDeconstructC dt st = (GenericIsoValue dt, GInstrDeconstruct (GRep dt) '[] st)
type GetFieldType dt name = LnrFieldType (GetNamed name dt)
type family GFieldTypes x rest :: [Type]
type family GFieldTypes x rest :: [Type]
type family GLookupNamed (name :: Symbol) (x :: Type -> Type) :: Maybe LookupNamedResult where ...
type ConstructorFieldTypes dt = GFieldTypes (GRep dt) '[]
type ConstructorFieldNames dt = GFieldNames (GRep dt)
newtype FieldConstructor (st :: [k]) (field :: Type) = FieldConstructor (Instr (ToTs' st) (ToT field ': ToTs' st))
class ToTs xs ~ ToTs ys => CastFieldConstructors xs ys where
- castFieldConstructorsImpl :: Rec (FieldConstructor st) xs -> Rec (FieldConstructor st) ys
type InstrWrapC dt name = (GenericIsoValue dt, GInstrWrap (GRep dt) (LnrBranch (GetNamed name dt)) (LnrFieldType (GetNamed name dt)))
type InstrWrapOneC dt name = (InstrWrapC dt name, GetCtorField dt name ~ 'OneField (CtorOnlyField name dt))
type InstrCaseC dt = (GenericIsoValue dt, GInstrCase (GRep dt) '[])
type InstrUnwrapC dt name = (GenericIsoValue dt, GInstrUnwrap (GRep dt) (LnrBranch (GetNamed name dt)) (CtorOnlyField name dt))
data CaseClauseParam = CaseClauseParam Symbol CtorField
data CaseClause (inp :: [T]) (out :: [T]) (param :: CaseClauseParam) where
- CaseClause :: RemFail Instr (AppendCtorField x inp) out -> CaseClause inp out ('CaseClauseParam ctor x)
type CaseClauses a = GCaseClauses (GRep a) '[]
type family GCaseClauses x rest :: [CaseClauseParam]
type family GCaseClauses x rest :: [CaseClauseParam]
type family GCaseBranchInput ctor x :: CaseClauseParam
type family GCaseBranchInput ctor x :: CaseClauseParam
data CtorField
- = OneField Type
- | NoFields
type family ExtractCtorField (cf :: CtorField) where ...
type family AppendCtorField cf l where ...
type AppendCtorFieldAxiom (cf :: CtorField) (st :: [Type]) = ToTs (AppendCtorField cf st) ~ AppendCtorField cf (ToTs st)
type GetCtorField dt ctor = LnrFieldType (GetNamed ctor dt)
type CtorHasOnlyField ctor dt f = GetCtorField dt ctor ~ 'OneField f
type CtorOnlyField name dt = RequireOneField name (GetCtorField dt name)
data MyCompoundType
type family IsPrimitiveValue (x :: Type) :: Bool where ...
data ComposeResult a
- = ComposeOk a
- | ComposeCtorNotFound
- | ComposeFieldTypeMismatch T T
type LooseSumC dt = (NiceGeneric dt, GLooseSum (GRep dt))
type family ToT' t where ...
type GenericIsoValue t = (IsoValue t, NiceGeneric t, ToT t ~ GValueType (GRep t))
type WellTypedToT a = (IsoValue a, WellTyped (ToT a))
type HasNoOpToT a = (IsoValue a, ForbidOp (ToT a))
type EntrypointCall param arg = EntrypointCallT (ToT param) (ToT arg)
type SomeEntrypointCall arg = SomeEntrypointCallT (ToT arg)
data ContractRef (arg :: Type) = ContractRef {
- crAddress :: Address
- crEntrypoint :: SomeEntrypointCall arg
}
data Ticket (arg :: Type) = Ticket {
- tTicketer :: Address
- tData :: arg
- tAmount :: Natural
}
newtype BigMapId k v = BigMapId {
- unBigMapId :: Natural
}
class ToBigMap m where
- type ToBigMapKey m
- type ToBigMapValue m
- mkBigMap :: m -> BigMap (ToBigMapKey m) (ToBigMapValue m)
type family ToTs (ts :: [Type]) :: [T] where ...
type family ToTs' t where ...
class IsoValuesStack (ts :: [Type]) where
- toValStack :: Rec Identity ts -> Rec Value (ToTs ts)
- fromValStack :: Rec Value (ToTs ts) -> Rec Identity ts
data StackRef (st :: [T]) where
- StackRef :: RequireLongerThan st idx => PeanoNatural idx -> StackRef st
newtype PrintComment (st :: [T]) = PrintComment {
- unPrintComment :: [Either Text (StackRef st)]
}
data TestAssert (s :: [T]) where
- TestAssert :: Text -> PrintComment inp -> Instr inp ('TBool ': out) -> TestAssert inp
data SomeMeta where
- SomeMeta :: forall meta. With [NFData, Show, Typeable] meta => meta -> SomeMeta
data RemFail (instr :: k -> k -> Type) (i :: k) (o :: k) where
- RfNormal :: instr i o -> RemFail instr i o
- RfAlwaysFails :: (forall o'. instr i o') -> RemFail instr i o
data Emit instr t = PackedValScope t => Emit {
- emTag :: Text
- emNotes :: Notes t
- emValue :: Value' instr t
- emCounter :: GlobalCounter
}
class MapOp (c :: T) where
- type MapOpInp c :: T
- type MapOpRes c :: T -> T
- mapOpToList :: Value' instr c -> [Value' instr (MapOpInp c)]
- mapOpFromList :: SingI b => Value' instr c -> [Value' instr b] -> Value' instr (MapOpRes c b)
- mapOpNotes :: Notes c -> Notes (MapOpInp c)
class IterOp (c :: T) where
- type IterOpEl c :: T
- iterOpDetachOne :: Value' instr c -> (Maybe (Value' instr (IterOpEl c)), Value' instr c)
- iterOpNotes :: Notes c -> Notes (IterOpEl c)
class DupableScopeC (DupableScope t) t => DupableScope t
class UntypedValScopeC (UntypedValScope t) t => UntypedValScope t
class ViewableScopeC (ViewableScope t) t => ViewableScope t
class ComparabilityScopeC (ComparabilityScope t) t => ComparabilityScope t
type family IsDupableScope (t :: T) :: Bool where ...
class CheckScope (c :: Constraint) where
- checkScope :: Either BadTypeForScope (Dict c)
class WithDeMorganScope (c :: T -> Constraint) t a b where
- withDeMorganScope :: c (t a b) => ((c a, c b) => ret) -> ret
data NotWellTyped = NotWellTyped {
- nwtBadType :: T
- nwtCause :: BadTypeForScope
}
type family ContainsT p t where ...
class ForbidManyT (ForbidT p t) '[p] t => ForbidT p t
type ForbidContract = ForbidT 'PSContract
type ForbidTicket = ForbidT 'PSTicket
type ForbidBigMap = ForbidT 'PSBigMap
type ForbidNestedBigMaps = ForbidT 'PSNestedBigMaps
type ForbidNonComparable = ForbidT 'PSNonComparable
data TPresence p t where
- TPresent :: ContainsT p t ~ 'True => TPresence p t
- TAbsent :: ContainsT p t ~ 'False => TPresence p t
data TPredicateSym
- = PSOp
- | PSContract
- | PSTicket
- | PSBigMap
- | PSNestedBigMaps
- | PSSaplingState
- | PSNonComparable
data SingTPredicateSym :: TPredicateSym -> Type where
- SPSOp :: SingTPredicateSym ('PSOp :: TPredicateSym)
- SPSContract :: SingTPredicateSym ('PSContract :: TPredicateSym)
- SPSTicket :: SingTPredicateSym ('PSTicket :: TPredicateSym)
- SPSBigMap :: SingTPredicateSym ('PSBigMap :: TPredicateSym)
- SPSNestedBigMaps :: SingTPredicateSym ('PSNestedBigMaps :: TPredicateSym)
- SPSSaplingState :: SingTPredicateSym ('PSSaplingState :: TPredicateSym)
- SPSNonComparable :: SingTPredicateSym ('PSNonComparable :: TPredicateSym)
data Comparability t where
- CanBeCompared :: (Comparable t, ComparabilityImplies t) => Comparability t
- CannotBeCompared :: ContainsT 'PSNonComparable t ~ 'True => Comparability t
data CtorEffectsApp m = CtorEffectsApp {
- ceaName :: Text
- ceaPostStep :: forall i o. Monad m => Instr i o -> m (Instr i o) -> m (Instr i o)
}
data PushableStorageSplit s st where
- ConstantStorage :: ConstantScope st => Value st -> PushableStorageSplit s st
- PushableValueStorage :: StorageScope st => Instr s (st ': s) -> PushableStorageSplit s st
- PartlyPushableStorage :: (StorageScope heavy, StorageScope st) => Value heavy -> Instr (heavy ': s) (st ': s) -> PushableStorageSplit s st
data SomeAnns where
- SomeAnns :: Anns xs -> SomeAnns
- SomeUncheckedAnns :: NonEmpty AnyAnn -> SomeAnns
data SetDelegate = SetDelegate {
- sdMbKeyHash :: Maybe KeyHash
- sdCounter :: GlobalCounter
}
data BadViewNameError
- = BadViewTooLong Int
- | BadViewIllegalChars Text
type ViewCode' instr arg st ret = instr '['TPair arg st] '[ret]
newtype ViewsSet' instr st where
- ViewsSet {
  - unViewsSet :: Map ViewName (SomeView' instr st)
  }
- pattern ViewsList :: [SomeView' instr st] -> ViewsSet' instr st
data ViewsSetError = DuplicatedViewName ViewName
data SomeViewsSet' instr where
- SomeViewsSet :: SingI st => ViewsSet' instr st -> SomeViewsSet' instr
pattern (:#) :: Instr a b -> Instr b c -> Instr a c
pattern ParamNotes :: Notes t -> RootAnn -> ParamNotes t
pattern DefEpName :: EpName
pattern AsUType :: () => SingI t => Notes t -> Ty
pattern AsUTypeExt :: () => SingI t => Sing t -> Notes t -> Ty
pattern ConcreteMeta :: Typeable meta => meta -> Instr i o -> Instr i o
withDict :: HasDict c e => e -> (c => r) -> r
mapContractCodeM :: Monad m => (forall i o. instr i o -> m (instr i o)) -> Contract' instr cp st -> m (Contract' instr cp st)
fromUType :: Ty -> T
mkUType :: Notes x -> Ty
rfAnyInstr :: RemFail instr i o -> instr i o
toUType :: T -> Ty
convertContractOptimized :: Contract param store -> Contract
instrToOpsOptimized :: HasCallStack => Instr inp out -> [ExpandedOp]
untypeValueOptimized :: ForbidOp t => Value' Instr t -> Value
dfsFoldInstr :: forall x inp out. Monoid x => DfsSettings (Writer x) -> (forall i o. Instr i o -> x) -> Instr inp out -> x
dfsTraverseInstr :: forall m inp out. Monad m => DfsSettings m -> Instr inp out -> m (Instr inp out)
withUType :: Ty -> (forall t. SingI t => Notes t -> r) -> r
notesT :: Notes t -> T
comparabilityPresence :: Sing t -> Maybe (Dict (Comparable t))
requireEq :: forall (a :: T) (b :: T) m. (SingI a, SingI b, Monad m) => (forall x. MismatchError T -> m x) -> m (a :~: b)
instrToOps :: HasCallStack => Instr inp out -> [ExpandedOp]
castInstr :: forall inp1 out1 inp2 out2. (SingI inp1, SingI out1, SingI inp2, SingI out2) => Instr inp1 out1 -> Maybe (Instr inp2 out2)
getWTP :: forall t. SingI t => Either NotWellTyped (Dict (WellTyped t))
castM :: forall (a :: T) (b :: T) t m. (SingI a, SingI b, Monad m) => t a -> (forall x. MismatchError T -> m x) -> m (t b)
insertTypeAnn :: forall (b :: T). TypeAnn -> Notes b -> Notes b
isStar :: SingI t => Notes t -> Bool
starNotes :: forall t. SingI t => Notes t
notesSing :: Notes t -> Sing t
evalToNatOp :: Value' instr 'TBytes -> Value' instr 'TNat
compareOp :: Comparable t => Value' i t -> Value' i t -> Integer
mkContractCode :: (IsNotInView => instr (ContractInp cp st) (ContractOut st)) -> ContractCode' instr cp st
defaultContract :: (ParameterScope cp, StorageScope st) => (IsNotInView => instr (ContractInp cp st) (ContractOut st)) -> Contract' instr cp st
mapContractCode :: (forall i o. instr i o -> instr i o) -> Contract' instr cp st -> Contract' instr cp st
mapContractCodeBlock :: (instr (ContractInp cp st) (ContractOut st) -> instr (ContractInp cp st) (ContractOut st)) -> Contract' instr cp st -> Contract' instr cp st
mapContractViewBlocks :: (forall arg ret. ViewCode' instr arg st ret -> ViewCode' instr arg st ret) -> Contract' instr cp st -> Contract' instr cp st
mapContractCodeBlockM :: Monad m => (instr (ContractInp cp st) (ContractOut st) -> m (instr (ContractInp cp st) (ContractOut st))) -> Contract' instr cp st -> m (Contract' instr cp st)
mapContractViewBlocksM :: Monad m => (forall arg ret. ViewCode' instr arg st ret -> m (ViewCode' instr arg st ret)) -> Contract' instr cp st -> m (Contract' instr cp st)
convertParamNotes :: ParamNotes cp -> ParameterType
convertView :: forall arg store ret. View arg store ret -> View
convertSomeView :: SomeView st -> View
convertContractCode :: forall param store. (SingI param, SingI store) => ContractCode param store -> Contract
convertContractCodeOptimized :: forall param store. (SingI param, SingI store) => ContractCode param store -> Contract
convertContract :: Contract param store -> Contract
untypeDemoteT :: forall (t :: T). SingI t => Ty
untypeValue :: ForbidOp t => Value' Instr t -> Value
untypeValueHashable :: ForbidOp t => Value' Instr t -> Value
sampleTypedValue :: forall t. WellTyped t => Sing t -> Maybe (Value t)
flattenEntrypoints :: HandleImplicitDefaultEp -> ParamNotes t -> Map EpName Ty
eqInstrExt :: Instr i1 o1 -> Instr i2 o2 -> Bool
cutInstrNonDoc :: (forall i o. Instr i o -> Instr i o) -> Instr inp out -> Instr s s
docInstr :: DocItem di => di -> Instr s s
formatEpAddress :: EpAddress -> Text
mformatEpAddress :: EpAddress -> MText
parseEpAddress :: Text -> Either ParseEpAddressError EpAddress
parseEpAddressRaw :: ByteString -> Either ParseEpAddressError EpAddress
starParamNotes :: SingI t => ParamNotes t
mkParamNotes :: Notes t -> RootAnn -> Either ParamEpError (ParamNotes t)
epcPrimitive :: forall p. (ParameterScope p, ForbidOr p) => EntrypointCallT p p
unsafeEpcCallRoot :: ParameterScope param => EntrypointCallT param param
unsafeSepcCallRoot :: ParameterScope param => SomeEntrypointCallT param
sepcPrimitive :: forall t. (ParameterScope t, ForbidOr t) => SomeEntrypointCallT t
sepcName :: SomeEntrypointCallT arg -> EpName
mkEntrypointCall :: ParameterScope param => EpName -> ParamNotes param -> Maybe (MkEntrypointCallRes param)
mkDefEntrypointCall :: ParameterScope param => ParamNotes param -> MkEntrypointCallRes param
tyImplicitAccountParam :: ParamNotes 'TUnit
epNameFromParamAnn :: FieldAnn -> Maybe EpName
epNameToParamAnn :: EpName -> FieldAnn
epNameFromRefAnn :: FieldAnn -> Either EpNameFromRefAnnError EpName
epNameToRefAnn :: EpName -> FieldAnn
ligoLayout :: GenericStrategy
ligoCombLayout :: GenericStrategy
crNameL :: forall a. Lens' (ConstructorRep a) Text
crDescriptionL :: forall a. Lens' (ConstructorRep a) (Maybe Text)
crFieldsL :: forall a a. Lens (ConstructorRep a) (ConstructorRep a) [FieldRep a] [FieldRep a]
frNameL :: forall a. Lens' (FieldRep a) (Maybe Text)
frDescriptionL :: forall a. Lens' (FieldRep a) (Maybe Text)
frTypeRepL :: forall a a. Lens (FieldRep a) (FieldRep a) a a
typeDocBuiltMichelsonRep :: TypeHasDoc a => Proxy a -> Doc
genericTypeDocDependencies :: forall a. (Generic a, GTypeHasDoc (GRep a)) => Proxy a -> [SomeDocDefinitionItem]
customTypeDocMdReference :: (Text, DType) -> [DType] -> WithinParens -> Markdown
customTypeDocMdReference' :: (Text, DType) -> [WithinParens -> Markdown] -> WithinParens -> Markdown
homomorphicTypeDocMdReference :: forall (t :: Type). (Typeable t, TypeHasDoc t, IsHomomorphic t) => Proxy t -> WithinParens -> Markdown
poly1TypeDocMdReference :: forall t (r :: Type) (a :: Type). (r ~ t a, Typeable t, Each '[TypeHasDoc] [r, a], IsHomomorphic t) => Proxy r -> WithinParens -> Markdown
poly2TypeDocMdReference :: forall t (r :: Type) (a :: Type) (b :: Type). (r ~ t a b, Typeable t, Each '[TypeHasDoc] [r, a, b], IsHomomorphic t) => Proxy r -> WithinParens -> Markdown
homomorphicTypeDocHaskellRep :: forall a. (Generic a, GTypeHasDoc (GRep a)) => TypeDocHaskellRep a
concreteTypeDocHaskellRep :: forall a b. (Typeable a, GenericIsoValue a, GTypeHasDoc (GRep a), HaveCommonTypeCtor b a) => TypeDocHaskellRep b
unsafeConcreteTypeDocHaskellRep :: forall a b. (Typeable a, GenericIsoValue a, GTypeHasDoc (GRep a)) => TypeDocHaskellRep b
haskellAddNewtypeField :: Text -> TypeDocHaskellRep a -> TypeDocHaskellRep a
haskellRepNoFields :: TypeDocHaskellRep a -> TypeDocHaskellRep a
haskellRepMap :: (Text -> Text) -> TypeDocHaskellRep a -> TypeDocHaskellRep a
haskellRepAdjust :: (Maybe Text -> Maybe Text) -> TypeDocHaskellRep a -> TypeDocHaskellRep a
homomorphicTypeDocMichelsonRep :: forall a. KnownIsoT a => TypeDocMichelsonRep a
concreteTypeDocMichelsonRep :: forall a b. (Typeable a, KnownIsoT a, HaveCommonTypeCtor b a) => TypeDocMichelsonRep b
unsafeConcreteTypeDocMichelsonRep :: forall a b. (Typeable a, KnownIsoT a) => TypeDocMichelsonRep b
dStorage :: forall store. TypeHasDoc store => DStorageType
dTypeDep :: forall (t :: Type). TypeHasDoc t => SomeDocDefinitionItem
dTypeDepP :: forall (t :: Type). TypeHasDoc t => Proxy t -> SomeDocDefinitionItem
buildADTRep :: forall a. (WithinParens -> a -> Markdown) -> ADTRep a -> Markdown
applyWithinParens :: WithinParens -> Markdown -> Markdown
buildTypeWithinParens :: forall a. Typeable a => WithinParens -> Markdown
instrToField :: forall dt name st. InstrGetFieldC dt name => Label name -> Instr (ToT dt ': st) (ToT (GetFieldType dt name) ': st)
instrGetField :: forall dt name st. (InstrGetFieldC dt name, DupableScope (ToT (GetFieldType dt name))) => Label name -> Instr (ToT dt ': st) (ToT (GetFieldType dt name) ': (ToT dt ': st))
instrGetFieldOpen :: forall dt name res st. InstrGetFieldC dt name => Instr '[ToT (GetFieldType dt name)] '[res, ToT (GetFieldType dt name)] -> Instr '[ToT (GetFieldType dt name)] '[res] -> Label name -> Instr (ToT dt ': st) (res ': (ToT dt ': st))
instrSetField :: forall dt name st. InstrSetFieldC dt name => Label name -> Instr (ToT (GetFieldType dt name) ': (ToT dt ': st)) (ToT dt ': st)
instrSetFieldOpen :: forall dt name new st. InstrSetFieldC dt name => Instr '[new, ToT (GetFieldType dt name)] '[ToT (GetFieldType dt name)] -> Label name -> Instr (new ': (ToT dt ': st)) (ToT dt ': st)
instrConstruct :: forall dt st. InstrConstructC dt => Rec (FieldConstructor st) (ConstructorFieldTypes dt) -> Instr st (ToT dt ': st)
instrConstructStack :: forall dt stack st. (InstrConstructC dt, stack ~ ToTs (ConstructorFieldTypes dt)) => Instr (stack ++ st) (ToT dt ': st)
instrDeconstruct :: forall dt stack (st :: [T]). (InstrDeconstructC dt st, stack ~ ToTs (GFieldTypes (GRep dt) '[])) => Instr (ToT dt ': st) (stack ++ st)
instrWrap :: forall dt name st. InstrWrapC dt name => Label name -> Instr (AppendCtorField (GetCtorField dt name) st) (ToT dt ': st)
instrWrapOne :: forall dt name st. InstrWrapOneC dt name => Label name -> Instr (ToT (CtorOnlyField name dt) ': st) (ToT dt ': st)
hsWrap :: forall dt name. InstrWrapC dt name => Label name -> ExtractCtorField (GetCtorField dt name) -> dt
instrCase :: forall dt out inp. InstrCaseC dt => Rec (CaseClause inp out) (CaseClauses dt) -> RemFail Instr (ToT dt ': inp) out
(//->) :: Label ("c" `AppendSymbol` ctor) -> RemFail Instr (AppendCtorField x inp) out -> CaseClause inp out ('CaseClauseParam ctor x)
unsafeInstrUnwrap :: forall dt name st. InstrUnwrapC dt name => Label name -> Instr (ToT dt ': st) (ToT (CtorOnlyField name dt) ': st)
hsUnwrap :: forall dt name. InstrUnwrapC dt name => Label name -> dt -> Maybe (CtorOnlyField name dt)
appendCtorFieldAxiom :: (AppendCtorFieldAxiom ('OneField Word) '[Int], AppendCtorFieldAxiom 'NoFields '[Int]) => Dict (AppendCtorFieldAxiom cf st)
fromTaggedVal :: LooseSumC dt => (Text, SomeValue) -> ComposeResult dt
toTaggedVal :: LooseSumC dt => dt -> (Text, SomeValue)
isoValue :: (IsoValue a, IsoValue b) => Iso (Value (ToT a)) (Value (ToT b)) a b
coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b
contractRefToAddr :: ContractRef cp -> EpAddress
totsKnownLemma :: forall s. KnownList s :- KnownList (ToTs s)
totsAppendLemma :: forall a b. KnownList a => Dict (ToTs (a ++ b) ~ (ToTs a ++ ToTs b))
mkStackRef :: forall (gn :: Nat) st n. (n ~ ToPeano gn, SingIPeano gn, RequireLongerThan st n) => StackRef st
frameInstr :: forall s a b. Instr a b -> Instr (a ++ s) (b ++ s)
divMich :: Integral a => a -> a -> a
modMich :: Integral a => a -> a -> a
deMorganForbidT :: forall a b r p. (ContainsT p a || ContainsT p b) ~ 'False => Sing p -> Sing a -> Sing b -> ((ForbidT p a, ForbidT p b) => r) -> r
comparableImplies :: forall t proxy. ForbidNonComparable t => proxy t -> Dict (ComparabilityImplies t)
checkTPresence :: forall p ty. Sing p -> Sing ty -> TPresence p ty
tPresence :: Sing p -> Sing t -> Maybe (ContainsT p t :~: 'True)
tAbsence :: Sing p -> Sing t -> Maybe (ContainsT p t :~: 'False)
checkComparability :: Sing t -> Comparability t
getWTP' :: Sing t -> Either NotWellTyped (Dict (WellTyped t))
castSingE :: forall (a :: T) (b :: T) t. (SingI a, SingI b) => t a -> Either Text (t b)
eqP :: forall (a :: T) (b :: T). (SingI a, SingI b) => Proxy a -> Proxy b -> Maybe (a :~: b)
buildStack :: [T] -> Doc
dfsModifyInstr :: DfsSettings Identity -> (forall i o. Instr i o -> Instr i o) -> Instr inp out -> Instr inp out
isMichelsonInstr :: Instr i o -> Bool
linearizeLeft :: Instr inp out -> Instr inp out
linearizeLeftDeep :: Instr inp out -> Instr inp out
dfsFoldMapValue :: Monoid x => (forall t'. Value t' -> x) -> Value t -> x
dfsFoldMapValueM :: (Monoid x, Monad m) => (forall t'. Value t' -> m x) -> Value t -> m x
dfsMapValue :: forall t. DfsSettings Identity -> Value t -> Value t
dfsTraverseValue :: forall t m. Monad m => DfsSettings m -> Value t -> m (Value t)
isStringValue :: Value t -> Maybe MText
isBytesValue :: Value t -> Maybe ByteString
allAtomicValues :: forall t a. (forall t'. Value t' -> Maybe a) -> Value t -> [a]
splitPushableStorage :: StorageScope t => Value t -> PushableStorageSplit s t
analyzeInstrFailure :: Instr i o -> RemFail Instr i o
instrAnns :: Instr i o -> Maybe SomeAnns
mkVLam :: (SingI inp, SingI out, forall i o. Show (instr i o), forall i o. Eq (instr i o), forall i o. NFData (instr i o)) => (IsNotInView => RemFail instr '[inp] '[out]) -> Value' instr ('TLambda inp out)
mkVLamRec :: (SingI inp, SingI out, forall i o. Show (instr i o), forall i o. Eq (instr i o), forall i o. NFData (instr i o)) => (IsNotInView => RemFail instr '[inp, 'TLambda inp out] '[out]) -> Value' instr ('TLambda inp out)
rfMerge :: (forall o'. instr i1 o' -> instr i2 o' -> instr i3 o') -> RemFail instr i1 o -> RemFail instr i2 o -> RemFail instr i3 o
rfMapAnyInstr :: (forall o'. instr i1 o' -> instr i2 o') -> RemFail instr i1 o -> RemFail instr i2 o
addressToVContract :: forall t instr kind. (ParameterScope t, ForbidOr t) => KindedAddress kind -> Value' instr ('TContract t)
buildVContract :: Value' instr ('TContract arg) -> Doc
compileEpLiftSequence :: EpLiftSequence arg param -> Value' instr arg -> Value' instr param
liftCallArg :: EntrypointCallT param arg -> Value' instr arg -> Value' instr param
valueTypeSanity :: Value' instr t -> Dict (SingI t)
withValueTypeSanity :: Value' instr t -> (SingI t => a) -> a
eqValueExt :: Value' instr t1 -> Value' instr t2 -> Bool
mkViewName :: Text -> Either BadViewNameError ViewName
viewNameToMText :: ViewName -> MText
someViewName :: SomeView' instr st -> ViewName
mkViewsSet :: [SomeView' instr st] -> Either ViewsSetError (ViewsSet' instr st)
emptyViewsSet :: forall instr st. ViewsSet' instr st
addViewToSet :: View' instr arg st ret -> ViewsSet' instr st -> Either ViewsSetError (ViewsSet' instr st)
lookupView :: forall instr st. ViewName -> ViewsSet' instr st -> Maybe (SomeView' instr st)
viewsSetNames :: forall instr st. ViewsSet' instr st -> Set ViewName

Documentation

type Value = Value' Instr Source #

data And Source #

Instances

Instances details

ArithOp And 'TBool 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes And 'TBool 'TBool :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy And -> Value' instr 'TBool -> Value' instr 'TBool -> Either (ArithError (Value' instr 'TBool) (Value' instr 'TBool)) (Value' instr (ArithRes And 'TBool 'TBool)) Source # commutativityProof :: Maybe $ Dict (ArithRes And 'TBool 'TBool ~ ArithRes And 'TBool 'TBool, ArithOp And 'TBool 'TBool) Source #
ArithOp And 'TBytes 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes And 'TBytes 'TBytes :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy And -> Value' instr 'TBytes -> Value' instr 'TBytes -> Either (ArithError (Value' instr 'TBytes) (Value' instr 'TBytes)) (Value' instr (ArithRes And 'TBytes 'TBytes)) Source # commutativityProof :: Maybe $ Dict (ArithRes And 'TBytes 'TBytes ~ ArithRes And 'TBytes 'TBytes, ArithOp And 'TBytes 'TBytes) Source #
ArithOp And 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes And 'TInt 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy And -> Value' instr 'TInt -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TNat)) (Value' instr (ArithRes And 'TInt 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes And 'TInt 'TNat ~ ArithRes And 'TNat 'TInt, ArithOp And 'TNat 'TInt) Source #
ArithOp And 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes And 'TNat 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy And -> Value' instr 'TNat -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TNat)) (Value' instr (ArithRes And 'TNat 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes And 'TNat 'TNat ~ ArithRes And 'TNat 'TNat, ArithOp And 'TNat 'TNat) Source #
type ArithRes And 'TBool 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes And 'TBool 'TBool = 'TBool
type ArithRes And 'TBytes 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes And 'TBytes 'TBytes = 'TBytes
type ArithRes And 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes And 'TInt 'TNat = 'TNat
type ArithRes And 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes And 'TNat 'TNat = 'TNat

data T Source #

Michelson language type with annotations stripped off.

Instances

Instances details

Data T Source #
Instance details Defined in Morley.Michelson.Typed.T Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> T -> c T # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c T # toConstr :: T -> Constr # dataTypeOf :: T -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c T) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c T) # gmapT :: (forall b. Data b => b -> b) -> T -> T # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> T -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> T -> r # gmapQ :: (forall d. Data d => d -> u) -> T -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> T -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> T -> m T # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> T -> m T # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> T -> m T #
Generic T Source #
Instance details Defined in Morley.Michelson.Typed.T Associated Types type Rep T :: Type -> Type # Methods from :: T -> Rep T x # to :: Rep T x -> T #
Show T Source #
Instance details Defined in Morley.Michelson.Typed.T Methods showsPrec :: Int -> T -> ShowS # show :: T -> String # showList :: [T] -> ShowS #
NFData T Source #
Instance details Defined in Morley.Michelson.Typed.T Methods rnf :: T -> () #
Eq T Source #
Instance details Defined in Morley.Michelson.Typed.T Methods (==) :: T -> T -> Bool # (/=) :: T -> T -> Bool #
ToExpression T Source #
Instance details Defined in Morley.Micheline.Class Methods toExpression :: T -> Expression Source #
RenderDoc T Source #
Instance details Defined in Morley.Michelson.Typed.T Methods renderDoc :: RenderContext -> T -> Doc Source # isRenderable :: T -> Bool Source #
Buildable T Source #
Instance details Defined in Morley.Michelson.Typed.T Methods build :: T -> Doc buildList :: [T] -> Doc
SingKind T Source #
Instance details Defined in Morley.Michelson.Typed.Sing Associated Types type Demote T = (r :: Type) # Methods fromSing :: forall (a :: T). Sing a -> Demote T # toSing :: Demote T -> SomeSing T #
(SDecide T, SDecide Peano) => SDecide T Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods (%~) :: forall (a :: T) (b :: T). Sing a -> Sing b -> Decision (a :~: b) #
(SDecide T, SDecide Peano) => TestCoercion SingT Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods testCoercion :: forall (a :: k) (b :: k). SingT a -> SingT b -> Maybe (Coercion a b) #
(SDecide T, SDecide Peano) => TestEquality SingT Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods testEquality :: forall (a :: k) (b :: k). SingT a -> SingT b -> Maybe (a :~: b) #
FromExp x T Source #
Instance details Defined in Morley.Micheline.Class Methods fromExp :: Exp x -> Either (FromExpError x) T Source #
SingI 'TAddress Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TAddress #
SingI 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBls12381Fr #
SingI 'TBls12381G1 Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBls12381G1 #
SingI 'TBls12381G2 Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBls12381G2 #
SingI 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBool #
SingI 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBytes #
SingI 'TChainId Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TChainId #
SingI 'TChest Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TChest #
SingI 'TChestKey Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TChestKey #
SingI 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TInt #
SingI 'TKey Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TKey #
SingI 'TKeyHash Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TKeyHash #
SingI 'TMutez Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TMutez #
SingI 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TNat #
SingI 'TNever Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TNever #
SingI 'TOperation Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TOperation #
SingI 'TSignature Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TSignature #
SingI 'TString Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TString #
SingI 'TTimestamp Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TTimestamp #
SingI 'TUnit Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TUnit #
SingI1 'TContract Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TContract x) #
SingI1 'TList Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TList x) #
SingI1 'TOption Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TOption x) #
SingI1 'TSet Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TSet x) #
SingI1 'TTicket Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TTicket x) #
SingI1 'TSaplingState Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TSaplingState x) #
SingI1 'TSaplingTransaction Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TSaplingTransaction x) #
SingI2 'TBigMap Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing ('TBigMap x y) #
SingI2 'TLambda Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing ('TLambda x y) #
SingI2 'TMap Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing ('TMap x y) #
SingI2 'TOr Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing ('TOr x y) #
SingI2 'TPair Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing2 :: forall (x :: k1) (y :: k2). Sing x -> Sing y -> Sing ('TPair x y) #
SingI n => SingI1 ('TBigMap n :: T -> T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TBigMap n x) #
SingI n => SingI1 ('TLambda n :: T -> T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TLambda n x) #
SingI n => SingI1 ('TMap n :: T -> T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TMap n x) #
SingI n => SingI1 ('TOr n :: T -> T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TOr n x) #
SingI n => SingI1 ('TPair n :: T -> T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods liftSing :: forall (x :: k1). Sing x -> Sing ('TPair n x) #
SingI n => SingI ('TContract n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TContract n) #
SingI n => SingI ('TList n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TList n) #
SingI n => SingI ('TOption n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TOption n) #
SingI n => SingI ('TSaplingState n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TSaplingState n) #
SingI n => SingI ('TSaplingTransaction n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TSaplingTransaction n) #
SingI n => SingI ('TSet n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TSet n) #
SingI n => SingI ('TTicket n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TTicket n) #
(forall (t :: T). Eq (meta t)) => GEq (StkEl meta :: T -> Type) Source #
Instance details Defined in Morley.Michelson.Interpret Methods geq :: forall (a :: k) (b :: k). StkEl meta a -> StkEl meta b -> Maybe (a :~: b) #
GEq (Value' instr :: T -> Type) Source #
Instance details Defined in Morley.Michelson.Typed.Value Methods geq :: forall (a :: k) (b :: k). Value' instr a -> Value' instr b -> Maybe (a :~: b) #
(WhenStuck t (TypeError (ForbidManyTStuckErr c ps' t) :: Constraint), FailWhen a (ForbidTErrorMsg p t)) => DelayedContainsTCheck (c :: Constraint) (ps' :: [TPredicateSym]) (p :: TPredicateSym) (t :: T) a Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT
(SingI inp, SingI out) => FromExp RegularExp (Instr '[inp] '[out]) Source #
Instance details Defined in Morley.Micheline.Class Methods fromExp :: Exp RegularExp -> Either (FromExpError RegularExp) (Instr '[inp] '[out]) Source #
(SingI n1, SingI n2) => SingI ('TBigMap n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TBigMap n1 n2) #
(SingI n1, SingI n2) => SingI ('TLambda n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TLambda n1 n2) #
(SingI n1, SingI n2) => SingI ('TMap n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TMap n1 n2) #
(SingI n1, SingI n2) => SingI ('TOr n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TOr n1 n2) #
(SingI n1, SingI n2) => SingI ('TPair n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TPair n1 n2) #
(forall (t :: T). cs t => ForbidOp t) => RenderDoc (SomeConstrainedValue cs) Source #
Instance details Defined in Morley.Michelson.Typed.Existential Methods renderDoc :: RenderContext -> SomeConstrainedValue cs -> Doc Source # isRenderable :: SomeConstrainedValue cs -> Bool Source #
Buildable (MismatchError T) Source #
Instance details Defined in Morley.Michelson.Typed.T Methods build :: MismatchError T -> Doc buildList :: [MismatchError T] -> Doc
Buildable (MismatchError [T]) Source #
Instance details Defined in Morley.Michelson.Typed.T Methods build :: MismatchError [T] -> Doc buildList :: [MismatchError [T]] -> Doc
Applicative m => StkElMeta (NoStkElMeta :: T -> Type) m Source #
Instance details Defined in Morley.Michelson.Interpret Methods mkStkElMeta :: forall (t :: T). Maybe (NoStkElMeta t) -> Value t -> m (NoStkElMeta t) Source #
type Rep T Source #
Instance details Defined in Morley.Michelson.Typed.T type Rep T = D1 ('MetaData "T" "Morley.Michelson.Typed.T" "morley-1.20.0-inplace" 'False) (((((C1 ('MetaCons "TKey" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TUnit" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TSignature" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TChainId" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TOption" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T)) :+: C1 ('MetaCons "TList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T))) :+: (C1 ('MetaCons "TSet" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T)) :+: C1 ('MetaCons "TOperation" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "TContract" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T)) :+: C1 ('MetaCons "TTicket" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T))) :+: (C1 ('MetaCons "TPair" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T)) :+: C1 ('MetaCons "TOr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T)))) :+: ((C1 ('MetaCons "TLambda" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T)) :+: C1 ('MetaCons "TMap" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T))) :+: (C1 ('MetaCons "TBigMap" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 T)) :+: C1 ('MetaCons "TInt" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "TNat" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TString" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TBytes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TMutez" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TBool" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TKeyHash" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TBls12381Fr" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TBls12381G1" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "TBls12381G2" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TTimestamp" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TAddress" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TChest" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TChestKey" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TSaplingState" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Peano))) :+: (C1 ('MetaCons "TSaplingTransaction" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Peano)) :+: C1 ('MetaCons "TNever" 'PrefixI 'False) (U1 :: Type -> Type))))))
type Demote T Source #
Instance details Defined in Morley.Michelson.Typed.Sing type Demote T = T
type Sing Source #
Instance details Defined in Morley.Michelson.Typed.Sing type Sing = SingT

data Not Source #

Instances

Instances details

UnaryArithOp Not 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type UnaryArithRes Not 'TBool :: T Source # Methods evalUnaryArithOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Not -> Value' instr 'TBool -> Value' instr (UnaryArithRes Not 'TBool) Source #
UnaryArithOp Not 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type UnaryArithRes Not 'TBytes :: T Source # Methods evalUnaryArithOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Not -> Value' instr 'TBytes -> Value' instr (UnaryArithRes Not 'TBytes) Source #
UnaryArithOp Not 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type UnaryArithRes Not 'TInt :: T Source # Methods evalUnaryArithOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Not -> Value' instr 'TInt -> Value' instr (UnaryArithRes Not 'TInt) Source #
UnaryArithOp Not 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type UnaryArithRes Not 'TNat :: T Source # Methods evalUnaryArithOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Not -> Value' instr 'TNat -> Value' instr (UnaryArithRes Not 'TNat) Source #
type UnaryArithRes Not 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith type UnaryArithRes Not 'TBool = 'TBool
type UnaryArithRes Not 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith type UnaryArithRes Not 'TBytes = 'TBytes
type UnaryArithRes Not 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type UnaryArithRes Not 'TInt = 'TInt
type UnaryArithRes Not 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type UnaryArithRes Not 'TNat = 'TInt

data Xor Source #

Instances

Instances details

ArithOp Xor 'TBool 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Xor 'TBool 'TBool :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Xor -> Value' instr 'TBool -> Value' instr 'TBool -> Either (ArithError (Value' instr 'TBool) (Value' instr 'TBool)) (Value' instr (ArithRes Xor 'TBool 'TBool)) Source # commutativityProof :: Maybe $ Dict (ArithRes Xor 'TBool 'TBool ~ ArithRes Xor 'TBool 'TBool, ArithOp Xor 'TBool 'TBool) Source #
ArithOp Xor 'TBytes 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Xor 'TBytes 'TBytes :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Xor -> Value' instr 'TBytes -> Value' instr 'TBytes -> Either (ArithError (Value' instr 'TBytes) (Value' instr 'TBytes)) (Value' instr (ArithRes Xor 'TBytes 'TBytes)) Source # commutativityProof :: Maybe $ Dict (ArithRes Xor 'TBytes 'TBytes ~ ArithRes Xor 'TBytes 'TBytes, ArithOp Xor 'TBytes 'TBytes) Source #
ArithOp Xor 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Xor 'TNat 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Xor -> Value' instr 'TNat -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TNat)) (Value' instr (ArithRes Xor 'TNat 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Xor 'TNat 'TNat ~ ArithRes Xor 'TNat 'TNat, ArithOp Xor 'TNat 'TNat) Source #
type ArithRes Xor 'TBool 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Xor 'TBool 'TBool = 'TBool
type ArithRes Xor 'TBytes 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Xor 'TBytes 'TBytes = 'TBytes
type ArithRes Xor 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Xor 'TNat 'TNat = 'TNat

data Compare Source #

class SingI (a :: k) where #

A SingI constraint is essentially an implicitly-passed singleton. If you need to satisfy this constraint with an explicit singleton, please see withSingI or the Sing pattern synonym.

Methods

sing :: Sing a #

Produce the singleton explicitly. You will likely need the ScopedTypeVariables extension to use this method the way you want.

Instances

Instances details

SingI 'MPTConstant Source #
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods sing :: Sing 'MPTConstant #
SingI 'MPTInstr Source #
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods sing :: Sing 'MPTInstr #
SingI 'MPTKeyword Source #
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods sing :: Sing 'MPTKeyword #
SingI 'MPTRemoved Source #
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods sing :: Sing 'MPTRemoved #
SingI 'MPTType Source #
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods sing :: Sing 'MPTType #
SingI 'MPTValue Source #
Instance details Defined in Morley.Micheline.Expression.Internal.MichelinePrimitive Methods sing :: Sing 'MPTValue #
SingI 'AlwaysFailing Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'AlwaysFailing #
SingI 'FailingNormal Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'FailingNormal #
SingI 'DoesHaveNonStandardAnns Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'DoesHaveNonStandardAnns #
SingI 'DoesHaveStandardAnns Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'DoesHaveStandardAnns #
SingI 'DoesNotHaveAnns Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'DoesNotHaveAnns #
SingI 'Additional Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'Additional #
SingI 'FromMichelson Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'FromMichelson #
SingI 'Phantom Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'Phantom #
SingI 'Structural Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'Structural #
SingI 'HasIndirectChildren Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'HasIndirectChildren #
SingI 'MayHaveChildren Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'MayHaveChildren #
SingI 'NoChildren Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'NoChildren #
SingI 'OneChild Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'OneChild #
SingI 'TwoChildren Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing 'TwoChildren #
SingI 'PSBigMap Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT Methods sing :: Sing 'PSBigMap #
SingI 'PSContract Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT Methods sing :: Sing 'PSContract #
SingI 'PSNestedBigMaps Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT Methods sing :: Sing 'PSNestedBigMaps #
SingI 'PSNonComparable Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT Methods sing :: Sing 'PSNonComparable #
SingI 'PSOp Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT Methods sing :: Sing 'PSOp #
SingI 'PSSaplingState Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT Methods sing :: Sing 'PSSaplingState #
SingI 'PSTicket Source #
Instance details Defined in Morley.Michelson.Typed.Scope.Internal.ForbidT Methods sing :: Sing 'PSTicket #
SingI 'TAddress Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TAddress #
SingI 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBls12381Fr #
SingI 'TBls12381G1 Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBls12381G1 #
SingI 'TBls12381G2 Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBls12381G2 #
SingI 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBool #
SingI 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TBytes #
SingI 'TChainId Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TChainId #
SingI 'TChest Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TChest #
SingI 'TChestKey Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TChestKey #
SingI 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TInt #
SingI 'TKey Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TKey #
SingI 'TKeyHash Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TKeyHash #
SingI 'TMutez Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TMutez #
SingI 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TNat #
SingI 'TNever Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TNever #
SingI 'TOperation Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TOperation #
SingI 'TSignature Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TSignature #
SingI 'TString Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TString #
SingI 'TTimestamp Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TTimestamp #
SingI 'TUnit Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing 'TUnit #
SingI 'AddressKindContract Source #
Instance details Defined in Morley.Tezos.Address.Kinds Methods sing :: Sing 'AddressKindContract #
SingI 'AddressKindImplicit Source #
Instance details Defined in Morley.Tezos.Address.Kinds Methods sing :: Sing 'AddressKindImplicit #
SingI 'AddressKindSmartRollup Source #
Instance details Defined in Morley.Tezos.Address.Kinds Methods sing :: Sing 'AddressKindSmartRollup #
SingI 'Z Source #
Instance details Defined in Morley.Util.Peano Methods sing :: Sing 'Z #
SingI n => SingI ('TContract n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TContract n) #
SingI n => SingI ('TList n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TList n) #
SingI n => SingI ('TOption n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TOption n) #
SingI n => SingI ('TSaplingState n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TSaplingState n) #
SingI n => SingI ('TSaplingTransaction n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TSaplingTransaction n) #
SingI n => SingI ('TSet n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TSet n) #
SingI n => SingI ('TTicket n :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TTicket n) #
SingI n => SingI ('S n :: Nat) Source #
Instance details Defined in Morley.Util.Peano Methods sing :: Sing ('S n) #
(SingI n1, SingI n2) => SingI ('TBigMap n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TBigMap n1 n2) #
(SingI n1, SingI n2) => SingI ('TLambda n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TLambda n1 n2) #
(SingI n1, SingI n2) => SingI ('TMap n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TMap n1 n2) #
(SingI n1, SingI n2) => SingI ('TOr n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TOr n1 n2) #
(SingI n1, SingI n2) => SingI ('TPair n1 n2 :: T) Source #
Instance details Defined in Morley.Michelson.Typed.Sing Methods sing :: Sing ('TPair n1 n2) #
(SingI n1, SingI n2, SingI n3, SingI n4) => SingI ('InstrClass n1 n2 n3 n4 :: InstrClass) Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing ('InstrClass n1 n2 n3 n4) #
SingI n => SingI ('MaxInternal n :: MaxInternal a)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ('MaxInternal n) #
SingI n => SingI ('MinInternal n :: MinInternal a)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ('MinInternal n) #
SingI GetAllSym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetAllSym0 #
SingI GetAnySym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetAnySym0 #
SingI ThenCmpSym0
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ThenCmpSym0 #
SingI InstrClassSym0 Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing InstrClassSym0 #
SingI EfdtNatDnSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EfdtNatDnSym0 #
SingI EfdtNatSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EfdtNatSym0 #
SingI EfdtNatUpSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EfdtNatUpSym0 #
SingI EftNatSym0
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EftNatSym0 #
SingI AllSym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing AllSym0 #
SingI All_Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods sing :: Sing All_Sym0 #
SingI AnySym0
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing AnySym0 #
SingI Any_Sym0
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods sing :: Sing Any_Sym0 #
SingI ShowParenSym0
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowParenSym0 #
SingI ShowCharSym0
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowCharSym0 #
SingI ShowStringSym0
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowStringSym0 #
SingI ShowCommaSpaceSym0
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowCommaSpaceSym0 #
SingI ShowSpaceSym0
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowSpaceSym0 #
SingI Show_tupleSym0
Instance details Defined in Text.Show.Singletons Methods sing :: Sing Show_tupleSym0 #
SingI AndSym0
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing AndSym0 #
SingI OrSym0
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing OrSym0 #
SingI UnlinesSym0
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnlinesSym0 #
SingI UnwordsSym0
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnwordsSym0 #
SingI DivSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing DivSym0 #
SingI ModSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing ModSym0 #
SingI (^@#@$)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing (^@#@$) #
SingI Log2Sym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing Log2Sym0 #
SingI NatToCharSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing NatToCharSym0 #
SingI (&&@#@$)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (&&@#@$) #
SingI (\|\|@#@$)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (\|\|@#@$) #
SingI NotSym0
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing NotSym0 #
SingI ConsSymbolSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing ConsSymbolSym0 #
SingI CharToNatSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing CharToNatSym0 #
SingI UnconsSymbolSym0
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing UnconsSymbolSym0 #
SingI (RunIdentitySym0 :: TyFun (Identity a) a -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing RunIdentitySym0 #
SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing GetFirstSym0 #
SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing GetLastSym0 #
SingI (GetDownSym0 :: TyFun (Down a) a -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing GetDownSym0 #
SingI (GetFirstSym0 :: TyFun (First a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetFirstSym0 #
SingI (GetLastSym0 :: TyFun (Last a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetLastSym0 #
SingI (GetMaxSym0 :: TyFun (Max a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetMaxSym0 #
SingI (GetMinSym0 :: TyFun (Min a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetMinSym0 #
SingI (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing UnwrapMonoidSym0 #
SingI (GetDualSym0 :: TyFun (Dual a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetDualSym0 #
SingI (GetProductSym0 :: TyFun (Product a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetProductSym0 #
SingI (GetSumSym0 :: TyFun (Sum a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing GetSumSym0 #
SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (ThenCmpSym1 d) #
SingI d => SingI (InstrClassSym1 d :: TyFun FailureType (IsMichelson ~> (HasAnns ~> InstrClass)) -> Type) Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing (InstrClassSym1 d) #
SingI d => SingI (ShowParenSym1 d :: TyFun (Symbol ~> Symbol) (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowParenSym1 d) #
SingI (ShowListWithSym0 :: TyFun (a ~> (Symbol ~> Symbol)) ([a] ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowListWithSym0 #
SingI (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SortBySym0 #
SingI (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListsortBySym0 #
SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing MaximumBySym0 #
SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing MinimumBySym0 #
SingI (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing InsertBySym0 #
SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DeleteFirstsBySym0 #
SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IntersectBySym0 #
SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnionBySym0 #
SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing GroupBySym0 #
SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NubBySym0 #
SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListnubBySym0 #
SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Elem_bySym0 #
SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DeleteBySym0 #
SingI (Scanl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Scanl1Sym0 #
SingI (Scanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Scanr1Sym0 #
SingI (Listscanr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing Listscanr1Sym0 #
SingI (Foldl1'Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Foldl1'Sym0 #
SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Foldl1Sym0 #
SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Foldr1Sym0 #
SingI (Listfoldl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing Listfoldl1Sym0 #
SingI (Listfoldr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing Listfoldr1Sym0 #
SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing UntilSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndexSym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindSym0 #
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing BreakSym0 #
SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing PartitionSym0 #
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SpanSym0 #
SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListpartitionSym0 #
SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListspanSym0 #
SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing AllSym0 #
SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing AnySym0 #
SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FindIndicesSym0 #
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DropWhileEndSym0 #
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DropWhileSym0 #
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing FilterSym0 #
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing TakeWhileSym0 #
SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListdropWhileSym0 #
SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListfilterSym0 #
SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListtakeWhileSym0 #
SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SelectSym0 #
SingI (AppEndoSym0 :: TyFun (Endo a) (a ~> a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AppEndoSym0 #
SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing GetMaxInternalSym0 #
SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing GetMinInternalSym0 #
SSemigroup a => SingI (SconcatSym0 :: TyFun (NonEmpty a) a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing SconcatSym0 #
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing FirstSym0 #
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing LastSym0 #
SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MaxInternalSym0 #
SingI (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MinInternalSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing IsJustSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing IsNothingSym0 #
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing MaybeToListSym0 #
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing FromJustSym0 #
SingI d => SingI (EfdtNatDnSym1 d :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatDnSym1 d) #
SingI d => SingI (EfdtNatSym1 d :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatSym1 d) #
SingI d => SingI (EfdtNatUpSym1 d :: TyFun Natural (Natural ~> [Natural]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatUpSym1 d) #
SingI (SplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SplitAtSym0 #
SingI (ListsplitAtSym0 :: TyFun Natural ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListsplitAtSym0 #
SingI (DropSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DropSym0 #
SingI (TakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing TakeSym0 #
SingI (ListdropSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListdropSym0 #
SingI (ListtakeSym0 :: TyFun Natural ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListtakeSym0 #
SShow a => SingI (ShowsPrecSym0 :: TyFun Natural (a ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowsPrecSym0 #
SingI (ReplicateSym0 :: TyFun Natural (a ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ReplicateSym0 #
SingI d => SingI (EftNatSym1 d :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EftNatSym1 d) #
SEnum a => SingI (ToEnumSym0 :: TyFun Natural a -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing ToEnumSym0 #
SNum a => SingI (FromIntegerSym0 :: TyFun Natural a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing FromIntegerSym0 #
SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing UnlessSym0 #
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing WhenSym0 #
SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing GuardSym0 #
SingI d => SingI (ShowCharSym1 d :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowCharSym1 d) #
SingI d => SingI (ShowStringSym1 d :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowStringSym1 d) #
SingI d => SingI (Show_tupleSym1 d :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (Show_tupleSym1 d) #
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing CatMaybesSym0 #
SingI (TransposeSym0 :: TyFun [[a]] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing TransposeSym0 #
SingI (ListtransposeSym0 :: TyFun [[a]] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListtransposeSym0 #
SingI (ConcatSym0 :: TyFun [[a]] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ConcatSym0 #
SingI ((!!@#@$) :: TyFun [a] (Natural ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (!!@#@$) #
SingI (ListindexSym0 :: TyFun [a] (Natural ~> a) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListindexSym0 #
SShow a => SingI (ShowListSym0 :: TyFun [a] (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowListSym0 #
SingI (IntercalateSym0 :: TyFun [a] ([[a]] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IntercalateSym0 #
SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IsInfixOfSym0 #
SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IsPrefixOfSym0 #
SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IsSuffixOfSym0 #
SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListisPrefixOfSym0 #
SEq a => SingI (IntersectSym0 :: TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IntersectSym0 #
SEq a => SingI (UnionSym0 :: TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnionSym0 #
SEq a => SingI ((\\@#@$) :: TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (\\@#@$) #
SingI ((++@#@$) :: TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (++@#@$) #
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing ListToMaybeSym0 #
SingI (LengthSym0 :: TyFun [a] Natural -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing LengthSym0 #
SingI (ListlengthSym0 :: TyFun [a] Natural -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListlengthSym0 #
SingI (NullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NullSym0 #
SingI (ListnullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListnullSym0 #
SEq a => SingI (GroupSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing GroupSym0 #
SingI (InitsSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing InitsSym0 #
SingI (NonEmptySubsequencesSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NonEmptySubsequencesSym0 #
SingI (PermutationsSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing PermutationsSym0 #
SingI (SubsequencesSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SubsequencesSym0 #
SingI (TailsSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing TailsSym0 #
SingI (ListinitsSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListinitsSym0 #
SingI (ListtailsSym0 :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListtailsSym0 #
SingI (InitSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing InitSym0 #
SEq a => SingI (NubSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NubSym0 #
SingI (ReverseSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ReverseSym0 #
SOrd a => SingI (SortSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SortSym0 #
SingI (TailSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing TailSym0 #
SingI (ListinitSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListinitSym0 #
SingI (ListreverseSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListreverseSym0 #
SOrd a => SingI (ListsortSym0 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListsortSym0 #
SingI (HeadSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing HeadSym0 #
SingI (LastSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing LastSym0 #
SOrd a => SingI (MaximumSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing MaximumSym0 #
SOrd a => SingI (MinimumSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing MinimumSym0 #
SNum a => SingI (ProductSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ProductSym0 #
SNum a => SingI (SumSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing SumSym0 #
SingI (ListlastSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListlastSym0 #
SOrd a => SingI (ListmaximumSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListmaximumSym0 #
SOrd a => SingI (ListminimumSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListminimumSym0 #
SNum a => SingI (ListproductSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListproductSym0 #
SNum a => SingI (ListsumSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListsumSym0 #
SMonoid a => SingI (MconcatSym0 :: TyFun [a] a -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing MconcatSym0 #
SingI (IdentitySym0 :: TyFun a (Identity a) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing IdentitySym0 #
SingI (DownSym0 :: TyFun a (Down a) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing DownSym0 #
SingI (FirstSym0 :: TyFun a (First a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing FirstSym0 #
SingI (LastSym0 :: TyFun a (Last a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing LastSym0 #
SingI (MaxSym0 :: TyFun a (Max a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing MaxSym0 #
SingI (MinSym0 :: TyFun a (Min a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing MinSym0 #
SingI (DualSym0 :: TyFun a (Dual a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing DualSym0 #
SingI (ProductSym0 :: TyFun a (Product a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing ProductSym0 #
SingI (Product_Sym0 :: TyFun a (Product a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods sing :: Sing Product_Sym0 #
SingI (SumSym0 :: TyFun a (Sum a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing SumSym0 #
SingI (Sum_Sym0 :: TyFun a (Sum a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal.Disambiguation Methods sing :: Sing Sum_Sym0 #
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing FromMaybeSym0 #
SShow a => SingI (ShowsSym0 :: TyFun a (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing ShowsSym0 #
SingI ((:\|@#@$) :: TyFun a ([a] ~> NonEmpty a) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (:\|@#@$) #
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemIndexSym0 #
SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemSym0 #
SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing NotElemSym0 #
SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListelemSym0 #
SEq a => SingI (ElemIndicesSym0 :: TyFun a ([a] ~> [Natural]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ElemIndicesSym0 #
SEq a => SingI (DeleteSym0 :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing DeleteSym0 #
SOrd a => SingI (InsertSym0 :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing InsertSym0 #
SingI (IntersperseSym0 :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing IntersperseSym0 #
SingI (PrependToAllSym0 :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing PrependToAllSym0 #
SOrd a => SingI (ListinsertSym0 :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListinsertSym0 #
SingI (ListintersperseSym0 :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListintersperseSym0 #
SingI ((:@#@$) :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (:@#@$) #
SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing CompareSym0 #
SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing Bool_Sym0 #
SEnum a => SingI (EnumFromThenToSym0 :: TyFun a (a ~> (a ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EnumFromThenToSym0 #
SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing (/=@#@$) #
SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing (==@#@$) #
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (<=@#@$) #
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (<@#@$) #
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (>=@#@$) #
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (>@#@$) #
SEnum a => SingI (EnumFromToSym0 :: TyFun a (a ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing EnumFromToSym0 #
SMonoid a => SingI (MappendSym0 :: TyFun a (a ~> a) -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing MappendSym0 #
SOrd a => SingI (MaxSym0 :: TyFun a (a ~> a) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing MaxSym0 #
SOrd a => SingI (MinSym0 :: TyFun a (a ~> a) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing MinSym0 #
SOrd a => SingI (Max_Sym0 :: TyFun a (a ~> a) -> Type)
Instance details Defined in Data.Ord.Singletons.Disambiguation Methods sing :: Sing Max_Sym0 #
SOrd a => SingI (Min_Sym0 :: TyFun a (a ~> a) -> Type)
Instance details Defined in Data.Ord.Singletons.Disambiguation Methods sing :: Sing Min_Sym0 #
SSemigroup a => SingI ((<>@#@$) :: TyFun a (a ~> a) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing (<>@#@$) #
SingI (AsTypeOfSym0 :: TyFun a (a ~> a) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing AsTypeOfSym0 #
SNum a => SingI ((*@#@$) :: TyFun a (a ~> a) -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing (*@#@$) #
SNum a => SingI ((+@#@$) :: TyFun a (a ~> a) -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing (+@#@$) #
SNum a => SingI ((-@#@$) :: TyFun a (a ~> a) -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing (-@#@$) #
SNum a => SingI (SubtractSym0 :: TyFun a (a ~> a) -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing SubtractSym0 #
SingI (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing JustSym0 #
SEnum a => SingI (FromEnumSym0 :: TyFun a Natural -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing FromEnumSym0 #
SShow a => SingI (Show_Sym0 :: TyFun a Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing Show_Sym0 #
SEnum a => SingI (PredSym0 :: TyFun a a -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing PredSym0 #
SEnum a => SingI (SuccSym0 :: TyFun a a -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing SuccSym0 #
SingI (IdSym0 :: TyFun a a -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing IdSym0 #
SNum a => SingI (AbsSym0 :: TyFun a a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing AbsSym0 #
SNum a => SingI (NegateSym0 :: TyFun a a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing NegateSym0 #
SNum a => SingI (SignumSym0 :: TyFun a a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing SignumSym0 #
SingI (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing WrapMonoidSym0 #
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AndSym0 #
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing OrSym0 #
SingI ((<=?@#@$) :: TyFun Natural (Natural ~> Bool) -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing (<=?@#@$) #
SingI x => SingI (DivSym1 x :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing (DivSym1 x) #
SingI x => SingI (ModSym1 x :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing (ModSym1 x) #
SingI x => SingI ((^@#@$$) x :: TyFun Natural Natural -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ((^@#@$$) x) #
SingI (IfSym0 :: TyFun Bool (k ~> (k ~> k)) -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing IfSym0 #
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing ((&&@#@$$) x) #
SingI x => SingI ((\|\|@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing ((\|\|@#@$$) x) #
SingI x => SingI (ConsSymbolSym1 x :: TyFun Symbol Symbol -> Type)
Instance details Defined in GHC.TypeLits.Singletons Methods sing :: Sing (ConsSymbolSym1 x) #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing IsLeftSym0 #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing IsRightSym0 #
(SingI d1, SingI d2) => SingI (InstrClassSym2 d1 d2 :: TyFun IsMichelson (HasAnns ~> InstrClass) -> Type) Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing (InstrClassSym2 d1 d2) #
SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MaximumBySym0 #
SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MinimumBySym0 #
SFoldable t => SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing Foldl1Sym0 #
SFoldable t => SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing Foldr1Sym0 #
SingI (ScanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ScanrSym0 #
SingI (ListscanrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> [b])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListscanrSym0 #
SingI (ListfoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> b)) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListfoldrSym0 #
SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> b)) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing FoldrSym0 #
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing MapMaybeSym0 #
SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing MfilterSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FindSym0 #
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AllSym0 #
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AnySym0 #
SingI (ConcatMapSym0 :: TyFun (a ~> [b]) ([a] ~> [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ConcatMapSym0 #
SingI d => SingI (UntilSym1 d :: TyFun (a ~> a) (a ~> a) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (UntilSym1 d) #
SingI (ListmapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListmapSym0 #
SingI (MapSym0 :: TyFun (a ~> b) ([a] ~> [b]) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing MapSym0 #
SingI (($!@#@$) :: TyFun (a ~> b) (a ~> b) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing ($!@#@$) #
SingI (($@#@$) :: TyFun (a ~> b) (a ~> b) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing ($@#@$) #
SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing FilterMSym0 #
SingI (ScanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ScanlSym0 #
SingI (ListscanlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> [b])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListscanlSym0 #
SingI (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Foldl'Sym0 #
SingI (Listfoldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing Listfoldl'Sym0 #
SingI (ListfoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListfoldlSym0 #
SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing FoldlSym0 #
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnfoldrSym0 #
SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ComparingSym0 #
SingI (RunStateLSym0 :: TyFun (StateL s a) (s ~> (s, a)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing RunStateLSym0 #
SingI (RunStateRSym0 :: TyFun (StateR s a) (s ~> (s, a)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing RunStateRSym0 #
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing (FromMaybeSym1 d) #
SApplicative m => SingI (ReplicateM_Sym0 :: TyFun Natural (m a ~> m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ReplicateM_Sym0 #
SApplicative m => SingI (ReplicateMSym0 :: TyFun Natural (m a ~> m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ReplicateMSym0 #
(SingI d1, SingI d2) => SingI (EfdtNatDnSym2 d1 d2 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatDnSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (EfdtNatSym2 d1 d2 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (EfdtNatUpSym2 d1 d2 :: TyFun Natural [Natural] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EfdtNatUpSym2 d1 d2) #
SingI d => SingI ((!!@#@$$) d :: TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ((!!@#@$$) d) #
SingI d => SingI (ListindexSym1 d :: TyFun Natural a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListindexSym1 d) #
SingI (SwapSym0 :: TyFun (a, b) (b, a) -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing SwapSym0 #
SingI (FstSym0 :: TyFun (a, b) a -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing FstSym0 #
SingI (SndSym0 :: TyFun (a, b) b -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing SndSym0 #
(SShow a, SingI d) => SingI (ShowListSym1 d :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowListSym1 d) #
(SingI d1, SingI d2) => SingI (ShowParenSym2 d1 d2 :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowParenSym2 d1 d2) #
(SShow a, SingI d) => SingI (ShowsSym1 d :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowsSym1 d) #
SingI (ErrorSym0 :: TyFun Symbol a -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ErrorSym0 #
SingI (ErrorWithoutStackTraceSym0 :: TyFun Symbol a -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ErrorWithoutStackTraceSym0 #
SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing PartitionEithersSym0 #
SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing LeftsSym0 #
SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing RightsSym0 #
SingI (UnzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing UnzipSym0 #
SingI (ListunzipSym0 :: TyFun [(a, b)] ([a], [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListunzipSym0 #
SingI d => SingI (IntercalateSym1 d :: TyFun [[a]] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IntercalateSym1 d) #
SingI d => SingI (ShowListWithSym1 d :: TyFun [a] (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowListWithSym1 d) #
SingI d => SingI (DeleteFirstsBySym1 d :: TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DeleteFirstsBySym1 d) #
SingI d => SingI (IntersectBySym1 d :: TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IntersectBySym1 d) #
SingI d => SingI (UnionBySym1 d :: TyFun [a] ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (UnionBySym1 d) #
SingI (ZipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ZipSym0 #
SingI (ListzipSym0 :: TyFun [a] ([b] ~> [(a, b)]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListzipSym0 #
SingI d => SingI ((:\|@#@$$) d :: TyFun [a] (NonEmpty a) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing ((:\|@#@$$) d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Natural) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindIndexSym1 d) #
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (BreakSym1 d :: TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (BreakSym1 d) #
SingI d => SingI (PartitionSym1 d :: TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (PartitionSym1 d) #
SingI d => SingI (SpanSym1 d :: TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (SpanSym1 d) #
SingI d => SingI (SplitAtSym1 d :: TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (SplitAtSym1 d) #
SingI d => SingI (ListpartitionSym1 d :: TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListpartitionSym1 d) #
SingI d => SingI (ListspanSym1 d :: TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListspanSym1 d) #
SingI d => SingI (ListsplitAtSym1 d :: TyFun [a] ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListsplitAtSym1 d) #
SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (AllSym1 d) #
SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (AnySym1 d) #
(SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemSym1 d) #
(SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsInfixOfSym1 d) #
(SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IsSuffixOfSym1 d) #
(SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (NotElemSym1 d) #
(SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListelemSym1 d) #
(SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListisPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (ElemIndicesSym1 d :: TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ElemIndicesSym1 d) #
SingI d => SingI (FindIndicesSym1 d :: TyFun [a] [Natural] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FindIndicesSym1 d) #
SingI d => SingI (GroupBySym1 d :: TyFun [a] [[a]] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (GroupBySym1 d) #
(SEq a, SingI d) => SingI (DeleteSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DeleteSym1 d) #
SingI d => SingI (DropSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DropSym1 d) #
SingI d => SingI (DropWhileEndSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DropWhileEndSym1 d) #
SingI d => SingI (DropWhileSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DropWhileSym1 d) #
SingI d => SingI (FilterSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (FilterSym1 d) #
(SOrd a, SingI d) => SingI (InsertSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (InsertSym1 d) #
(SEq a, SingI d) => SingI (IntersectSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IntersectSym1 d) #
SingI d => SingI (IntersperseSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IntersperseSym1 d) #
SingI d => SingI (NubBySym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (NubBySym1 d) #
SingI d => SingI (PrependToAllSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (PrependToAllSym1 d) #
SingI d => SingI (Scanl1Sym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Scanl1Sym1 d) #
SingI d => SingI (Scanr1Sym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Scanr1Sym1 d) #
SingI d => SingI (SortBySym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (SortBySym1 d) #
SingI d => SingI (TakeSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (TakeSym1 d) #
SingI d => SingI (TakeWhileSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (TakeWhileSym1 d) #
(SEq a, SingI d) => SingI (UnionSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (UnionSym1 d) #
(SEq a, SingI d) => SingI ((\\@#@$$) d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ((\\@#@$$) d) #
SingI d => SingI (ListdropSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListdropSym1 d) #
SingI d => SingI (ListdropWhileSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListdropWhileSym1 d) #
SingI d => SingI (ListfilterSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListfilterSym1 d) #
(SOrd a, SingI d) => SingI (ListinsertSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListinsertSym1 d) #
SingI d => SingI (ListintersperseSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListintersperseSym1 d) #
SingI d => SingI (ListnubBySym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListnubBySym1 d) #
SingI d => SingI (Listscanr1Sym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (Listscanr1Sym1 d) #
SingI d => SingI (ListsortBySym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListsortBySym1 d) #
SingI d => SingI (ListtakeSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListtakeSym1 d) #
SingI d => SingI (ListtakeWhileSym1 d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListtakeWhileSym1 d) #
SingI d => SingI ((:@#@$$) d :: TyFun [a] [a] -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing ((:@#@$$) d) #
SingI d => SingI ((++@#@$$) d :: TyFun [a] [a] -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing ((++@#@$$) d) #
SingI d => SingI (Foldl1'Sym1 d :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Foldl1'Sym1 d) #
SingI d => SingI (Foldl1Sym1 d :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Foldl1Sym1 d) #
SingI d => SingI (Foldr1Sym1 d :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Foldr1Sym1 d) #
SingI d => SingI (MaximumBySym1 d :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (MaximumBySym1 d) #
SingI d => SingI (MinimumBySym1 d :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (MinimumBySym1 d) #
SingI d => SingI (Listfoldl1Sym1 d :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (Listfoldl1Sym1 d) #
SingI d => SingI (Listfoldr1Sym1 d :: TyFun [a] a -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (Listfoldr1Sym1 d) #
SNum i => SingI (GenericLengthSym0 :: TyFun [a] i -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing GenericLengthSym0 #
SingI (LeftSym0 :: TyFun a (Either a b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing LeftSym0 #
(SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (CompareSym1 d) #
SingI d => SingI (SelectSym1 d :: TyFun a (([a], [a]) ~> ([a], [a])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (SelectSym1 d) #
SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (Bool_Sym1 d) #
(SShow a, SingI d) => SingI (ShowsPrecSym1 d :: TyFun a (Symbol ~> Symbol) -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowsPrecSym1 d) #
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing LookupSym0 #
SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Elem_bySym1 d) #
SingI d => SingI (DeleteBySym1 d :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DeleteBySym1 d) #
SingI d => SingI (InsertBySym1 d :: TyFun a ([a] ~> [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (InsertBySym1 d) #
(SEnum a, SingI d) => SingI (EnumFromThenToSym1 d :: TyFun a (a ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EnumFromThenToSym1 d) #
SingI (ArgSym0 :: TyFun a (b ~> Arg a b) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods sing :: Sing ArgSym0 #
SingI (Tuple2Sym0 :: TyFun a (b ~> (a, b)) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing Tuple2Sym0 #
SingI (ConstSym0 :: TyFun a (b ~> a) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing ConstSym0 #
SingI (SeqSym0 :: TyFun a (b ~> b) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing SeqSym0 #
SingI (AsProxyTypeOfSym0 :: TyFun a (proxy a ~> a) -> Type)
Instance details Defined in Data.Proxy.Singletons Methods sing :: Sing AsProxyTypeOfSym0 #
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ElemSym0 #
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing NotElemSym0 #
(SEq a, SingI d) => SingI ((/=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing ((/=@#@$$) d) #
(SEq a, SingI d) => SingI ((==@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Eq.Singletons Methods sing :: Sing ((==@#@$$) d) #
(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((<=@#@$$) d) #
(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((<@#@$$) d) #
(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((>=@#@$$) d) #
(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing ((>@#@$$) d) #
SingI d => SingI (ReplicateSym1 d :: TyFun a [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ReplicateSym1 d) #
(SEnum a, SingI d) => SingI (EnumFromToSym1 d :: TyFun a [a] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EnumFromToSym1 d) #
SingI d => SingI (AppEndoSym1 d :: TyFun a a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AppEndoSym1 d) #
(SMonoid a, SingI d) => SingI (MappendSym1 d :: TyFun a a -> Type)
Instance details Defined in Data.Monoid.Singletons Methods sing :: Sing (MappendSym1 d) #
(SOrd a, SingI d) => SingI (MaxSym1 d :: TyFun a a -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (MaxSym1 d) #
(SOrd a, SingI d) => SingI (MinSym1 d :: TyFun a a -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (MinSym1 d) #
(SOrd a, SingI d) => SingI (Max_Sym1 d :: TyFun a a -> Type)
Instance details Defined in Data.Ord.Singletons.Disambiguation Methods sing :: Sing (Max_Sym1 d) #
(SOrd a, SingI d) => SingI (Min_Sym1 d :: TyFun a a -> Type)
Instance details Defined in Data.Ord.Singletons.Disambiguation Methods sing :: Sing (Min_Sym1 d) #
(SSemigroup a, SingI d) => SingI ((<>@#@$$) d :: TyFun a a -> Type)
Instance details Defined in Data.Semigroup.Singletons.Internal Methods sing :: Sing ((<>@#@$$) d) #
SingI d => SingI (AsTypeOfSym1 d :: TyFun a a -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (AsTypeOfSym1 d) #
(SNum a, SingI d) => SingI ((*@#@$$) d :: TyFun a a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing ((*@#@$$) d) #
(SNum a, SingI d) => SingI ((+@#@$$) d :: TyFun a a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing ((+@#@$$) d) #
(SNum a, SingI d) => SingI ((-@#@$$) d :: TyFun a a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing ((-@#@$$) d) #
(SNum a, SingI d) => SingI (SubtractSym1 d :: TyFun a a -> Type)
Instance details Defined in GHC.Num.Singletons Methods sing :: Sing (SubtractSym1 d) #
SApplicative f => SingI (PureSym0 :: TyFun a (f a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing PureSym0 #
SMonad m => SingI (ReturnSym0 :: TyFun a (m a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ReturnSym0 #
SingI (RightSym0 :: TyFun b (Either a b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing RightSym0 #
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing Maybe_Sym0 #
(SApplicative f, SingI d) => SingI (UnlessSym1 d :: TyFun (f ()) (f ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (UnlessSym1 d) #
(SApplicative f, SingI d) => SingI (WhenSym1 d :: TyFun (f ()) (f ()) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (WhenSym1 d) #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Control.Applicative.Singletons Methods sing :: Sing OptionalSym0 #
SFunctor f => SingI (VoidSym0 :: TyFun (f a) (f ()) -> Type)
Instance details Defined in Data.Functor.Singletons Methods sing :: Sing VoidSym0 #
SMonad m => SingI (JoinSym0 :: TyFun (m (m a)) (m a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing JoinSym0 #
SFoldable t => SingI (ConcatSym0 :: TyFun (t [a]) [a] -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ConcatSym0 #
SFoldable t => SingI (ToListSym0 :: TyFun (t a) [a] -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ToListSym0 #
(SFoldable t, SOrd a) => SingI (MaximumSym0 :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MaximumSym0 #
(SFoldable t, SOrd a) => SingI (MinimumSym0 :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MinimumSym0 #
(SFoldable t, SNum a) => SingI (ProductSym0 :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ProductSym0 #
(SFoldable t, SNum a) => SingI (SumSym0 :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing SumSym0 #
(SFoldable t, SMonoid m) => SingI (FoldSym0 :: TyFun (t m) m -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FoldSym0 #
SingI x => SingI ((<=?@#@$$) x :: TyFun Natural Bool -> Type)
Instance details Defined in GHC.TypeLits.Singletons.Internal Methods sing :: Sing ((<=?@#@$$) x) #
SingI c => SingI (IfSym1 c :: TyFun k (k ~> k) -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (IfSym1 c) #
SingI a => SingI ('WrapSing s :: WrappedSing a)
Instance details Defined in Data.Singletons Methods sing :: Sing ('WrapSing s) #
SingI (GetConstSym0 :: TyFun (Const a b) a -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods sing :: Sing GetConstSym0 #
(SingI d1, SingI d2, SingI d3) => SingI (InstrClassSym3 d1 d2 d3 :: TyFun HasAnns InstrClass -> Type) Source #
Instance details Defined in Morley.Michelson.Typed.ClassifiedInstr.Internal.Types Methods sing :: Sing (InstrClassSym3 d1 d2 d3) #
SingI (CurrySym0 :: TyFun ((a, b) ~> c) (a ~> (b ~> c)) -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing CurrySym0 #
SFoldable t => SingI (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing Foldr'Sym0 #
SFoldable t => SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FoldrSym0 #
SingI (UncurrySym0 :: TyFun (a ~> (b ~> c)) ((a, b) ~> c) -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing UncurrySym0 #
SingI (ZipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ZipWithSym0 #
SingI (ListzipWithSym0 :: TyFun (a ~> (b ~> c)) ([a] ~> ([b] ~> [c])) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing ListzipWithSym0 #
SingI (FlipSym0 :: TyFun (a ~> (b ~> c)) (b ~> (a ~> c)) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing FlipSym0 #
SFoldable t => SingI (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ConcatMapSym0 #
SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing (Maybe_Sym1 d) #
SFunctor f => SingI (FmapSym0 :: TyFun (a ~> b) (f a ~> f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing FmapSym0 #
SApplicative f => SingI (LiftASym0 :: TyFun (a ~> b) (f a ~> f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftASym0 #
SFunctor f => SingI ((<$>@#@$) :: TyFun (a ~> b) (f a ~> f b) -> Type)
Instance details Defined in Data.Functor.Singletons Methods sing :: Sing (<$>@#@$) #
SMonad m => SingI ((<$!>@#@$) :: TyFun (a ~> b) (m a ~> m b) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (<$!>@#@$) #
STraversable t => SingI (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing FmapDefaultSym0 #
SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing Either_Sym0 #
(SFoldable t, SMonoid m) => SingI (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FoldMapSym0 #
(STraversable t, SMonoid m) => SingI (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing FoldMapDefaultSym0 #
SMonad m => SingI ((=<<@#@$) :: TyFun (a ~> m b) (m a ~> m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (=<<@#@$) #
SMonad m => SingI (LiftMSym0 :: TyFun (a1 ~> r) (m a1 ~> m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftMSym0 #
SingI (MapAccumLSym0 :: TyFun (acc ~> (x ~> (acc, y))) (acc ~> ([x] ~> (acc, [y]))) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing MapAccumLSym0 #
SingI (MapAccumRSym0 :: TyFun (acc ~> (x ~> (acc, y))) (acc ~> ([x] ~> (acc, [y]))) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing MapAccumRSym0 #
SFoldable t => SingI (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing Foldl'Sym0 #
SFoldable t => SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FoldlSym0 #
SingI ((.@#@$) :: TyFun (b ~> c) ((a ~> b) ~> (a ~> c)) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (.@#@$) #
(SingI d1, SingI d2) => SingI (SelectSym2 d1 d2 :: TyFun ([a], [a]) ([a], [a]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (SelectSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (Bool_Sym2 d1 d2) #
(SingI d1, SingI d2) => SingI (ShowListWithSym2 d1 d2 :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowListWithSym2 d1 d2) #
(SShow a, SingI d1, SingI d2) => SingI (ShowsPrecSym2 d1 d2 :: TyFun Symbol Symbol -> Type)
Instance details Defined in Text.Show.Singletons Methods sing :: Sing (ShowsPrecSym2 d1 d2) #
(SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (LookupSym1 d) #
SingI (Unzip3Sym0 :: TyFun [(a, b, c)] ([a], [b], [c]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Unzip3Sym0 #
SMonadFail m => SingI (FailSym0 :: TyFun [Char] (m a) -> Type)
Instance details Defined in Control.Monad.Fail.Singletons Methods sing :: Sing FailSym0 #
SingI (Zip3Sym0 :: TyFun [a] ([b] ~> ([c] ~> [(a, b, c)])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Zip3Sym0 #
(SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Elem_bySym2 d1 d2) #
(SingI d1, SingI d2) => SingI (DeleteBySym2 d1 d2 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DeleteBySym2 d1 d2) #
(SingI d1, SingI d2) => SingI (DeleteFirstsBySym2 d1 d2 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (DeleteFirstsBySym2 d1 d2) #
(SingI d1, SingI d2) => SingI (InsertBySym2 d1 d2 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (InsertBySym2 d1 d2) #
(SingI d1, SingI d2) => SingI (IntersectBySym2 d1 d2 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (IntersectBySym2 d1 d2) #
(SingI d1, SingI d2) => SingI (UnionBySym2 d1 d2 :: TyFun [a] [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (UnionBySym2 d1 d2) #
SingI d => SingI (ConcatMapSym1 d :: TyFun [a] [b] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ConcatMapSym1 d) #
SingI d => SingI (ListmapSym1 d :: TyFun [a] [b] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListmapSym1 d) #
SingI d => SingI (MapMaybeSym1 d :: TyFun [a] [b] -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing (MapMaybeSym1 d) #
SingI d => SingI (MapSym1 d :: TyFun [a] [b] -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (MapSym1 d) #
(SApplicative m, SingI d) => SingI (FilterMSym1 d :: TyFun [a] (m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (FilterMSym1 d) #
SingI d => SingI (ZipSym1 d :: TyFun [b] [(a, b)] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ZipSym1 d) #
SingI d => SingI (ListzipSym1 d :: TyFun [b] [(a, b)] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListzipSym1 d) #
SingI (Tuple3Sym0 :: TyFun a (b ~> (c ~> (a, b, c))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing Tuple3Sym0 #
SFunctor f => SingI ((<$@#@$) :: TyFun a (f b ~> f a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (<$@#@$) #
(SEnum a, SingI d1, SingI d2) => SingI (EnumFromThenToSym2 d1 d2 :: TyFun a [a] -> Type)
Instance details Defined in Data.Singletons.Base.Enum Methods sing :: Sing (EnumFromThenToSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (UntilSym2 d1 d2 :: TyFun a a -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (UntilSym2 d1 d2) #
SingI d => SingI (($!@#@$$) d :: TyFun a b -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (($!@#@$$) d) #
SingI d => SingI (($@#@$$) d :: TyFun a b -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (($@#@$$) d) #
SingI d => SingI (ArgSym1 d :: TyFun b (Arg a b) -> Type)
Instance details Defined in Data.Semigroup.Singletons Methods sing :: Sing (ArgSym1 d) #
SingI d => SingI (ScanlSym1 d :: TyFun b ([a] ~> [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ScanlSym1 d) #
SingI d => SingI (ScanrSym1 d :: TyFun b ([a] ~> [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ScanrSym1 d) #
SingI d => SingI (ListscanlSym1 d :: TyFun b ([a] ~> [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListscanlSym1 d) #
SingI d => SingI (ListscanrSym1 d :: TyFun b ([a] ~> [b]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListscanrSym1 d) #
SingI d => SingI (Foldl'Sym1 d :: TyFun b ([a] ~> b) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Foldl'Sym1 d) #
SingI d => SingI (Listfoldl'Sym1 d :: TyFun b ([a] ~> b) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (Listfoldl'Sym1 d) #
SingI d => SingI (ListfoldlSym1 d :: TyFun b ([a] ~> b) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListfoldlSym1 d) #
SingI d => SingI (ListfoldrSym1 d :: TyFun b ([a] ~> b) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListfoldrSym1 d) #
SingI d => SingI (FoldlSym1 d :: TyFun b ([a] ~> b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (FoldlSym1 d) #
SingI d => SingI (FoldrSym1 d :: TyFun b ([a] ~> b) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (FoldrSym1 d) #
(SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (ComparingSym1 d) #
SingI d => SingI (Tuple2Sym1 d :: TyFun b (a, b) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple2Sym1 d) #
SingI d => SingI (UnfoldrSym1 d :: TyFun b [a] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (UnfoldrSym1 d) #
SingI d => SingI (ConstSym1 d :: TyFun b a -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (ConstSym1 d) #
SingI d => SingI (SeqSym1 d :: TyFun b b -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (SeqSym1 d) #
SApplicative f => SingI ((<*>@#@$) :: TyFun (f (a ~> b)) (f a ~> f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (<*>@#@$) #
SFunctor f => SingI ((<&>@#@$) :: TyFun (f a) ((a ~> b) ~> f b) -> Type)
Instance details Defined in Data.Functor.Singletons Methods sing :: Sing (<&>@#@$) #
SFunctor f => SingI (($>@#@$) :: TyFun (f a) (b ~> f b) -> Type)
Instance details Defined in Data.Functor.Singletons Methods sing :: Sing ($>@#@$) #
SApplicative f => SingI ((<**>@#@$) :: TyFun (f a) (f (a ~> b) ~> f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (<**>@#@$) #
SAlternative f => SingI ((<\|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (<\|>@#@$) #
SMonad m => SingI (ApSym0 :: TyFun (m (a ~> b)) (m a ~> m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ApSym0 #
SMonad m => SingI ((>>=@#@$) :: TyFun (m a) ((a ~> m b) ~> m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (>>=@#@$) #
SMonadPlus m => SingI (MplusSym0 :: TyFun (m a) (m a ~> m a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing MplusSym0 #
(SApplicative m, SingI d) => SingI (ReplicateM_Sym1 d :: TyFun (m a) (m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (ReplicateM_Sym1 d) #
(SApplicative m, SingI d) => SingI (ReplicateMSym1 d :: TyFun (m a) (m [a]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (ReplicateMSym1 d) #
(SMonadPlus m, SingI d) => SingI (MfilterSym1 d :: TyFun (m a) (m a) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (MfilterSym1 d) #
SingI d => SingI (AsProxyTypeOfSym1 d :: TyFun (proxy a) a -> Type)
Instance details Defined in Data.Proxy.Singletons Methods sing :: Sing (AsProxyTypeOfSym1 d) #
SingI d => SingI (RunStateLSym1 d :: TyFun s (s, a) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (RunStateLSym1 d) #
SingI d => SingI (RunStateRSym1 d :: TyFun s (s, a) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (RunStateRSym1 d) #
(SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FindSym1 d) #
SFoldable t => SingI (LengthSym0 :: TyFun (t a) Natural -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing LengthSym0 #
(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AllSym1 d) #
(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AnySym1 d) #
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ElemSym1 d) #
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (NotElemSym1 d) #
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing NullSym0 #
(SFoldable t, SingI d) => SingI (Foldl1Sym1 d :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl1Sym1 d) #
(SFoldable t, SingI d) => SingI (Foldr1Sym1 d :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr1Sym1 d) #
(SFoldable t, SingI d) => SingI (MaximumBySym1 d :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MaximumBySym1 d) #
(SFoldable t, SingI d) => SingI (MinimumBySym1 d :: TyFun (t a) a -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MinimumBySym1 d) #
(SFoldable t, SApplicative f) => SingI (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing SequenceA_Sym0 #
(STraversable t, SApplicative f) => SingI (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing SequenceASym0 #
(SFoldable t, SMonad m) => SingI (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing Sequence_Sym0 #
(STraversable t, SMonad m) => SingI (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing SequenceSym0 #
SingI (ConstSym0 :: TyFun a (Const a b) -> Type)
Instance details Defined in Data.Functor.Const.Singletons Methods sing :: Sing ConstSym0 #
(SingI c, SingI t) => SingI (IfSym2 c t :: TyFun k k -> Type)
Instance details Defined in Data.Bool.Singletons Methods sing :: Sing (IfSym2 c t) #
(forall (a :: k1). SingI a => SingI (f a), (ApplyTyCon :: (k1 -> kr) -> TyFun k1 kr -> Type) ~ (ApplyTyConAux1 :: (k1 -> kr) -> TyFun k1 kr -> Type)) => SingI (TyCon1 f :: TyFun k1 kr -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon1 f) #
SingI (ZipWith3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) ([a] ~> ([b] ~> ([c] ~> [d]))) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing ZipWith3Sym0 #
STraversable t => SingI (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing MapAccumLSym0 #
STraversable t => SingI (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing MapAccumRSym0 #
SApplicative f => SingI (LiftA2Sym0 :: TyFun (a ~> (b ~> c)) (f a ~> (f b ~> f c)) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftA2Sym0 #
(SFoldable t, SMonad m) => SingI (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FoldrMSym0 #
SApplicative m => SingI (ZipWithM_Sym0 :: TyFun (a ~> (b ~> m c)) ([a] ~> ([b] ~> m ())) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ZipWithM_Sym0 #
SApplicative m => SingI (ZipWithMSym0 :: TyFun (a ~> (b ~> m c)) ([a] ~> ([b] ~> m [c])) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ZipWithMSym0 #
SingI d => SingI ((.@#@$$) d :: TyFun (a ~> b) (a ~> c) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing ((.@#@$$) d) #
(SFunctor f, SingI d) => SingI ((<&>@#@$$) d :: TyFun (a ~> b) (f b) -> Type)
Instance details Defined in Data.Functor.Singletons Methods sing :: Sing ((<&>@#@$$) d) #
(SFoldable t, SApplicative f) => SingI (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing Traverse_Sym0 #
(STraversable t, SApplicative f) => SingI (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing TraverseSym0 #
SApplicative m => SingI (MapAndUnzipMSym0 :: TyFun (a ~> m (b, c)) ([a] ~> m ([b], [c])) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing MapAndUnzipMSym0 #
SMonad m => SingI ((>=>@#@$) :: TyFun (a ~> m b) ((b ~> m c) ~> (a ~> m c)) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (>=>@#@$) #
(SFoldable t, SMonad m) => SingI (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MapM_Sym0 #
(STraversable t, SMonad m) => SingI (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing MapMSym0 #
(SMonad m, SingI d) => SingI ((>>=@#@$$) d :: TyFun (a ~> m b) (m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((>>=@#@$$) d) #
SMonad m => SingI (LiftM2Sym0 :: TyFun (a1 ~> (a2 ~> r)) (m a1 ~> (m a2 ~> m r)) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftM2Sym0 #
(SFoldable t, SMonad m) => SingI (FoldM_Sym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m ())) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing FoldM_Sym0 #
(SFoldable t, SMonad m) => SingI (FoldMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing FoldMSym0 #
(SFoldable t, SMonad m) => SingI (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing FoldlMSym0 #
SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym1 d) #
SMonad m => SingI ((<=<@#@$) :: TyFun (b ~> m c) ((a ~> m b) ~> (a ~> m c)) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (<=<@#@$) #
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Maybe.Singletons Methods sing :: Sing (Maybe_Sym2 d1 d2) #
SingI d => SingI (UncurrySym1 d :: TyFun (a, b) c -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing (UncurrySym1 d) #
SingI (Unzip4Sym0 :: TyFun [(a, b, c, d)] ([a], [b], [c], [d]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Unzip4Sym0 #
SingI d => SingI (ZipWithSym1 d :: TyFun [a] ([b] ~> [c]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ZipWithSym1 d) #
SingI d => SingI (ListzipWithSym1 d :: TyFun [a] ([b] ~> [c]) -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListzipWithSym1 d) #
(SingI d1, SingI d2) => SingI (ScanlSym2 d1 d2 :: TyFun [a] [b] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ScanlSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (ScanrSym2 d1 d2 :: TyFun [a] [b] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ScanrSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (ListscanlSym2 d1 d2 :: TyFun [a] [b] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListscanlSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (ListscanrSym2 d1 d2 :: TyFun [a] [b] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListscanrSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Foldl'Sym2 d1 d2 :: TyFun [a] b -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Foldl'Sym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Listfoldl'Sym2 d1 d2 :: TyFun [a] b -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (Listfoldl'Sym2 d1 d2) #
(SingI d1, SingI d2) => SingI (ListfoldlSym2 d1 d2 :: TyFun [a] b -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListfoldlSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (ListfoldrSym2 d1 d2 :: TyFun [a] b -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListfoldrSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun [a] b -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (FoldlSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun [a] b -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (FoldrSym2 d1 d2) #
SingI d => SingI (Zip3Sym1 d :: TyFun [b] ([c] ~> [(a, b, c)]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Zip3Sym1 d) #
SingI (Tuple4Sym0 :: TyFun a (b ~> (c ~> (d ~> (a, b, c, d)))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing Tuple4Sym0 #
SingI d => SingI (CurrySym1 d :: TyFun a (b ~> c) -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing (CurrySym1 d) #
SingI d => SingI (MapAccumLSym1 d :: TyFun acc ([x] ~> (acc, [y])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (MapAccumLSym1 d) #
SingI d => SingI (MapAccumRSym1 d :: TyFun acc ([x] ~> (acc, [y])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (MapAccumRSym1 d) #
(SOrd a, SingI d1, SingI d2) => SingI (ComparingSym2 d1 d2 :: TyFun b Ordering -> Type)
Instance details Defined in Data.Ord.Singletons Methods sing :: Sing (ComparingSym2 d1 d2) #
SingI d => SingI (FlipSym1 d :: TyFun b (a ~> c) -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (FlipSym1 d) #
SingI d => SingI (Tuple3Sym1 d :: TyFun b (c ~> (a, b, c)) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple3Sym1 d) #
(SFoldable t, SingI d) => SingI (Foldl'Sym1 d :: TyFun b (t a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl'Sym1 d) #
(SFoldable t, SingI d) => SingI (FoldlSym1 d :: TyFun b (t a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlSym1 d) #
(SFoldable t, SingI d) => SingI (Foldr'Sym1 d :: TyFun b (t a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr'Sym1 d) #
(SFoldable t, SingI d) => SingI (FoldrSym1 d :: TyFun b (t a ~> b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrSym1 d) #
(SFunctor f, SingI d) => SingI (($>@#@$$) d :: TyFun b (f b) -> Type)
Instance details Defined in Data.Functor.Singletons Methods sing :: Sing (($>@#@$$) d) #
(SApplicative f, SingI d) => SingI ((<**>@#@$$) d :: TyFun (f (a ~> b)) (f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((<**>@#@$$) d) #
SApplicative f => SingI ((<*@#@$) :: TyFun (f a) (f b ~> f a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (<*@#@$) #
SApplicative f => SingI ((*>@#@$) :: TyFun (f a) (f b ~> f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (*>@#@$) #
(SAlternative f, SingI d) => SingI ((<\|>@#@$$) d :: TyFun (f a) (f a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((<\|>@#@$$) d) #
(SApplicative f, SingI d) => SingI ((<*>@#@$$) d :: TyFun (f a) (f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((<*>@#@$$) d) #
(SFunctor f, SingI d) => SingI (FmapSym1 d :: TyFun (f a) (f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (FmapSym1 d) #
(SApplicative f, SingI d) => SingI (LiftASym1 d :: TyFun (f a) (f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftASym1 d) #
(SFunctor f, SingI d) => SingI ((<$>@#@$$) d :: TyFun (f a) (f b) -> Type)
Instance details Defined in Data.Functor.Singletons Methods sing :: Sing ((<$>@#@$$) d) #
(SFunctor f, SingI d) => SingI ((<$@#@$$) d :: TyFun (f b) (f a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((<$@#@$$) d) #
SMonad m => SingI ((>>@#@$) :: TyFun (m a) (m b ~> m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (>>@#@$) #
(SMonadPlus m, SingI d) => SingI (MplusSym1 d :: TyFun (m a) (m a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (MplusSym1 d) #
(SMonad m, SingI d) => SingI ((<$!>@#@$$) d :: TyFun (m a) (m b) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ((<$!>@#@$$) d) #
(SMonad m, SingI d) => SingI ((=<<@#@$$) d :: TyFun (m a) (m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((=<<@#@$$) d) #
(SMonad m, SingI d) => SingI (ApSym1 d :: TyFun (m a) (m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (ApSym1 d) #
(SMonad m, SingI d) => SingI (LiftMSym1 d :: TyFun (m a1) (m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftMSym1 d) #
(SFoldable t, SApplicative f) => SingI (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing For_Sym0 #
(STraversable t, SApplicative f) => SingI (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing ForSym0 #
(SFoldable t, SMonad m) => SingI (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing ForM_Sym0 #
(STraversable t, SMonad m) => SingI (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing ForMSym0 #
(SFoldable t, SingI d) => SingI (ConcatMapSym1 d :: TyFun (t a) [b] -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ConcatMapSym1 d) #
(SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d :: TyFun (t a) m -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldMapSym1 d) #
(STraversable t, SMonoid m, SingI d) => SingI (FoldMapDefaultSym1 d :: TyFun (t a) m -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (FoldMapDefaultSym1 d) #
(STraversable t, SingI d) => SingI (FmapDefaultSym1 d :: TyFun (t a) (t b) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (FmapDefaultSym1 d) #
(SFoldable t, SAlternative f) => SingI (AsumSym0 :: TyFun (t (f a)) (f a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing AsumSym0 #
(SFoldable t, SMonadPlus m) => SingI (MsumSym0 :: TyFun (t (m a)) (m a) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing MsumSym0 #
(forall (a :: k1) (b :: k2). (SingI a, SingI b) => SingI (f a b), (ApplyTyCon :: (k2 -> kr) -> TyFun k2 kr -> Type) ~ (ApplyTyConAux1 :: (k2 -> kr) -> TyFun k2 kr -> Type)) => SingI (TyCon2 f :: TyFun k1 (k2 ~> kr) -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon2 f) #
(SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type)
Instance details Defined in Data.Either.Singletons Methods sing :: Sing (Either_Sym2 d1 d2) #
SApplicative f => SingI (LiftA3Sym0 :: TyFun (a ~> (b ~> (c ~> d))) (f a ~> (f b ~> (f c ~> f d))) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftA3Sym0 #
(SFoldable t, SApplicative f, SingI d) => SingI (For_Sym1 d :: TyFun (a ~> f b) (f ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (For_Sym1 d) #
(STraversable t, SApplicative f, SingI d) => SingI (ForSym1 d :: TyFun (a ~> f b) (f (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (ForSym1 d) #
(SMonad m, SingI d) => SingI ((<=<@#@$$) d :: TyFun (a ~> m b) (a ~> m c) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ((<=<@#@$$) d) #
(SFoldable t, SMonad m, SingI d) => SingI (ForM_Sym1 d :: TyFun (a ~> m b) (m ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ForM_Sym1 d) #
(STraversable t, SMonad m, SingI d) => SingI (ForMSym1 d :: TyFun (a ~> m b) (m (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (ForMSym1 d) #
SMonad m => SingI (LiftM3Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> r))) (m a1 ~> (m a2 ~> (m a3 ~> m r))) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftM3Sym0 #
(SMonad m, SingI d) => SingI ((>=>@#@$$) d :: TyFun (b ~> m c) (a ~> m c) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing ((>=>@#@$$) d) #
SingI (Unzip5Sym0 :: TyFun [(a, b, c, d, e)] ([a], [b], [c], [d], [e]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Unzip5Sym0 #
SingI d2 => SingI (ZipWith3Sym1 d2 :: TyFun [a] ([b] ~> ([c] ~> [d1])) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ZipWith3Sym1 d2) #
(SApplicative m, SingI d) => SingI (ZipWithM_Sym1 d :: TyFun [a] ([b] ~> m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (ZipWithM_Sym1 d) #
(SApplicative m, SingI d) => SingI (ZipWithMSym1 d :: TyFun [a] ([b] ~> m [c]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (ZipWithMSym1 d) #
(SApplicative m, SingI d) => SingI (MapAndUnzipMSym1 d :: TyFun [a] (m ([b], [c])) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (MapAndUnzipMSym1 d) #
(SingI d1, SingI d2) => SingI (ZipWithSym2 d1 d2 :: TyFun [b] [c] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ZipWithSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (ListzipWithSym2 d1 d2 :: TyFun [b] [c] -> Type)
Instance details Defined in Data.List.Singletons.Internal.Disambiguation Methods sing :: Sing (ListzipWithSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Zip3Sym2 d1 d2 :: TyFun [c] [(a, b, c)] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (Zip3Sym2 d1 d2) #
(SingI d1, SingI d2) => SingI (MapAccumLSym2 d1 d2 :: TyFun [x] (acc, [y]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (MapAccumLSym2 d1 d2) #
(SingI d1, SingI d2) => SingI (MapAccumRSym2 d1 d2 :: TyFun [x] (acc, [y]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (MapAccumRSym2 d1 d2) #
SingI (Tuple5Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (a, b, c, d, e))))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing Tuple5Sym0 #
(STraversable t, SingI d) => SingI (MapAccumLSym1 d :: TyFun a (t b ~> (a, t c)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumLSym1 d) #
(STraversable t, SingI d) => SingI (MapAccumRSym1 d :: TyFun a (t b ~> (a, t c)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumRSym1 d) #
(SingI d1, SingI d2) => SingI (d1 .@#@$$$ d2 :: TyFun a c -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (d1 .@#@$$$ d2) #
(SingI d1, SingI d2) => SingI (FlipSym2 d1 d2 :: TyFun a c -> Type)
Instance details Defined in GHC.Base.Singletons Methods sing :: Sing (FlipSym2 d1 d2) #
SingI d1 => SingI (Tuple4Sym1 d1 :: TyFun b (c ~> (d2 ~> (a, b, c, d2))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple4Sym1 d1) #
(SFoldable t, SMonad m, SingI d) => SingI (FoldM_Sym1 d :: TyFun b (t a ~> m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (FoldM_Sym1 d) #
(SFoldable t, SMonad m, SingI d) => SingI (FoldMSym1 d :: TyFun b (t a ~> m b) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (FoldMSym1 d) #
(SFoldable t, SMonad m, SingI d) => SingI (FoldlMSym1 d :: TyFun b (t a ~> m b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlMSym1 d) #
(SFoldable t, SMonad m, SingI d) => SingI (FoldrMSym1 d :: TyFun b (t a ~> m b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrMSym1 d) #
(SingI d1, SingI d2) => SingI (CurrySym2 d1 d2 :: TyFun b c -> Type)
Instance details Defined in Data.Tuple.Singletons Methods sing :: Sing (CurrySym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Tuple3Sym2 d1 d2 :: TyFun c (a, b, c) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple3Sym2 d1 d2) #
(SApplicative f, SingI d) => SingI (LiftA2Sym1 d :: TyFun (f a) (f b ~> f c) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftA2Sym1 d) #
(SApplicative f, SingI d) => SingI ((<*@#@$$) d :: TyFun (f b) (f a) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((<*@#@$$) d) #
(SApplicative f, SingI d) => SingI ((*>@#@$$) d :: TyFun (f b) (f b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((*>@#@$$) d) #
(SMonad m, SingI d) => SingI (LiftM2Sym1 d :: TyFun (m a1) (m a2 ~> m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM2Sym1 d) #
(SMonad m, SingI d) => SingI ((>>@#@$$) d :: TyFun (m b) (m b) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing ((>>@#@$$) d) #
(SFoldable t, SingI d1, SingI d2) => SingI (Foldl'Sym2 d1 d2 :: TyFun (t a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl'Sym2 d1 d2) #
(SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlSym2 d1 d2) #
(SFoldable t, SingI d1, SingI d2) => SingI (Foldr'Sym2 d1 d2 :: TyFun (t a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr'Sym2 d1 d2) #
(SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrSym2 d1 d2) #
(SFoldable t, SApplicative f, SingI d) => SingI (Traverse_Sym1 d :: TyFun (t a) (f ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Traverse_Sym1 d) #
(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d :: TyFun (t a) (f (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (TraverseSym1 d) #
(SFoldable t, SMonad m, SingI d) => SingI (MapM_Sym1 d :: TyFun (t a) (m ()) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MapM_Sym1 d) #
(STraversable t, SMonad m, SingI d) => SingI (MapMSym1 d :: TyFun (t a) (m (t b)) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapMSym1 d) #
(forall (a :: k1) (b :: k2) (c :: k3). (SingI a, SingI b, SingI c) => SingI (f a b c), (ApplyTyCon :: (k3 -> kr) -> TyFun k3 kr -> Type) ~ (ApplyTyConAux1 :: (k3 -> kr) -> TyFun k3 kr -> Type)) => SingI (TyCon3 f :: TyFun k1 (k2 ~> (k3 ~> kr)) -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon3 f) #
SMonad m => SingI (LiftM4Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> (a4 ~> r)))) (m a1 ~> (m a2 ~> (m a3 ~> (m a4 ~> m r)))) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftM4Sym0 #
SingI (Unzip6Sym0 :: TyFun [(a, b, c, d, e, f)] ([a], [b], [c], [d], [e], [f]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Unzip6Sym0 #
(SingI d2, SingI d3) => SingI (ZipWith3Sym2 d2 d3 :: TyFun [b] ([c] ~> [d1]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ZipWith3Sym2 d2 d3) #
(SApplicative m, SingI d1, SingI d2) => SingI (ZipWithM_Sym2 d1 d2 :: TyFun [b] (m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (ZipWithM_Sym2 d1 d2) #
(SApplicative m, SingI d1, SingI d2) => SingI (ZipWithMSym2 d1 d2 :: TyFun [b] (m [c]) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (ZipWithMSym2 d1 d2) #
SingI (Tuple6Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (a, b, c, d, e, f)))))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing Tuple6Sym0 #
(SMonad m, SingI d1, SingI d2) => SingI (d1 <=<@#@$$$ d2 :: TyFun a (m c) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (d1 <=<@#@$$$ d2) #
(SMonad m, SingI d1, SingI d2) => SingI (d1 >=>@#@$$$ d2 :: TyFun a (m c) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (d1 >=>@#@$$$ d2) #
SingI d1 => SingI (Tuple5Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (a, b, c, d2, e)))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple5Sym1 d1) #
(SingI d1, SingI d2) => SingI (Tuple4Sym2 d1 d2 :: TyFun c (d3 ~> (a, b, c, d3)) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple4Sym2 d1 d2) #
(SApplicative f, SingI d2) => SingI (LiftA3Sym1 d2 :: TyFun (f a) (f b ~> (f c ~> f d1)) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftA3Sym1 d2) #
(SApplicative f, SingI d1, SingI d2) => SingI (LiftA2Sym2 d1 d2 :: TyFun (f b) (f c) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftA2Sym2 d1 d2) #
(SMonad m, SingI d) => SingI (LiftM3Sym1 d :: TyFun (m a1) (m a2 ~> (m a3 ~> m r)) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM3Sym1 d) #
(SMonad m, SingI d1, SingI d2) => SingI (LiftM2Sym2 d1 d2 :: TyFun (m a2) (m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM2Sym2 d1 d2) #
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldM_Sym2 d1 d2 :: TyFun (t a) (m ()) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (FoldM_Sym2 d1 d2) #
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldMSym2 d1 d2 :: TyFun (t a) (m b) -> Type)
Instance details Defined in Control.Monad.Singletons Methods sing :: Sing (FoldMSym2 d1 d2) #
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldlMSym2 d1 d2 :: TyFun (t a) (m b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlMSym2 d1 d2) #
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldrMSym2 d1 d2 :: TyFun (t a) (m b) -> Type)
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrMSym2 d1 d2) #
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumLSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumLSym2 d1 d2) #
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumRSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type)
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumRSym2 d1 d2) #
(forall (a :: k1) (b :: k2) (c :: k3) (d :: k4). (SingI a, SingI b, SingI c, SingI d) => SingI (f a b c d), (ApplyTyCon :: (k4 -> kr) -> TyFun k4 kr -> Type) ~ (ApplyTyConAux1 :: (k4 -> kr) -> TyFun k4 kr -> Type)) => SingI (TyCon4 f :: TyFun k1 (k2 ~> (k3 ~> (k4 ~> kr))) -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon4 f) #
SMonad m => SingI (LiftM5Sym0 :: TyFun (a1 ~> (a2 ~> (a3 ~> (a4 ~> (a5 ~> r))))) (m a1 ~> (m a2 ~> (m a3 ~> (m a4 ~> (m a5 ~> m r))))) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing LiftM5Sym0 #
SingI (Unzip7Sym0 :: TyFun [(a, b, c, d, e, f, g)] ([a], [b], [c], [d], [e], [f], [g]) -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing Unzip7Sym0 #
(SingI d2, SingI d3, SingI d4) => SingI (ZipWith3Sym3 d2 d3 d4 :: TyFun [c] [d1] -> Type)
Instance details Defined in Data.List.Singletons.Internal Methods sing :: Sing (ZipWith3Sym3 d2 d3 d4) #
SingI (Tuple7Sym0 :: TyFun a (b ~> (c ~> (d ~> (e ~> (f ~> (g ~> (a, b, c, d, e, f, g))))))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing Tuple7Sym0 #
SingI d1 => SingI (Tuple6Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (f ~> (a, b, c, d2, e, f))))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple6Sym1 d1) #
(SingI d1, SingI d2) => SingI (Tuple5Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (a, b, c, d3, e))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple5Sym2 d1 d2) #
(SingI d1, SingI d2, SingI d3) => SingI (Tuple4Sym3 d1 d2 d3 :: TyFun d4 (a, b, c, d4) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple4Sym3 d1 d2 d3) #
(SApplicative f, SingI d2, SingI d3) => SingI (LiftA3Sym2 d2 d3 :: TyFun (f b) (f c ~> f d1) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftA3Sym2 d2 d3) #
(SMonad m, SingI d) => SingI (LiftM4Sym1 d :: TyFun (m a1) (m a2 ~> (m a3 ~> (m a4 ~> m r))) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM4Sym1 d) #
(SMonad m, SingI d1, SingI d2) => SingI (LiftM3Sym2 d1 d2 :: TyFun (m a2) (m a3 ~> m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM3Sym2 d1 d2) #
(forall (a :: k1) (b :: k2) (c :: k3) (d :: k4) (e :: k5). (SingI a, SingI b, SingI c, SingI d, SingI e) => SingI (f a b c d e), (ApplyTyCon :: (k5 -> kr) -> TyFun k5 kr -> Type) ~ (ApplyTyConAux1 :: (k5 -> kr) -> TyFun k5 kr -> Type)) => SingI (TyCon5 f :: TyFun k1 (k2 ~> (k3 ~> (k4 ~> (k5 ~> kr)))) -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon5 f) #
SingI d1 => SingI (Tuple7Sym1 d1 :: TyFun b (c ~> (d2 ~> (e ~> (f ~> (g ~> (a, b, c, d2, e, f, g)))))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple7Sym1 d1) #
(SingI d1, SingI d2) => SingI (Tuple6Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (f ~> (a, b, c, d3, e, f)))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple6Sym2 d1 d2) #
(SingI d1, SingI d2, SingI d3) => SingI (Tuple5Sym3 d1 d2 d3 :: TyFun d4 (e ~> (a, b, c, d4, e)) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple5Sym3 d1 d2 d3) #
(SApplicative f, SingI d2, SingI d3, SingI d4) => SingI (LiftA3Sym3 d2 d3 d4 :: TyFun (f c) (f d1) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftA3Sym3 d2 d3 d4) #
(SMonad m, SingI d) => SingI (LiftM5Sym1 d :: TyFun (m a1) (m a2 ~> (m a3 ~> (m a4 ~> (m a5 ~> m r)))) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM5Sym1 d) #
(SMonad m, SingI d1, SingI d2) => SingI (LiftM4Sym2 d1 d2 :: TyFun (m a2) (m a3 ~> (m a4 ~> m r)) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM4Sym2 d1 d2) #
(SMonad m, SingI d1, SingI d2, SingI d3) => SingI (LiftM3Sym3 d1 d2 d3 :: TyFun (m a3) (m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM3Sym3 d1 d2 d3) #
(forall (a :: k1) (b :: k2) (c :: k3) (d :: k4) (e :: k5) (f' :: k6). (SingI a, SingI b, SingI c, SingI d, SingI e, SingI f') => SingI (f a b c d e f'), (ApplyTyCon :: (k6 -> kr) -> TyFun k6 kr -> Type) ~ (ApplyTyConAux1 :: (k6 -> kr) -> TyFun k6 kr -> Type)) => SingI (TyCon6 f :: TyFun k1 (k2 ~> (k3 ~> (k4 ~> (k5 ~> (k6 ~> kr))))) -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon6 f) #
(SingI d1, SingI d2) => SingI (Tuple7Sym2 d1 d2 :: TyFun c (d3 ~> (e ~> (f ~> (g ~> (a, b, c, d3, e, f, g))))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple7Sym2 d1 d2) #
(SingI d1, SingI d2, SingI d3) => SingI (Tuple6Sym3 d1 d2 d3 :: TyFun d4 (e ~> (f ~> (a, b, c, d4, e, f))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple6Sym3 d1 d2 d3) #
(SingI d1, SingI d2, SingI d3, SingI d5) => SingI (Tuple5Sym4 d1 d2 d3 d5 :: TyFun e (a, b, c, d4, e) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple5Sym4 d1 d2 d3 d5) #
(SMonad m, SingI d1, SingI d2) => SingI (LiftM5Sym2 d1 d2 :: TyFun (m a2) (m a3 ~> (m a4 ~> (m a5 ~> m r))) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM5Sym2 d1 d2) #
(SMonad m, SingI d1, SingI d2, SingI d3) => SingI (LiftM4Sym3 d1 d2 d3 :: TyFun (m a3) (m a4 ~> m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM4Sym3 d1 d2 d3) #
(forall (a :: k1) (b :: k2) (c :: k3) (d :: k4) (e :: k5) (f' :: k6) (g :: k7). (SingI a, SingI b, SingI c, SingI d, SingI e, SingI f', SingI g) => SingI (f a b c d e f' g), (ApplyTyCon :: (k7 -> kr) -> TyFun k7 kr -> Type) ~ (ApplyTyConAux1 :: (k7 -> kr) -> TyFun k7 kr -> Type)) => SingI (TyCon7 f :: TyFun k1 (k2 ~> (k3 ~> (k4 ~> (k5 ~> (k6 ~> (k7 ~> kr)))))) -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon7 f) #
(SingI d1, SingI d2, SingI d3) => SingI (Tuple7Sym3 d1 d2 d3 :: TyFun d4 (e ~> (f ~> (g ~> (a, b, c, d4, e, f, g)))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple7Sym3 d1 d2 d3) #
(SingI d1, SingI d2, SingI d3, SingI d5) => SingI (Tuple6Sym4 d1 d2 d3 d5 :: TyFun e (f ~> (a, b, c, d4, e, f)) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple6Sym4 d1 d2 d3 d5) #
(SMonad m, SingI d1, SingI d2, SingI d3) => SingI (LiftM5Sym3 d1 d2 d3 :: TyFun (m a3) (m a4 ~> (m a5 ~> m r)) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM5Sym3 d1 d2 d3) #
(SMonad m, SingI d1, SingI d2, SingI d3, SingI d4) => SingI (LiftM4Sym4 d1 d2 d3 d4 :: TyFun (m a4) (m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM4Sym4 d1 d2 d3 d4) #
(forall (a :: k1) (b :: k2) (c :: k3) (d :: k4) (e :: k5) (f' :: k6) (g :: k7) (h :: k8). (SingI a, SingI b, SingI c, SingI d, SingI e, SingI f', SingI g, SingI h) => SingI (f a b c d e f' g h), (ApplyTyCon :: (k8 -> kr) -> TyFun k8 kr -> Type) ~ (ApplyTyConAux1 :: (k8 -> kr) -> TyFun k8 kr -> Type)) => SingI (TyCon8 f :: TyFun k1 (k2 ~> (k3 ~> (k4 ~> (k5 ~> (k6 ~> (k7 ~> (k8 ~> kr))))))) -> Type)
Instance details Defined in Data.Singletons Methods sing :: Sing (TyCon8 f) #
(SingI d1, SingI d2, SingI d3, SingI d5) => SingI (Tuple7Sym4 d1 d2 d3 d5 :: TyFun e (f ~> (g ~> (a, b, c, d4, e, f, g))) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple7Sym4 d1 d2 d3 d5) #
(SingI d1, SingI d2, SingI d3, SingI d5, SingI d6) => SingI (Tuple6Sym5 d1 d2 d3 d5 d6 :: TyFun f (a, b, c, d4, e, f) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple6Sym5 d1 d2 d3 d5 d6) #
(SMonad m, SingI d1, SingI d2, SingI d3, SingI d4) => SingI (LiftM5Sym4 d1 d2 d3 d4 :: TyFun (m a4) (m a5 ~> m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM5Sym4 d1 d2 d3 d4) #
(SingI d1, SingI d2, SingI d3, SingI d5, SingI d6) => SingI (Tuple7Sym5 d1 d2 d3 d5 d6 :: TyFun f (g ~> (a, b, c, d4, e, f, g)) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple7Sym5 d1 d2 d3 d5 d6) #
(SMonad m, SingI d1, SingI d2, SingI d3, SingI d4, SingI d5) => SingI (LiftM5Sym5 d1 d2 d3 d4 d5 :: TyFun (m a5) (m r) -> Type)
Instance details Defined in Control.Monad.Singletons.Internal Methods sing :: Sing (LiftM5Sym5 d1 d2 d3 d4 d5) #
(SingI d1, SingI d2, SingI d3, SingI d5, SingI d6, SingI d7) => SingI (Tuple7Sym6 d1 d2 d3 d5 d6 d7 :: TyFun g (a, b, c, d4, e, f, g) -> Type)
Instance details Defined in Data.Singletons.Base.Instances Methods sing :: Sing (Tuple7Sym6 d1 d2 d3 d5 d6 d7) #

newtype a :- b infixr 9 #

This is the type of entailment.

a :- b is read as a "entails" b.

With this we can actually build a category for Constraint resolution.

e.g.

Because Eq a is a superclass of Ord a, we can show that Ord a entails Eq a.

Because instance Ord a => Ord [a] exists, we can show that Ord a entails Ord [a] as well.

This relationship is captured in the :- entailment type here.

Since p :- p and entailment composes, :- forms the arrows of a Category of constraints. However, Category only became sufficiently general to support this instance in GHC 7.8, so prior to 7.8 this instance is unavailable.

But due to the coherence of instance resolution in Haskell, this Category has some very interesting properties. Notably, in the absence of IncoherentInstances, this category is "thin", which is to say that between any two objects (constraints) there is at most one distinguishable arrow.

This means that for instance, even though there are two ways to derive Ord a :- Eq [a], the answers from these two paths _must_ by construction be equal. This is a property that Haskell offers that is pretty much unique in the space of languages with things they call "type classes".

What are the two ways?

Well, we can go from Ord a :- Eq a via the superclass relationship, and then from Eq a :- Eq [a] via the instance, or we can go from Ord a :- Ord [a] via the instance then from Ord [a] :- Eq [a] through the superclass relationship and this diagram by definition must "commute".

Diagrammatically,

                   Ord a
               ins /     \ cls
                  v       v
            Ord [a]     Eq a
               cls \     / ins
                    v   v
                   Eq [a]

This safety net ensures that pretty much anything you can write with this library is sensible and can't break any assumptions on the behalf of library authors.

Constructors

Sub (a => Dict b)

Instances

Instances details

Category (:-)	Possible since GHC 7.8, when `Category` was made polykinded.
Instance details Defined in Data.Constraint Methods id :: forall (a :: k). a :- a # (.) :: forall (b :: k) (c :: k) (a :: k). (b :- c) -> (a :- b) -> a :- c #
() :=> (Show (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Show (a :- b) #
() :=> (Eq (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Eq (a :- b) #
() :=> (Ord (a :- b))
Instance details Defined in Data.Constraint Methods ins :: () :- Ord (a :- b) #
a => HasDict b (a :- b)
Instance details Defined in Data.Constraint Methods evidence :: (a :- b) -> Dict b #
(Typeable p, Typeable q, p, q) => Data (p :- q)
Instance details Defined in Data.Constraint Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> (p :- q) -> c (p :- q) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (p :- q) # toConstr :: (p :- q) -> Constr # dataTypeOf :: (p :- q) -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (p :- q)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (p :- q)) # gmapT :: (forall b. Data b => b -> b) -> (p :- q) -> p :- q # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> (p :- q) -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> (p :- q) -> r # gmapQ :: (forall d. Data d => d -> u) -> (p :- q) -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> (p :- q) -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> (p :- q) -> m (p :- q) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> (p :- q) -> m (p :- q) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> (p :- q) -> m (p :- q) #
Show (a :- b)
Instance details Defined in Data.Constraint Methods showsPrec :: Int -> (a :- b) -> ShowS # show :: (a :- b) -> String # showList :: [a :- b] -> ShowS #
a => NFData (a :- b)
Instance details Defined in Data.Constraint Methods rnf :: (a :- b) -> () #
Eq (a :- b)	Assumes `IncoherentInstances` doesn't exist.
Instance details Defined in Data.Constraint Methods (==) :: (a :- b) -> (a :- b) -> Bool # (/=) :: (a :- b) -> (a :- b) -> Bool #
Ord (a :- b)	Assumes `IncoherentInstances` doesn't exist.
Instance details Defined in Data.Constraint Methods compare :: (a :- b) -> (a :- b) -> Ordering # (<) :: (a :- b) -> (a :- b) -> Bool # (<=) :: (a :- b) -> (a :- b) -> Bool # (>) :: (a :- b) -> (a :- b) -> Bool # (>=) :: (a :- b) -> (a :- b) -> Bool # max :: (a :- b) -> (a :- b) -> a :- b # min :: (a :- b) -> (a :- b) -> a :- b #

data Sub Source #

Instances

Instances details

ArithOp Sub 'TInt 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Sub 'TInt 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Sub -> Value' instr 'TInt -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TInt)) (Value' instr (ArithRes Sub 'TInt 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Sub 'TInt 'TInt ~ ArithRes Sub 'TInt 'TInt, ArithOp Sub 'TInt 'TInt) Source #
ArithOp Sub 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Sub 'TInt 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Sub -> Value' instr 'TInt -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TNat)) (Value' instr (ArithRes Sub 'TInt 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Sub 'TInt 'TNat ~ ArithRes Sub 'TNat 'TInt, ArithOp Sub 'TNat 'TInt) Source #
ArithOp Sub 'TNat 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Sub 'TNat 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Sub -> Value' instr 'TNat -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TInt)) (Value' instr (ArithRes Sub 'TNat 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Sub 'TNat 'TInt ~ ArithRes Sub 'TInt 'TNat, ArithOp Sub 'TInt 'TNat) Source #
ArithOp Sub 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Sub 'TNat 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Sub -> Value' instr 'TNat -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TNat)) (Value' instr (ArithRes Sub 'TNat 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Sub 'TNat 'TNat ~ ArithRes Sub 'TNat 'TNat, ArithOp Sub 'TNat 'TNat) Source #
ArithOp Sub 'TTimestamp 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Sub 'TTimestamp 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Sub -> Value' instr 'TTimestamp -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TTimestamp) (Value' instr 'TInt)) (Value' instr (ArithRes Sub 'TTimestamp 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Sub 'TTimestamp 'TInt ~ ArithRes Sub 'TInt 'TTimestamp, ArithOp Sub 'TInt 'TTimestamp) Source #
ArithOp Sub 'TTimestamp 'TTimestamp Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Sub 'TTimestamp 'TTimestamp :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Sub -> Value' instr 'TTimestamp -> Value' instr 'TTimestamp -> Either (ArithError (Value' instr 'TTimestamp) (Value' instr 'TTimestamp)) (Value' instr (ArithRes Sub 'TTimestamp 'TTimestamp)) Source # commutativityProof :: Maybe $ Dict (ArithRes Sub 'TTimestamp 'TTimestamp ~ ArithRes Sub 'TTimestamp 'TTimestamp, ArithOp Sub 'TTimestamp 'TTimestamp) Source #
type ArithRes Sub 'TInt 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Sub 'TInt 'TInt = 'TInt
type ArithRes Sub 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Sub 'TInt 'TNat = 'TInt
type ArithRes Sub 'TNat 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Sub 'TNat 'TInt = 'TInt
type ArithRes Sub 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Sub 'TNat 'TNat = 'TInt
type ArithRes Sub 'TTimestamp 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Sub 'TTimestamp 'TInt = 'TTimestamp
type ArithRes Sub 'TTimestamp 'TTimestamp Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Sub 'TTimestamp 'TTimestamp = 'TInt

data Dict a where #

Values of type Dict p capture a dictionary for a constraint of type p.

e.g.

Dict :: Dict (Eq Int)

captures a dictionary that proves we have an:

instance Eq Int

Pattern matching on the Dict constructor will bring this instance into scope.

Constructors

Dict :: forall a. a => Dict a

Instances

Instances details

() :=> (Semigroup (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Semigroup (Dict a) #
() :=> (Show (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Show (Dict a) #
() :=> (Eq (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Eq (Dict a) #
() :=> (Ord (Dict a))
Instance details Defined in Data.Constraint Methods ins :: () :- Ord (Dict a) #
a :=> (Monoid (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Monoid (Dict a) #
a :=> (Bounded (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Bounded (Dict a) #
a :=> (Enum (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Enum (Dict a) #
a :=> (Read (Dict a))
Instance details Defined in Data.Constraint Methods ins :: a :- Read (Dict a) #
HasDict a (Dict a)
Instance details Defined in Data.Constraint Methods evidence :: Dict a -> Dict a #
(Typeable p, p) => Data (Dict p)
Instance details Defined in Data.Constraint Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Dict p -> c (Dict p) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Dict p) # toConstr :: Dict p -> Constr # dataTypeOf :: Dict p -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Dict p)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Dict p)) # gmapT :: (forall b. Data b => b -> b) -> Dict p -> Dict p # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Dict p -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Dict p -> r # gmapQ :: (forall d. Data d => d -> u) -> Dict p -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Dict p -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Dict p -> m (Dict p) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Dict p -> m (Dict p) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Dict p -> m (Dict p) #
a => Monoid (Dict a)
Instance details Defined in Data.Constraint Methods mempty :: Dict a # mappend :: Dict a -> Dict a -> Dict a # mconcat :: [Dict a] -> Dict a #
Semigroup (Dict a)
Instance details Defined in Data.Constraint Methods (<>) :: Dict a -> Dict a -> Dict a # sconcat :: NonEmpty (Dict a) -> Dict a # stimes :: Integral b => b -> Dict a -> Dict a #
a => Bounded (Dict a)
Instance details Defined in Data.Constraint Methods minBound :: Dict a # maxBound :: Dict a #
a => Enum (Dict a)
Instance details Defined in Data.Constraint Methods succ :: Dict a -> Dict a # pred :: Dict a -> Dict a # toEnum :: Int -> Dict a # fromEnum :: Dict a -> Int # enumFrom :: Dict a -> [Dict a] # enumFromThen :: Dict a -> Dict a -> [Dict a] # enumFromTo :: Dict a -> Dict a -> [Dict a] # enumFromThenTo :: Dict a -> Dict a -> Dict a -> [Dict a] #
a => Read (Dict a)
Instance details Defined in Data.Constraint Methods readsPrec :: Int -> ReadS (Dict a) # readList :: ReadS [Dict a] # readPrec :: ReadPrec (Dict a) # readListPrec :: ReadPrec [Dict a] #
Show (Dict a)
Instance details Defined in Data.Constraint Methods showsPrec :: Int -> Dict a -> ShowS # show :: Dict a -> String # showList :: [Dict a] -> ShowS #
NFData (Dict c)
Instance details Defined in Data.Constraint Methods rnf :: Dict c -> () #
Eq (Dict a)
Instance details Defined in Data.Constraint Methods (==) :: Dict a -> Dict a -> Bool # (/=) :: Dict a -> Dict a -> Bool #
Ord (Dict a)
Instance details Defined in Data.Constraint Methods compare :: Dict a -> Dict a -> Ordering # (<) :: Dict a -> Dict a -> Bool # (<=) :: Dict a -> Dict a -> Bool # (>) :: Dict a -> Dict a -> Bool # (>=) :: Dict a -> Dict a -> Bool # max :: Dict a -> Dict a -> Dict a # min :: Dict a -> Dict a -> Dict a #

type View = View' Instr Source #

data Or Source #

Instances

Instances details

ArithOp Or 'TBool 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Or 'TBool 'TBool :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Or -> Value' instr 'TBool -> Value' instr 'TBool -> Either (ArithError (Value' instr 'TBool) (Value' instr 'TBool)) (Value' instr (ArithRes Or 'TBool 'TBool)) Source # commutativityProof :: Maybe $ Dict (ArithRes Or 'TBool 'TBool ~ ArithRes Or 'TBool 'TBool, ArithOp Or 'TBool 'TBool) Source #
ArithOp Or 'TBytes 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Or 'TBytes 'TBytes :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Or -> Value' instr 'TBytes -> Value' instr 'TBytes -> Either (ArithError (Value' instr 'TBytes) (Value' instr 'TBytes)) (Value' instr (ArithRes Or 'TBytes 'TBytes)) Source # commutativityProof :: Maybe $ Dict (ArithRes Or 'TBytes 'TBytes ~ ArithRes Or 'TBytes 'TBytes, ArithOp Or 'TBytes 'TBytes) Source #
ArithOp Or 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Or 'TNat 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Or -> Value' instr 'TNat -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TNat)) (Value' instr (ArithRes Or 'TNat 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Or 'TNat 'TNat ~ ArithRes Or 'TNat 'TNat, ArithOp Or 'TNat 'TNat) Source #
type ArithRes Or 'TBool 'TBool Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Or 'TBool 'TBool = 'TBool
type ArithRes Or 'TBytes 'TBytes Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Or 'TBytes 'TBytes = 'TBytes
type ArithRes Or 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Or 'TNat 'TNat = 'TNat

data Mul Source #

Instances

Instances details

ArithOp Mul 'TBls12381Fr 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TBls12381Fr 'TBls12381Fr :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TBls12381Fr -> Value' instr 'TBls12381Fr -> Either (ArithError (Value' instr 'TBls12381Fr) (Value' instr 'TBls12381Fr)) (Value' instr (ArithRes Mul 'TBls12381Fr 'TBls12381Fr)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TBls12381Fr 'TBls12381Fr ~ ArithRes Mul 'TBls12381Fr 'TBls12381Fr, ArithOp Mul 'TBls12381Fr 'TBls12381Fr) Source #
(Bottom, Bls12381MulBadOrder Bls12381Fr Bls12381G1 :: Constraint) => ArithOp Mul 'TBls12381Fr 'TBls12381G1 Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TBls12381Fr 'TBls12381G1 :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TBls12381Fr -> Value' instr 'TBls12381G1 -> Either (ArithError (Value' instr 'TBls12381Fr) (Value' instr 'TBls12381G1)) (Value' instr (ArithRes Mul 'TBls12381Fr 'TBls12381G1)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TBls12381Fr 'TBls12381G1 ~ ArithRes Mul 'TBls12381G1 'TBls12381Fr, ArithOp Mul 'TBls12381G1 'TBls12381Fr) Source #
(Bottom, Bls12381MulBadOrder Bls12381Fr Bls12381G2 :: Constraint) => ArithOp Mul 'TBls12381Fr 'TBls12381G2 Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TBls12381Fr 'TBls12381G2 :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TBls12381Fr -> Value' instr 'TBls12381G2 -> Either (ArithError (Value' instr 'TBls12381Fr) (Value' instr 'TBls12381G2)) (Value' instr (ArithRes Mul 'TBls12381Fr 'TBls12381G2)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TBls12381Fr 'TBls12381G2 ~ ArithRes Mul 'TBls12381G2 'TBls12381Fr, ArithOp Mul 'TBls12381G2 'TBls12381Fr) Source #
ArithOp Mul 'TBls12381Fr 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TBls12381Fr 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TBls12381Fr -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TBls12381Fr) (Value' instr 'TInt)) (Value' instr (ArithRes Mul 'TBls12381Fr 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TBls12381Fr 'TInt ~ ArithRes Mul 'TInt 'TBls12381Fr, ArithOp Mul 'TInt 'TBls12381Fr) Source #
ArithOp Mul 'TBls12381Fr 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TBls12381Fr 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TBls12381Fr -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TBls12381Fr) (Value' instr 'TNat)) (Value' instr (ArithRes Mul 'TBls12381Fr 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TBls12381Fr 'TNat ~ ArithRes Mul 'TNat 'TBls12381Fr, ArithOp Mul 'TNat 'TBls12381Fr) Source #
ArithOp Mul 'TBls12381G1 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TBls12381G1 'TBls12381Fr :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TBls12381G1 -> Value' instr 'TBls12381Fr -> Either (ArithError (Value' instr 'TBls12381G1) (Value' instr 'TBls12381Fr)) (Value' instr (ArithRes Mul 'TBls12381G1 'TBls12381Fr)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TBls12381G1 'TBls12381Fr ~ ArithRes Mul 'TBls12381Fr 'TBls12381G1, ArithOp Mul 'TBls12381Fr 'TBls12381G1) Source #
ArithOp Mul 'TBls12381G2 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TBls12381G2 'TBls12381Fr :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TBls12381G2 -> Value' instr 'TBls12381Fr -> Either (ArithError (Value' instr 'TBls12381G2) (Value' instr 'TBls12381Fr)) (Value' instr (ArithRes Mul 'TBls12381G2 'TBls12381Fr)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TBls12381G2 'TBls12381Fr ~ ArithRes Mul 'TBls12381Fr 'TBls12381G2, ArithOp Mul 'TBls12381Fr 'TBls12381G2) Source #
ArithOp Mul 'TInt 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TInt 'TBls12381Fr :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TInt -> Value' instr 'TBls12381Fr -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TBls12381Fr)) (Value' instr (ArithRes Mul 'TInt 'TBls12381Fr)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TInt 'TBls12381Fr ~ ArithRes Mul 'TBls12381Fr 'TInt, ArithOp Mul 'TBls12381Fr 'TInt) Source #
ArithOp Mul 'TInt 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TInt 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TInt -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TInt)) (Value' instr (ArithRes Mul 'TInt 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TInt 'TInt ~ ArithRes Mul 'TInt 'TInt, ArithOp Mul 'TInt 'TInt) Source #
ArithOp Mul 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TInt 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TInt -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TNat)) (Value' instr (ArithRes Mul 'TInt 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TInt 'TNat ~ ArithRes Mul 'TNat 'TInt, ArithOp Mul 'TNat 'TInt) Source #
ArithOp Mul 'TMutez 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TMutez 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TMutez -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TMutez) (Value' instr 'TNat)) (Value' instr (ArithRes Mul 'TMutez 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TMutez 'TNat ~ ArithRes Mul 'TNat 'TMutez, ArithOp Mul 'TNat 'TMutez) Source #
ArithOp Mul 'TNat 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TNat 'TBls12381Fr :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TNat -> Value' instr 'TBls12381Fr -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TBls12381Fr)) (Value' instr (ArithRes Mul 'TNat 'TBls12381Fr)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TNat 'TBls12381Fr ~ ArithRes Mul 'TBls12381Fr 'TNat, ArithOp Mul 'TBls12381Fr 'TNat) Source #
ArithOp Mul 'TNat 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TNat 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TNat -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TInt)) (Value' instr (ArithRes Mul 'TNat 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TNat 'TInt ~ ArithRes Mul 'TInt 'TNat, ArithOp Mul 'TInt 'TNat) Source #
ArithOp Mul 'TNat 'TMutez Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TNat 'TMutez :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TNat -> Value' instr 'TMutez -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TMutez)) (Value' instr (ArithRes Mul 'TNat 'TMutez)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TNat 'TMutez ~ ArithRes Mul 'TMutez 'TNat, ArithOp Mul 'TMutez 'TNat) Source #
ArithOp Mul 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Mul 'TNat 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Mul -> Value' instr 'TNat -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TNat)) (Value' instr (ArithRes Mul 'TNat 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Mul 'TNat 'TNat ~ ArithRes Mul 'TNat 'TNat, ArithOp Mul 'TNat 'TNat) Source #
type ArithRes Mul 'TBls12381Fr 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TBls12381Fr 'TBls12381Fr = 'TBls12381Fr
type ArithRes Mul 'TBls12381Fr 'TBls12381G1 Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TBls12381Fr 'TBls12381G1 = 'TBls12381G1
type ArithRes Mul 'TBls12381Fr 'TBls12381G2 Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TBls12381Fr 'TBls12381G2 = 'TBls12381G2
type ArithRes Mul 'TBls12381Fr 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TBls12381Fr 'TInt = 'TBls12381Fr
type ArithRes Mul 'TBls12381Fr 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TBls12381Fr 'TNat = 'TBls12381Fr
type ArithRes Mul 'TBls12381G1 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TBls12381G1 'TBls12381Fr = 'TBls12381G1
type ArithRes Mul 'TBls12381G2 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TBls12381G2 'TBls12381Fr = 'TBls12381G2
type ArithRes Mul 'TInt 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TInt 'TBls12381Fr = 'TBls12381Fr
type ArithRes Mul 'TInt 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TInt 'TInt = 'TInt
type ArithRes Mul 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TInt 'TNat = 'TInt
type ArithRes Mul 'TMutez 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TMutez 'TNat = 'TMutez
type ArithRes Mul 'TNat 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TNat 'TBls12381Fr = 'TBls12381Fr
type ArithRes Mul 'TNat 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TNat 'TInt = 'TInt
type ArithRes Mul 'TNat 'TMutez Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TNat 'TMutez = 'TMutez
type ArithRes Mul 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Mul 'TNat 'TNat = 'TNat

data Add Source #

Instances

Instances details

ArithOp Add 'TBls12381Fr 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TBls12381Fr 'TBls12381Fr :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TBls12381Fr -> Value' instr 'TBls12381Fr -> Either (ArithError (Value' instr 'TBls12381Fr) (Value' instr 'TBls12381Fr)) (Value' instr (ArithRes Add 'TBls12381Fr 'TBls12381Fr)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TBls12381Fr 'TBls12381Fr ~ ArithRes Add 'TBls12381Fr 'TBls12381Fr, ArithOp Add 'TBls12381Fr 'TBls12381Fr) Source #
ArithOp Add 'TBls12381G1 'TBls12381G1 Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TBls12381G1 'TBls12381G1 :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TBls12381G1 -> Value' instr 'TBls12381G1 -> Either (ArithError (Value' instr 'TBls12381G1) (Value' instr 'TBls12381G1)) (Value' instr (ArithRes Add 'TBls12381G1 'TBls12381G1)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TBls12381G1 'TBls12381G1 ~ ArithRes Add 'TBls12381G1 'TBls12381G1, ArithOp Add 'TBls12381G1 'TBls12381G1) Source #
ArithOp Add 'TBls12381G2 'TBls12381G2 Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TBls12381G2 'TBls12381G2 :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TBls12381G2 -> Value' instr 'TBls12381G2 -> Either (ArithError (Value' instr 'TBls12381G2) (Value' instr 'TBls12381G2)) (Value' instr (ArithRes Add 'TBls12381G2 'TBls12381G2)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TBls12381G2 'TBls12381G2 ~ ArithRes Add 'TBls12381G2 'TBls12381G2, ArithOp Add 'TBls12381G2 'TBls12381G2) Source #
ArithOp Add 'TInt 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TInt 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TInt -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TInt)) (Value' instr (ArithRes Add 'TInt 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TInt 'TInt ~ ArithRes Add 'TInt 'TInt, ArithOp Add 'TInt 'TInt) Source #
ArithOp Add 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TInt 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TInt -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TNat)) (Value' instr (ArithRes Add 'TInt 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TInt 'TNat ~ ArithRes Add 'TNat 'TInt, ArithOp Add 'TNat 'TInt) Source #
ArithOp Add 'TInt 'TTimestamp Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TInt 'TTimestamp :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TInt -> Value' instr 'TTimestamp -> Either (ArithError (Value' instr 'TInt) (Value' instr 'TTimestamp)) (Value' instr (ArithRes Add 'TInt 'TTimestamp)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TInt 'TTimestamp ~ ArithRes Add 'TTimestamp 'TInt, ArithOp Add 'TTimestamp 'TInt) Source #
ArithOp Add 'TMutez 'TMutez Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TMutez 'TMutez :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TMutez -> Value' instr 'TMutez -> Either (ArithError (Value' instr 'TMutez) (Value' instr 'TMutez)) (Value' instr (ArithRes Add 'TMutez 'TMutez)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TMutez 'TMutez ~ ArithRes Add 'TMutez 'TMutez, ArithOp Add 'TMutez 'TMutez) Source #
ArithOp Add 'TNat 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TNat 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TNat -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TInt)) (Value' instr (ArithRes Add 'TNat 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TNat 'TInt ~ ArithRes Add 'TInt 'TNat, ArithOp Add 'TInt 'TNat) Source #
ArithOp Add 'TNat 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TNat 'TNat :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TNat -> Value' instr 'TNat -> Either (ArithError (Value' instr 'TNat) (Value' instr 'TNat)) (Value' instr (ArithRes Add 'TNat 'TNat)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TNat 'TNat ~ ArithRes Add 'TNat 'TNat, ArithOp Add 'TNat 'TNat) Source #
ArithOp Add 'TTimestamp 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith Associated Types type ArithRes Add 'TTimestamp 'TInt :: T Source # Methods evalOp :: forall proxy (instr :: [T] -> [T] -> Type). proxy Add -> Value' instr 'TTimestamp -> Value' instr 'TInt -> Either (ArithError (Value' instr 'TTimestamp) (Value' instr 'TInt)) (Value' instr (ArithRes Add 'TTimestamp 'TInt)) Source # commutativityProof :: Maybe $ Dict (ArithRes Add 'TTimestamp 'TInt ~ ArithRes Add 'TInt 'TTimestamp, ArithOp Add 'TInt 'TTimestamp) Source #
type ArithRes Add 'TBls12381Fr 'TBls12381Fr Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Add 'TBls12381Fr 'TBls12381Fr = 'TBls12381Fr
type ArithRes Add 'TBls12381G1 'TBls12381G1 Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Add 'TBls12381G1 'TBls12381G1 = 'TBls12381G1
type ArithRes Add 'TBls12381G2 'TBls12381G2 Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Add 'TBls12381G2 'TBls12381G2 = 'TBls12381G2
type ArithRes Add 'TInt 'TInt Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Add 'TInt 'TInt = 'TInt
type ArithRes Add 'TInt 'TNat Source #
Instance details Defined in Morley.Michelson.Typed.Arith type ArithRes Add 'TInt 'TNat = 'TInt
type ArithRes

TKey
TUnit
TSignature
TChainId
TOption T
TList T
TSet T
TOperation
TContract T
TTicket T
TPair T T
TOr T T
TLambda T T
TMap T T
TBigMap T T
TInt
TNat
TString
TBytes
TMutez
TBool
TKeyHash
TBls12381Fr
TBls12381G1
TBls12381G2
TTimestamp
TAddress
TChest
TChestKey
TSaplingState Peano
TSaplingTransaction Peano
TNever