Safe Haskell	None
Language	Haskell2010

Lorentz.Value

Contents

Primitive types
Constructors
Conversions
Misc

Description

Re-exports typed Value, CValue, some core types, some helpers and defines aliases for constructors of typed values.

Synopsis

type Value = Value' Instr
class IsoValue a where
- type ToT a :: T
- toVal :: a -> Value (ToT a)
- fromVal :: Value (ToT a) -> a
class IsoCValue a where
- type ToCT a :: CT
- toCVal :: a -> CValue (ToCT a)
- fromCVal :: CValue (ToCT a) -> a
data CValue (t :: CT) where
- CvInt :: forall (t :: CT). Integer -> CValue CInt
- CvNat :: forall (t :: CT). Natural -> CValue CNat
- CvString :: forall (t :: CT). MText -> CValue CString
- CvBytes :: forall (t :: CT). ByteString -> CValue CBytes
- CvMutez :: forall (t :: CT). Mutez -> CValue CMutez
- CvBool :: forall (t :: CT). Bool -> CValue CBool
- CvKeyHash :: forall (t :: CT). KeyHash -> CValue CKeyHash
- CvTimestamp :: forall (t :: CT). Timestamp -> CValue CTimestamp
- CvAddress :: forall (t :: CT). EpAddress -> CValue CAddress
data Integer
data Natural
data MText
data Bool
- = False
- | True
data ByteString
data Address
data EpAddress = EpAddress {
- eaAddress :: Address
- eaEntryPoint :: EpName
}
data Mutez
data Timestamp
data ChainId
data KeyHash
data PublicKey
data Signature
data Set a
data Map k a
newtype BigMap k v = BigMap {
- unBigMap :: Map k v
}
type Operation = Operation' Instr
data Maybe a
- = Nothing
- | Just a
type List = []
data ContractRef arg = ContractRef {
- crAddress :: Address
- crEntryPoint :: SomeEntryPointCall arg
}
newtype TAddress p = TAddress {
- unTAddress :: Address
}
newtype FutureContract arg = FutureContract {
- unFutureContract :: ContractRef arg
}
data EpName
pattern DefEpName :: EpName
type EntryPointCall param arg = EntryPointCallT (ToT param) (ToT arg)
type SomeEntryPointCall arg = SomeEntryPointCallT (ToT arg)
toMutez :: Word32 -> Mutez
mt :: QuasiQuoter
timestampFromSeconds :: Integer -> Timestamp
timestampFromUTCTime :: UTCTime -> Timestamp
timestampQuote :: QuasiQuoter
coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b
callingTAddress :: forall cp mname. NiceParameterFull cp => TAddress cp -> EntryPointRef mname -> ContractRef (GetEntryPointArgCustom cp mname)
callingDefTAddress :: forall cp. NiceParameterFull cp => TAddress cp -> ContractRef (GetDefaultEntryPointArg cp)
class ToAddress a where
- toAddress :: a -> Address
class ToTAddress (cp :: Type) (a :: Type) where
- toTAddress :: a -> TAddress cp
class ToContractRef (cp :: Type) (contract :: Type) where
- toContractRef :: HasCallStack => contract -> ContractRef cp
class FromContractRef (cp :: Type) (contract :: Type) where
- fromContractRef :: ContractRef cp -> contract
convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2
class Default a where
- def :: a
data Label (a :: Symbol) = Label

Documentation

type Value = Value' Instr #

class IsoValue a where #

Isomorphism between Michelson values and plain Haskell types.

Default implementation of this typeclass converts ADTs to Michelson "pair"s and "or"s.

Minimal complete definition

Nothing

Associated Types

type ToT a :: T #

Type function that converts a regular Haskell type into a T type.

Methods

toVal :: a -> Value (ToT a) #

Converts a Haskell structure into Value representation.

fromVal :: Value (ToT a) -> a #

Converts a Value into Haskell type.

Instances

IsoValue Bool
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Bool :: T # Methods toVal :: Bool -> Value (ToT Bool) # fromVal :: Value (ToT Bool) -> Bool #
IsoValue Integer
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Integer :: T # Methods toVal :: Integer -> Value (ToT Integer) # fromVal :: Value (ToT Integer) -> Integer #
IsoValue Natural
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Natural :: T # Methods toVal :: Natural -> Value (ToT Natural) # fromVal :: Value (ToT Natural) -> Natural #
IsoValue ()
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT () :: T # Methods toVal :: () -> Value (ToT ()) # fromVal :: Value (ToT ()) -> () #
IsoValue ByteString
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
(DoNotUseTextError :: Constraint) => IsoValue Text
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Text :: T # Methods toVal :: Text -> Value (ToT Text) # fromVal :: Value (ToT Text) -> Text #
IsoValue MyCompoundType
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyCompoundType :: T # Methods toVal :: MyCompoundType -> Value (ToT MyCompoundType) # fromVal :: Value (ToT MyCompoundType) -> MyCompoundType #
IsoValue Operation
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Operation :: T # Methods toVal :: Operation -> Value (ToT Operation) # fromVal :: Value (ToT Operation) -> Operation #
IsoValue EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
IsoValue Address
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Address :: T # Methods toVal :: Address -> Value (ToT Address) # fromVal :: Value (ToT Address) -> Address #
IsoValue Mutez
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Mutez :: T # Methods toVal :: Mutez -> Value (ToT Mutez) # fromVal :: Value (ToT Mutez) -> Mutez #
IsoValue Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Timestamp :: T # Methods toVal :: Timestamp -> Value (ToT Timestamp) # fromVal :: Value (ToT Timestamp) -> Timestamp #
IsoValue ChainId
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT ChainId :: T # Methods toVal :: ChainId -> Value (ToT ChainId) # fromVal :: Value (ToT ChainId) -> ChainId #
IsoValue PublicKey
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT PublicKey :: T # Methods toVal :: PublicKey -> Value (ToT PublicKey) # fromVal :: Value (ToT PublicKey) -> PublicKey #
IsoValue Signature
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Signature :: T # Methods toVal :: Signature -> Value (ToT Signature) # fromVal :: Value (ToT Signature) -> Signature #
IsoValue KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT KeyHash :: T # Methods toVal :: KeyHash -> Value (ToT KeyHash) # fromVal :: Value (ToT KeyHash) -> KeyHash #
IsoValue MText
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
IsoValue MyType2
Instance details Defined in Michelson.Typed.Haskell.Instr.Product Associated Types type ToT MyType2 :: T # Methods toVal :: MyType2 -> Value (ToT MyType2) # fromVal :: Value (ToT MyType2) -> MyType2 #
IsoValue MyEnum
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyEnum :: T # Methods toVal :: MyEnum -> Value (ToT MyEnum) # fromVal :: Value (ToT MyEnum) -> MyEnum #
IsoValue MyType
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyType :: T # Methods toVal :: MyType -> Value (ToT MyType) # fromVal :: Value (ToT MyType) -> MyType #
IsoValue MyType'
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyType' :: T # Methods toVal :: MyType' -> Value (ToT MyType') # fromVal :: Value (ToT MyType') -> MyType' #
IsoValue MyTypeWithNamedField
Instance details Defined in Michelson.Typed.Haskell.Instr.Sum Associated Types type ToT MyTypeWithNamedField :: T # Methods toVal :: MyTypeWithNamedField -> Value (ToT MyTypeWithNamedField) # fromVal :: Value (ToT MyTypeWithNamedField) -> MyTypeWithNamedField #
IsoValue UnspecifiedError Source #
Instance details Defined in Lorentz.Errors Associated Types type ToT UnspecifiedError :: T # Methods toVal :: UnspecifiedError -> Value (ToT UnspecifiedError) # fromVal :: Value (ToT UnspecifiedError) -> UnspecifiedError #
IsoValue Empty Source #
Instance details Defined in Lorentz.Empty Associated Types type ToT Empty :: T # Methods toVal :: Empty -> Value (ToT Empty) # fromVal :: Value (ToT Empty) -> Empty #
IsoValue a => IsoValue [a]
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT [a] :: T # Methods toVal :: [a] -> Value (ToT [a]) # fromVal :: Value (ToT [a]) -> [a] #
IsoValue a => IsoValue (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Maybe a) :: T # Methods toVal :: Maybe a -> Value (ToT (Maybe a)) # fromVal :: Value (ToT (Maybe a)) -> Maybe a #
IsoValue a => IsoValue (Identity a)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Identity a) :: T # Methods toVal :: Identity a -> Value (ToT (Identity a)) # fromVal :: Value (ToT (Identity a)) -> Identity a #
(Ord c, IsoCValue c) => IsoValue (Set c)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Set c) :: T # Methods toVal :: Set c -> Value (ToT (Set c)) # fromVal :: Value (ToT (Set c)) -> Set c #
IsoValue (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (ContractRef arg) :: T # Methods toVal :: ContractRef arg -> Value (ToT (ContractRef arg)) # fromVal :: Value (ToT (ContractRef arg)) -> ContractRef arg #
IsoValue a => IsoValue (ShouldHaveEntryPoints a) Source #
Instance details Defined in Lorentz.EntryPoints.Helpers Associated Types type ToT (ShouldHaveEntryPoints a) :: T # Methods toVal :: ShouldHaveEntryPoints a -> Value (ToT (ShouldHaveEntryPoints a)) # fromVal :: Value (ToT (ShouldHaveEntryPoints a)) -> ShouldHaveEntryPoints a #
IsoValue (FutureContract arg) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (FutureContract arg) :: T # Methods toVal :: FutureContract arg -> Value (ToT (FutureContract arg)) # fromVal :: Value (ToT (FutureContract arg)) -> FutureContract arg #
IsoValue (UStore a) Source #
Instance details Defined in Lorentz.UStore.Types Associated Types type ToT (UStore a) :: T # Methods toVal :: UStore a -> Value (ToT (UStore a)) # fromVal :: Value (ToT (UStore a)) -> UStore a #
(TypeError (Text "CustomError has no IsoValue instance") :: Constraint) => IsoValue (CustomError tag) Source #	This instance cannot be implemented, use `IsError` instance instead.
Instance details Defined in Lorentz.Errors Associated Types type ToT (CustomError tag) :: T # Methods toVal :: CustomError tag -> Value (ToT (CustomError tag)) # fromVal :: Value (ToT (CustomError tag)) -> CustomError tag #
(CustomErrorNoIsoValue (VoidResult r) :: Constraint) => IsoValue (VoidResult r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (VoidResult r) :: T # Methods toVal :: VoidResult r -> Value (ToT (VoidResult r)) # fromVal :: Value (ToT (VoidResult r)) -> VoidResult r #
IsoValue a => IsoValue (Store a) Source #
Instance details Defined in Lorentz.Store Associated Types type ToT (Store a) :: T # Methods toVal :: Store a -> Value (ToT (Store a)) # fromVal :: Value (ToT (Store a)) -> Store a #
IsoValue (UParam entries) Source #
Instance details Defined in Lorentz.UParam Associated Types type ToT (UParam entries) :: T # Methods toVal :: UParam entries -> Value (ToT (UParam entries)) # fromVal :: Value (ToT (UParam entries)) -> UParam entries #
(IsoValue l, IsoValue r) => IsoValue (Either l r)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Either l r) :: T # Methods toVal :: Either l r -> Value (ToT (Either l r)) # fromVal :: Value (ToT (Either l r)) -> Either l r #
(IsoValue a, IsoValue b) => IsoValue (a, b)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (a, b) :: T # Methods toVal :: (a, b) -> Value (ToT (a, b)) # fromVal :: Value (ToT (a, b)) -> (a, b) #
(Ord k, IsoCValue k, IsoValue v) => IsoValue (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Map k v) :: T # Methods toVal :: Map k v -> Value (ToT (Map k v)) # fromVal :: Value (ToT (Map k v)) -> Map k v #
(Ord k, IsoCValue k, IsoValue v) => IsoValue (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (BigMap k v) :: T # Methods toVal :: BigMap k v -> Value (ToT (BigMap k v)) # fromVal :: Value (ToT (BigMap k v)) -> BigMap k v #
IsoValue cp => IsoValue (ParameterWrapper deriv cp) Source #
Instance details Defined in Lorentz.EntryPoints.Manual Associated Types type ToT (ParameterWrapper deriv cp) :: T # Methods toVal :: ParameterWrapper deriv cp -> Value (ToT (ParameterWrapper deriv cp)) # fromVal :: Value (ToT (ParameterWrapper deriv cp)) -> ParameterWrapper deriv cp #
IsoValue (TAddress p) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (TAddress p) :: T # Methods toVal :: TAddress p -> Value (ToT (TAddress p)) # fromVal :: Value (ToT (TAddress p)) -> TAddress p #
(ZipInstr inp, ZipInstr out) => IsoValue (inp :-> out) Source #
Instance details Defined in Lorentz.Zip Associated Types type ToT (inp :-> out) :: T # Methods toVal :: (inp :-> out) -> Value (ToT (inp :-> out)) # fromVal :: Value (ToT (inp :-> out)) -> inp :-> out #
IsoValue (Extensible x) Source #
Instance details Defined in Lorentz.Extensible Associated Types type ToT (Extensible x) :: T # Methods toVal :: Extensible x -> Value (ToT (Extensible x)) # fromVal :: Value (ToT (Extensible x)) -> Extensible x #
IsoValue (MigrationScript oldStore newStore) Source #
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type ToT (MigrationScript oldStore newStore) :: T # Methods toVal :: MigrationScript oldStore newStore -> Value (ToT (MigrationScript oldStore newStore)) # fromVal :: Value (ToT (MigrationScript oldStore newStore)) -> MigrationScript oldStore newStore #
IsoValue a => IsoValue (Void_ a b) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (Void_ a b) :: T # Methods toVal :: Void_ a b -> Value (ToT (Void_ a b)) # fromVal :: Value (ToT (Void_ a b)) -> Void_ a b #
IsoValue a => IsoValue (View a r) Source #
Instance details Defined in Lorentz.Macro Associated Types type ToT (View a r) :: T # Methods toVal :: View a r -> Value (ToT (View a r)) # fromVal :: Value (ToT (View a r)) -> View a r #
(IsoValue storeTemplate, IsoValue other) => IsoValue (StorageSkeleton storeTemplate other) Source #
Instance details Defined in Lorentz.Store Associated Types type ToT (StorageSkeleton storeTemplate other) :: T # Methods toVal :: StorageSkeleton storeTemplate other -> Value (ToT (StorageSkeleton storeTemplate other)) # fromVal :: Value (ToT (StorageSkeleton storeTemplate other)) -> StorageSkeleton storeTemplate other #
(IsoValue a, IsoValue b, IsoValue c) => IsoValue (a, b, c)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c) :: T # Methods toVal :: (a, b, c) -> Value (ToT (a, b, c)) # fromVal :: Value (ToT (a, b, c)) -> (a, b, c) #
IsoValue a => IsoValue (NamedF Maybe a name)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Maybe a name) :: T # Methods toVal :: NamedF Maybe a name -> Value (ToT (NamedF Maybe a name)) # fromVal :: Value (ToT (NamedF Maybe a name)) -> NamedF Maybe a name #
IsoValue a => IsoValue (NamedF Identity a name)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Identity a name) :: T # Methods toVal :: NamedF Identity a name -> Value (ToT (NamedF Identity a name)) # fromVal :: Value (ToT (NamedF Identity a name)) -> NamedF Identity a name #
IsoValue v => IsoValue (k2 \|-> v) Source #
Instance details Defined in Lorentz.Store Associated Types type ToT (k2 \|-> v) :: T # Methods toVal :: (k2 \|-> v) -> Value (ToT (k2 \|-> v)) # fromVal :: Value (ToT (k2 \|-> v)) -> k2 \|-> v #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d) => IsoValue (a, b, c, d)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d) :: T # Methods toVal :: (a, b, c, d) -> Value (ToT (a, b, c, d)) # fromVal :: Value (ToT (a, b, c, d)) -> (a, b, c, d) #
IsoValue (MUStore oldTemplate newTemplate remDiff touched) Source #
Instance details Defined in Lorentz.UStore.Migration.Base Associated Types type ToT (MUStore oldTemplate newTemplate remDiff touched) :: T # Methods toVal :: MUStore oldTemplate newTemplate remDiff touched -> Value (ToT (MUStore oldTemplate newTemplate remDiff touched)) # fromVal :: Value (ToT (MUStore oldTemplate newTemplate remDiff touched)) -> MUStore oldTemplate newTemplate remDiff touched #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e) => IsoValue (a, b, c, d, e)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e) :: T # Methods toVal :: (a, b, c, d, e) -> Value (ToT (a, b, c, d, e)) # fromVal :: Value (ToT (a, b, c, d, e)) -> (a, b, c, d, e) #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e, IsoValue f) => IsoValue (a, b, c, d, e, f)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e, f) :: T # Methods toVal :: (a, b, c, d, e, f) -> Value (ToT (a, b, c, d, e, f)) # fromVal :: Value (ToT (a, b, c, d, e, f)) -> (a, b, c, d, e, f) #
(IsoValue a, IsoValue b, IsoValue c, IsoValue d, IsoValue e, IsoValue f, IsoValue g) => IsoValue (a, b, c, d, e, f, g)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (a, b, c, d, e, f, g) :: T # Methods toVal :: (a, b, c, d, e, f, g) -> Value (ToT (a, b, c, d, e, f, g)) # fromVal :: Value (ToT (a, b, c, d, e, f, g)) -> (a, b, c, d, e, f, g) #

class IsoCValue a where #

Isomorphism between Michelson primitive values and plain Haskell types.

Associated Types

type ToCT a :: CT #

Type function that converts a regular Haskell type into a comparable type (which has kind CT).

Methods

toCVal :: a -> CValue (ToCT a) #

Converts a single Haskell value into CVal representation.

fromCVal :: CValue (ToCT a) -> a #

Converts a CVal value into a single Haskell value.

Instances

IsoCValue Bool
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Bool :: CT # Methods toCVal :: Bool -> CValue (ToCT Bool) # fromCVal :: CValue (ToCT Bool) -> Bool #
IsoCValue Integer
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Integer :: CT # Methods toCVal :: Integer -> CValue (ToCT Integer) # fromCVal :: CValue (ToCT Integer) -> Integer #
IsoCValue Natural
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Natural :: CT # Methods toCVal :: Natural -> CValue (ToCT Natural) # fromCVal :: CValue (ToCT Natural) -> Natural #
IsoCValue ByteString
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT ByteString :: CT # Methods toCVal :: ByteString -> CValue (ToCT ByteString) # fromCVal :: CValue (ToCT ByteString) -> ByteString #
(DoNotUseTextError :: Constraint) => IsoCValue Text
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Text :: CT # Methods toCVal :: Text -> CValue (ToCT Text) # fromCVal :: CValue (ToCT Text) -> Text #
IsoCValue EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT EpAddress :: CT # Methods toCVal :: EpAddress -> CValue (ToCT EpAddress) # fromCVal :: CValue (ToCT EpAddress) -> EpAddress #
IsoCValue Address	This instance erases reference to contract entrypoint! If this is an issue, use `EpAddress` instead. Applications which use addresses just as participants identifiers should not experience problems with using plain `Address`.
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Address :: CT # Methods toCVal :: Address -> CValue (ToCT Address) # fromCVal :: CValue (ToCT Address) -> Address #
IsoCValue Mutez
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Mutez :: CT # Methods toCVal :: Mutez -> CValue (ToCT Mutez) # fromCVal :: CValue (ToCT Mutez) -> Mutez #
IsoCValue Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Timestamp :: CT # Methods toCVal :: Timestamp -> CValue (ToCT Timestamp) # fromCVal :: CValue (ToCT Timestamp) -> Timestamp #
IsoCValue KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT KeyHash :: CT # Methods toCVal :: KeyHash -> CValue (ToCT KeyHash) # fromCVal :: CValue (ToCT KeyHash) -> KeyHash #
IsoCValue MText
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT MText :: CT # Methods toCVal :: MText -> CValue (ToCT MText) # fromCVal :: CValue (ToCT MText) -> MText #

data CValue (t :: CT) where #

Representation of comparable value in Michelson language.

By specification, we're allowed to compare only following types: int, nat, string, bytes, mutez, bool, key_hash, timestamp, address.

Only these values can be used as map keys or set elements.

Constructors

CvInt :: forall (t :: CT). Integer -> CValue CInt
CvNat :: forall (t :: CT). Natural -> CValue CNat
CvString :: forall (t :: CT). MText -> CValue CString
CvBytes :: forall (t :: CT). ByteString -> CValue CBytes
CvMutez :: forall (t :: CT). Mutez -> CValue CMutez
CvBool :: forall (t :: CT). Bool -> CValue CBool
CvKeyHash :: forall (t :: CT). KeyHash -> CValue CKeyHash
CvTimestamp :: forall (t :: CT). Timestamp -> CValue CTimestamp
CvAddress :: forall (t :: CT). EpAddress -> CValue CAddress

Instances

Eq (CValue t)
Instance details Defined in Michelson.Typed.CValue Methods (==) :: CValue t -> CValue t -> Bool # (/=) :: CValue t -> CValue t -> Bool #
Ord (CValue t)
Instance details Defined in Michelson.Typed.CValue Methods compare :: CValue t -> CValue t -> Ordering # (<) :: CValue t -> CValue t -> Bool # (<=) :: CValue t -> CValue t -> Bool # (>) :: CValue t -> CValue t -> Bool # (>=) :: CValue t -> CValue t -> Bool # max :: CValue t -> CValue t -> CValue t # min :: CValue t -> CValue t -> CValue t #
Show (CValue t)
Instance details Defined in Michelson.Typed.CValue Methods showsPrec :: Int -> CValue t -> ShowS # show :: CValue t -> String # showList :: [CValue t] -> ShowS #

Primitive types

data Integer #

Invariant: Jn# and Jp# are used iff value doesn't fit in S#

Useful properties resulting from the invariants:

```
abs (S# _) <= abs (Jp# _)
```
```
abs (S# _) <  abs (Jn# _)
```

Instances

Enum Integer	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Integer -> Integer # pred :: Integer -> Integer # toEnum :: Int -> Integer # fromEnum :: Integer -> Int # enumFrom :: Integer -> [Integer] # enumFromThen :: Integer -> Integer -> [Integer] # enumFromTo :: Integer -> Integer -> [Integer] # enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #
Eq Integer
Instance details Defined in GHC.Integer.Type Methods (==) :: Integer -> Integer -> Bool # (/=) :: Integer -> Integer -> Bool #
Integral Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods quot :: Integer -> Integer -> Integer # rem :: Integer -> Integer -> Integer # div :: Integer -> Integer -> Integer # mod :: Integer -> Integer -> Integer # quotRem :: Integer -> Integer -> (Integer, Integer) # divMod :: Integer -> Integer -> (Integer, Integer) # toInteger :: Integer -> Integer #
Data Integer	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Integer -> c Integer # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Integer # toConstr :: Integer -> Constr # dataTypeOf :: Integer -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Integer) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Integer) # gmapT :: (forall b. Data b => b -> b) -> Integer -> Integer # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r # gmapQ :: (forall d. Data d => d -> u) -> Integer -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Integer -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Integer -> m Integer # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer #
Num Integer	Since: base-2.1
Instance details Defined in GHC.Num Methods (+) :: Integer -> Integer -> Integer # (-) :: Integer -> Integer -> Integer # (*) :: Integer -> Integer -> Integer # negate :: Integer -> Integer # abs :: Integer -> Integer # signum :: Integer -> Integer # fromInteger :: Integer -> Integer #
Ord Integer
Instance details Defined in GHC.Integer.Type Methods compare :: Integer -> Integer -> Ordering # (<) :: Integer -> Integer -> Bool # (<=) :: Integer -> Integer -> Bool # (>) :: Integer -> Integer -> Bool # (>=) :: Integer -> Integer -> Bool # max :: Integer -> Integer -> Integer # min :: Integer -> Integer -> Integer #
Read Integer	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Integer # readList :: ReadS [Integer] # readPrec :: ReadPrec Integer # readListPrec :: ReadPrec [Integer] #
Real Integer	Since: base-2.0.1
Instance details Defined in GHC.Real Methods toRational :: Integer -> Rational #
Show Integer	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Integer -> ShowS # show :: Integer -> String # showList :: [Integer] -> ShowS #
Lift Integer
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Integer -> Q Exp #
Arbitrary Integer
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Integer # shrink :: Integer -> [Integer] #
CoArbitrary Integer
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Integer -> Gen b -> Gen b #
Hashable Integer
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Integer -> Int # hash :: Integer -> Int #
Subtractive Integer
Instance details Defined in Basement.Numerical.Subtractive Associated Types type Difference Integer :: Type # Methods (-) :: Integer -> Integer -> Difference Integer #
NFData Integer
Instance details Defined in Control.DeepSeq Methods rnf :: Integer -> () #
Default Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
Buildable Integer
Instance details Defined in Formatting.Buildable Methods build :: Integer -> Builder #
TypeHasDoc Integer
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy Integer -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Integer -> WithinParens -> Markdown # typeDocDependencies :: Proxy Integer -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep Integer # typeDocMichelsonRep :: TypeDocMichelsonRep Integer #
IsoCValue Integer
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Integer :: CT # Methods toCVal :: Integer -> CValue (ToCT Integer) # fromCVal :: CValue (ToCT Integer) -> Integer #
IsoValue Integer
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Integer :: T # Methods toVal :: Integer -> Value (ToT Integer) # fromVal :: Value (ToT Integer) -> Integer #
Pretty Integer
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Integer -> Doc # prettyList :: [Integer] -> Doc #
HasTypeAnn Integer Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT Integer) Source #
EDivOpHs Integer Integer Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Integer :: Type Source # type EModOpResHs Integer Integer :: Type Source #
EDivOpHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Natural :: Type Source # type EModOpResHs Integer Natural :: Type Source #
EDivOpHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Integer :: Type Source # type EModOpResHs Natural Integer :: Type Source #
UnaryArithOpHs Abs Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Abs Integer :: Type Source #
UnaryArithOpHs Neg Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Integer :: Type Source #
UnaryArithOpHs Not Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Integer :: Type Source #
UnaryArithOpHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Eq' Integer :: Type Source #
UnaryArithOpHs Neq Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neq Integer :: Type Source #
UnaryArithOpHs Lt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Lt Integer :: Type Source #
UnaryArithOpHs Gt Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Gt Integer :: Type Source #
UnaryArithOpHs Le Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Le Integer :: Type Source #
UnaryArithOpHs Ge Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Ge Integer :: Type Source #
KnownNat n => Reifies (n :: Nat) Integer
Instance details Defined in Data.Reflection Methods reflect :: proxy n -> Integer #
ArithOpHs Add Integer Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Integer :: Type Source #
ArithOpHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Natural :: Type Source #
ArithOpHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Timestamp :: Type Source #
ArithOpHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Integer :: Type Source #
ArithOpHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Timestamp Integer :: Type Source #
ArithOpHs Sub Integer Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Integer :: Type Source #
ArithOpHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Natural :: Type Source #
ArithOpHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Integer :: Type Source #
ArithOpHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Integer :: Type Source #
ArithOpHs Mul Integer Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Integer :: Type Source #
ArithOpHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Natural :: Type Source #
ArithOpHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Integer :: Type Source #
ArithOpHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Integer Natural :: Type Source #
() :=> (Enum Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Integer #
() :=> (Eq Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Integer #
() :=> (Integral Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Integral Integer #
() :=> (Num Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Num Integer #
() :=> (Ord Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Integer #
() :=> (Real Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Real Integer #
() :=> (Bits Integer)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Integer #
type Difference Integer
Instance details Defined in Basement.Numerical.Subtractive type Difference Integer = Integer
type ToCT Integer
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT Integer = CInt
type ToT Integer
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Integer = Tc (ToCT Integer)
type EDivOpResHs Integer Integer Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Integer = Integer
type EDivOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Natural = Integer
type EDivOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Integer = Integer
type EModOpResHs Integer Integer Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Integer = Natural
type EModOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Natural = Natural
type EModOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Integer = Natural
type UnaryArithResHs Abs Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Abs Integer = Natural
type UnaryArithResHs Neg Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Integer = Integer
type UnaryArithResHs Not Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Integer = Integer
type UnaryArithResHs Eq' Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Eq' Integer = Bool
type UnaryArithResHs Neq Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neq Integer = Bool
type UnaryArithResHs Lt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Lt Integer = Bool
type UnaryArithResHs Gt Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Gt Integer = Bool
type UnaryArithResHs Le Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Le Integer = Bool
type UnaryArithResHs Ge Integer Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Ge Integer = Bool
type ArithResHs Add Integer Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Integer = Integer
type ArithResHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Natural = Integer
type ArithResHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Timestamp = Timestamp
type ArithResHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Integer = Integer
type ArithResHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Timestamp Integer = Timestamp
type ArithResHs Sub Integer Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Integer = Integer
type ArithResHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Natural = Integer
type ArithResHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Integer = Integer
type ArithResHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Integer = Timestamp
type ArithResHs Mul Integer Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Integer = Integer
type ArithResHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Natural = Integer
type ArithResHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Integer = Integer
type ArithResHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Integer Natural = Integer

data Natural #

Type representing arbitrary-precision non-negative integers.

>>> 2^100 :: Natural
1267650600228229401496703205376

Operations whose result would be negative throw (Underflow :: ArithException),

>>> -1 :: Natural
*** Exception: arithmetic underflow

Since: base-4.8.0.0

Instances

Enum Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Enum Methods succ :: Natural -> Natural # pred :: Natural -> Natural # toEnum :: Int -> Natural # fromEnum :: Natural -> Int # enumFrom :: Natural -> [Natural] # enumFromThen :: Natural -> Natural -> [Natural] # enumFromTo :: Natural -> Natural -> [Natural] # enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] #
Eq Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Natural Methods (==) :: Natural -> Natural -> Bool # (/=) :: Natural -> Natural -> Bool #
Integral Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Real Methods quot :: Natural -> Natural -> Natural # rem :: Natural -> Natural -> Natural # div :: Natural -> Natural -> Natural # mod :: Natural -> Natural -> Natural # quotRem :: Natural -> Natural -> (Natural, Natural) # divMod :: Natural -> Natural -> (Natural, Natural) # toInteger :: Natural -> Integer #
Data Natural	Since: base-4.8.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Natural -> c Natural # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Natural # toConstr :: Natural -> Constr # dataTypeOf :: Natural -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Natural) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Natural) # gmapT :: (forall b. Data b => b -> b) -> Natural -> Natural # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Natural -> r # gmapQ :: (forall d. Data d => d -> u) -> Natural -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Natural -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Natural -> m Natural #
Num Natural	Note that `Natural`'s `Num` instance isn't a ring: no element but 0 has an additive inverse. It is a semiring though. Since: base-4.8.0.0
Instance details Defined in GHC.Num Methods (+) :: Natural -> Natural -> Natural # (-) :: Natural -> Natural -> Natural # (*) :: Natural -> Natural -> Natural # negate :: Natural -> Natural # abs :: Natural -> Natural # signum :: Natural -> Natural # fromInteger :: Integer -> Natural #
Ord Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Natural Methods compare :: Natural -> Natural -> Ordering # (<) :: Natural -> Natural -> Bool # (<=) :: Natural -> Natural -> Bool # (>) :: Natural -> Natural -> Bool # (>=) :: Natural -> Natural -> Bool # max :: Natural -> Natural -> Natural # min :: Natural -> Natural -> Natural #
Read Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Natural # readList :: ReadS [Natural] # readPrec :: ReadPrec Natural # readListPrec :: ReadPrec [Natural] #
Real Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Real Methods toRational :: Natural -> Rational #
Show Natural	Since: base-4.8.0.0
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Natural -> ShowS # show :: Natural -> String # showList :: [Natural] -> ShowS #
Lift Natural
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Natural -> Q Exp #
Hashable Natural
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Natural -> Int # hash :: Natural -> Int #
Subtractive Natural
Instance details Defined in Basement.Numerical.Subtractive Associated Types type Difference Natural :: Type # Methods (-) :: Natural -> Natural -> Difference Natural #
NFData Natural	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Natural -> () #
TypeHasDoc Natural
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy Natural -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Natural -> WithinParens -> Markdown # typeDocDependencies :: Proxy Natural -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep Natural # typeDocMichelsonRep :: TypeDocMichelsonRep Natural #
IsoCValue Natural
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Natural :: CT # Methods toCVal :: Natural -> CValue (ToCT Natural) # fromCVal :: CValue (ToCT Natural) -> Natural #
IsoValue Natural
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Natural :: T # Methods toVal :: Natural -> Value (ToT Natural) # fromVal :: Value (ToT Natural) -> Natural #
HasTypeAnn Natural Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT Natural) Source #
EDivOpHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Integer Natural :: Type Source # type EModOpResHs Integer Natural :: Type Source #
EDivOpHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Integer :: Type Source # type EModOpResHs Natural Integer :: Type Source #
EDivOpHs Natural Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Natural Natural :: Type Source # type EModOpResHs Natural Natural :: Type Source #
EDivOpHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Natural :: Type Source # type EModOpResHs Mutez Natural :: Type Source #
UnaryArithOpHs Neg Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Neg Natural :: Type Source #
UnaryArithOpHs Not Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Natural :: Type Source #
ArithOpHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Natural :: Type Source #
ArithOpHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Integer :: Type Source #
ArithOpHs Add Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Natural Natural :: Type Source #
ArithOpHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Integer Natural :: Type Source #
ArithOpHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Integer :: Type Source #
ArithOpHs Sub Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Natural Natural :: Type Source #
ArithOpHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Integer Natural :: Type Source #
ArithOpHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Integer :: Type Source #
ArithOpHs Mul Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Natural :: Type Source #
ArithOpHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Mutez :: Type Source #
ArithOpHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Mutez Natural :: Type Source #
ArithOpHs Or Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Natural Natural :: Type Source #
ArithOpHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Integer Natural :: Type Source #
ArithOpHs And Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Natural Natural :: Type Source #
ArithOpHs Xor Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Natural Natural :: Type Source #
ArithOpHs Lsl Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsl Natural Natural :: Type Source #
ArithOpHs Lsr Natural Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Lsr Natural Natural :: Type Source #
() :=> (Enum Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Natural #
() :=> (Eq Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Natural #
() :=> (Integral Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Integral Natural #
() :=> (Num Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Num Natural #
() :=> (Ord Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Natural #
() :=> (Read Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Read Natural #
() :=> (Real Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Real Natural #
() :=> (Show Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Natural #
() :=> (Bits Natural)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Natural #
type Difference Natural
Instance details Defined in Basement.Numerical.Subtractive type Difference Natural = Maybe Natural
type ToCT Natural
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT Natural = CNat
type ToT Natural
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Natural = Tc (ToCT Natural)
type EDivOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Integer Natural = Integer
type EDivOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Integer = Integer
type EDivOpResHs Natural Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Natural Natural = Natural
type EDivOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Natural = Mutez
type EModOpResHs Integer Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Integer Natural = Natural
type EModOpResHs Natural Integer Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Integer = Natural
type EModOpResHs Natural Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Natural Natural = Natural
type EModOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Natural = Mutez
type UnaryArithResHs Neg Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Neg Natural = Integer
type UnaryArithResHs Not Natural Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Natural = Integer
type ArithResHs Add Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Natural = Integer
type ArithResHs Add Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Integer = Integer
type ArithResHs Add Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Natural Natural = Natural
type ArithResHs Sub Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Integer Natural = Integer
type ArithResHs Sub Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Integer = Integer
type ArithResHs Sub Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Natural Natural = Integer
type ArithResHs Mul Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Integer Natural = Integer
type ArithResHs Mul Natural Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Integer = Integer
type ArithResHs Mul Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Natural = Natural
type ArithResHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Mutez = Mutez
type ArithResHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Mutez Natural = Mutez
type ArithResHs Or Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Or Natural Natural = Natural
type ArithResHs And Integer Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Integer Natural = Integer
type ArithResHs And Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Natural Natural = Natural
type ArithResHs Xor Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Xor Natural Natural = Natural
type ArithResHs Lsl Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Lsl Natural Natural = Natural
type ArithResHs Lsr Natural Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Lsr Natural Natural = Natural

data MText #

Michelson string value.

This is basically a mere text with limits imposed by the language: https://tezos.gitlab.io/whitedoc/michelson.html#constants Although, this document seems to be not fully correct, and thus we applied constraints deduced empirically.

You construct an item of this type using one of the following ways:

With QuasyQuotes when need to create a string literal.

>>> [mt|Some text|]
MTextUnsafe { unMText = "Some text" }

With mkMText when constructing from a runtime text value.
With mkMTextUnsafe or MTextUnsafe when absolutelly sure that given string does not violate invariants.
With mkMTextCut when not sure about text contents and want to make it compliant with Michelson constraints.

Instances

Eq MText
Instance details Defined in Michelson.Text Methods (==) :: MText -> MText -> Bool # (/=) :: MText -> MText -> Bool #
Data MText
Instance details Defined in Michelson.Text Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MText -> c MText # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MText # toConstr :: MText -> Constr # dataTypeOf :: MText -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c MText) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MText) # gmapT :: (forall b. Data b => b -> b) -> MText -> MText # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MText -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MText -> r # gmapQ :: (forall d. Data d => d -> u) -> MText -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MText -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MText -> m MText # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MText -> m MText # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MText -> m MText #
Ord MText
Instance details Defined in Michelson.Text Methods compare :: MText -> MText -> Ordering # (<) :: MText -> MText -> Bool # (<=) :: MText -> MText -> Bool # (>) :: MText -> MText -> Bool # (>=) :: MText -> MText -> Bool # max :: MText -> MText -> MText # min :: MText -> MText -> MText #
Show MText
Instance details Defined in Michelson.Text Methods showsPrec :: Int -> MText -> ShowS # show :: MText -> String # showList :: [MText] -> ShowS #
(TypeError (Text "There is no instance defined for (IsString MText)" :$$: Text "Consider using QuasiQuotes: `[mt\|some text...\|]`") :: Constraint) => IsString MText
Instance details Defined in Michelson.Text Methods fromString :: String -> MText #
Semigroup MText
Instance details Defined in Michelson.Text Methods (<>) :: MText -> MText -> MText # sconcat :: NonEmpty MText -> MText # stimes :: Integral b => b -> MText -> MText #
Monoid MText
Instance details Defined in Michelson.Text Methods mempty :: MText # mappend :: MText -> MText -> MText # mconcat :: [MText] -> MText #
Arbitrary MText
Instance details Defined in Michelson.Text Methods arbitrary :: Gen MText # shrink :: MText -> [MText] #
Hashable MText
Instance details Defined in Michelson.Text Methods hashWithSalt :: Int -> MText -> Int # hash :: MText -> Int #
ToJSON MText
Instance details Defined in Michelson.Text Methods toJSON :: MText -> Value # toEncoding :: MText -> Encoding # toJSONList :: [MText] -> Value # toEncodingList :: [MText] -> Encoding #
FromJSON MText
Instance details Defined in Michelson.Text Methods parseJSON :: Value -> Parser MText # parseJSONList :: Value -> Parser [MText] #
Buildable MText
Instance details Defined in Michelson.Text Methods build :: MText -> Builder #
TypeHasDoc MText
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy MText -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy MText -> WithinParens -> Markdown # typeDocDependencies :: Proxy MText -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep MText # typeDocMichelsonRep :: TypeDocMichelsonRep MText #
IsoCValue MText
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT MText :: CT # Methods toCVal :: MText -> CValue (ToCT MText) # fromCVal :: CValue (ToCT MText) -> MText #
IsoValue MText
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT MText :: T # Methods toVal :: MText -> Value (ToT MText) # fromVal :: Value (ToT MText) -> MText #
Container MText
Instance details Defined in Michelson.Text Associated Types type Element MText :: Type # Methods toList :: MText -> [Element MText] # null :: MText -> Bool # foldr :: (Element MText -> b -> b) -> b -> MText -> b # foldl :: (b -> Element MText -> b) -> b -> MText -> b # foldl' :: (b -> Element MText -> b) -> b -> MText -> b # length :: MText -> Int # elem :: Element MText -> MText -> Bool # maximum :: MText -> Element MText # minimum :: MText -> Element MText # foldMap :: Monoid m => (Element MText -> m) -> MText -> m # fold :: MText -> Element MText # foldr' :: (Element MText -> b -> b) -> b -> MText -> b # foldr1 :: (Element MText -> Element MText -> Element MText) -> MText -> Element MText # foldl1 :: (Element MText -> Element MText -> Element MText) -> MText -> Element MText # notElem :: Element MText -> MText -> Bool # all :: (Element MText -> Bool) -> MText -> Bool # any :: (Element MText -> Bool) -> MText -> Bool # and :: MText -> Bool # or :: MText -> Bool # find :: (Element MText -> Bool) -> MText -> Maybe (Element MText) # safeHead :: MText -> Maybe (Element MText) #
ToText MText
Instance details Defined in Michelson.Text Methods toText :: MText -> Text #
SliceOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
ConcatOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs MText Source #
Instance details Defined in Lorentz.Polymorphic
HasTypeAnn MText Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT MText) Source #
IsError MText Source #	Use this for internal errors only. Normal error scenarios should use the mechanism of custom errors, see below.
Instance details Defined in Lorentz.Errors Methods errorToVal :: MText -> (forall (t :: T). ErrorScope t => Value t -> r) -> r Source # errorFromVal :: (Typeable t, SingI t) => Value t -> Either Text MText Source #
ErrorHasDoc MText Source #
Instance details Defined in Lorentz.Errors Methods errorDocName :: Text Source # errorDocMdCause :: Markdown Source # errorDocMdCauseInEntrypoint :: Markdown Source # errorDocHaskellRep :: Markdown Source # errorDocClass :: ErrorClass Source # errorDocDependencies :: [SomeDocDefinitionItem] Source #
type ToCT MText
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT MText = CString
type ToT MText
Instance details Defined in Michelson.Typed.Haskell.Value type ToT MText = Tc (ToCT MText)
type Element MText
Instance details Defined in Michelson.Text type Element MText = Element Text

data Bool #

Constructors

False
True

Instances

Bounded Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods minBound :: Bool # maxBound :: Bool #
Enum Bool	Since: base-2.1
Instance details Defined in GHC.Enum Methods succ :: Bool -> Bool # pred :: Bool -> Bool # toEnum :: Int -> Bool # fromEnum :: Bool -> Int # enumFrom :: Bool -> [Bool] # enumFromThen :: Bool -> Bool -> [Bool] # enumFromTo :: Bool -> Bool -> [Bool] # enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #
Eq Bool
Instance details Defined in GHC.Classes Methods (==) :: Bool -> Bool -> Bool # (/=) :: Bool -> Bool -> Bool #
Data Bool	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bool -> c Bool # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bool # toConstr :: Bool -> Constr # dataTypeOf :: Bool -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bool) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bool) # gmapT :: (forall b. Data b => b -> b) -> Bool -> Bool # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQ :: (forall d. Data d => d -> u) -> Bool -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Bool -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool #
Ord Bool
Instance details Defined in GHC.Classes Methods compare :: Bool -> Bool -> Ordering # (<) :: Bool -> Bool -> Bool # (<=) :: Bool -> Bool -> Bool # (>) :: Bool -> Bool -> Bool # (>=) :: Bool -> Bool -> Bool # max :: Bool -> Bool -> Bool # min :: Bool -> Bool -> Bool #
Read Bool	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS Bool # readList :: ReadS [Bool] # readPrec :: ReadPrec Bool # readListPrec :: ReadPrec [Bool] #
Show Bool	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Bool -> ShowS # show :: Bool -> String # showList :: [Bool] -> ShowS #
Generic Bool
Instance details Defined in GHC.Generics Associated Types type Rep Bool :: Type -> Type # Methods from :: Bool -> Rep Bool x # to :: Rep Bool x -> Bool #
Lift Bool
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Bool -> Q Exp #
Assertable Bool
Instance details Defined in Test.HUnit.Base Methods assert :: Bool -> Assertion #
AssertionPredicable Bool
Instance details Defined in Test.HUnit.Base Methods assertionPredicate :: Bool -> AssertionPredicate #
Testable Bool
Instance details Defined in Test.QuickCheck.Property Methods property :: Bool -> Property # propertyForAllShrinkShow :: Gen a -> (a -> [a]) -> (a -> [String]) -> (a -> Bool) -> Property #
Arbitrary Bool
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen Bool # shrink :: Bool -> [Bool] #
CoArbitrary Bool
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Bool -> Gen b -> Gen b #
Hashable Bool
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Bool -> Int # hash :: Bool -> Int #
SingKind Bool	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep Bool :: Type Methods fromSing :: Sing a -> DemoteRep Bool
Storable Bool	Since: base-2.1
Instance details Defined in Foreign.Storable Methods sizeOf :: Bool -> Int # alignment :: Bool -> Int # peekElemOff :: Ptr Bool -> Int -> IO Bool # pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () # peekByteOff :: Ptr b -> Int -> IO Bool # pokeByteOff :: Ptr b -> Int -> Bool -> IO () # peek :: Ptr Bool -> IO Bool # poke :: Ptr Bool -> Bool -> IO () #
NFData Bool
Instance details Defined in Control.DeepSeq Methods rnf :: Bool -> () #
Buildable Bool
Instance details Defined in Formatting.Buildable Methods build :: Bool -> Builder #
Example Bool
Instance details Defined in Test.Hspec.Core.Example Associated Types type Arg Bool :: Type # Methods evaluateExample :: Bool -> Params -> (ActionWith (Arg Bool) -> IO ()) -> ProgressCallback -> IO Result #
Unbox Bool
Instance details Defined in Data.Vector.Unboxed.Base
TypeHasDoc Bool
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy Bool -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Bool -> WithinParens -> Markdown # typeDocDependencies :: Proxy Bool -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep Bool # typeDocMichelsonRep :: TypeDocMichelsonRep Bool #
IsoCValue Bool
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Bool :: CT # Methods toCVal :: Bool -> CValue (ToCT Bool) # fromCVal :: CValue (ToCT Bool) -> Bool #
IsoValue Bool
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Bool :: T # Methods toVal :: Bool -> Value (ToT Bool) # fromVal :: Value (ToT Bool) -> Bool #
PShow Bool
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow Bool
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PEnum Bool
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type Succ arg :: a # type Pred arg :: a # type ToEnum arg :: a # type FromEnum arg :: Nat # type EnumFromTo arg arg1 :: [a] # type EnumFromThenTo arg arg1 arg2 :: [a] #
SEnum Bool
Instance details Defined in Data.Singletons.Prelude.Enum Methods sSucc :: Sing t -> Sing (Apply SuccSym0 t) # sPred :: Sing t -> Sing (Apply PredSym0 t) # sToEnum :: Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) #
PBounded Bool
Instance details Defined in Data.Singletons.Prelude.Enum Associated Types type MinBound :: a # type MaxBound :: a #
SBounded Bool
Instance details Defined in Data.Singletons.Prelude.Enum Methods sMinBound :: Sing MinBoundSym0 # sMaxBound :: Sing MaxBoundSym0 #
POrd Bool
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd Bool
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) #
SEq Bool
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: Sing a -> Sing b -> Sing (a == b) # (%/=) :: Sing a -> Sing b -> Sing (a /= b) #
PEq Bool
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
Pretty Bool
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Bool -> Doc # prettyList :: [Bool] -> Doc #
HasTypeAnn Bool Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT Bool) Source #
SingI False	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing False
SingI True	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing True
Vector Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) # basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () # elemseq :: Vector Bool -> Bool -> b -> b #
MVector MVector Bool
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Bool -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool # basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) #
UnaryArithOpHs Not Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool :: Type Source #
ArithOpHs Or Bool Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Or Bool Bool :: Type Source #
ArithOpHs And Bool Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs And Bool Bool :: Type Source #
ArithOpHs Xor Bool Bool Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Xor Bool Bool :: Type Source #
() :=> (Bounded Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Bounded Bool #
() :=> (Enum Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Enum Bool #
() :=> (Eq Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Eq Bool #
() :=> (Ord Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Ord Bool #
() :=> (Read Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Read Bool #
() :=> (Show Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Show Bool #
() :=> (Bits Bool)
Instance details Defined in Data.Constraint Methods ins :: () :- Bits Bool #
Example (a -> Bool)
Instance details Defined in Test.Hspec.Core.Example Associated Types type Arg (a -> Bool) :: Type # Methods evaluateExample :: (a -> Bool) -> Params -> (ActionWith (Arg (a -> Bool)) -> IO ()) -> ProgressCallback -> IO Result #
SingI NotSym0
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing NotSym0 #
SingI (\|\|@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (\|\|@#@$) #
SingI (&&@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (&&@#@$) #
SingI (<=?@#@$)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing (<=?@#@$) #
SingI AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing AllSym0 #
SingI AnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing AnySym0 #
SingI ShowParenSym0
Instance details Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 #
SingI OrSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing OrSym0 #
SingI AndSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AndSym0 #
SuppressUnusedWarnings NotSym0
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings FromEnum_6989586621679763764Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings All_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Any_Sym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (\|\|@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (&&@#@$)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings Compare_6989586621679391374Sym0
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowParenSym0
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings OrSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings AndSym0
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ToEnum_6989586621679763758Sym0
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ShowsPrec_6989586621680280967Sym0
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (<=?@#@$)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAllSym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings GetAnySym0
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SingI x => SingI ((\|\|@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing ((\|\|@#@$$) x) #
SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing ((&&@#@$$) x) #
SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ((<=?@#@$$) x) #
SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing GuardSym0 #
SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing UnlessSym0 #
SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sing :: Sing WhenSym0 #
SingI (ListnullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListnullSym0 #
SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListisPrefixOfSym0 #
SingI (NullSym0 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NullSym0 #
SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsSuffixOfSym0 #
SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsPrefixOfSym0 #
SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsInfixOfSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 #
SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListelemSym0 #
SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NotElemSym0 #
SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemSym0 #
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing OrSym0 #
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AndSym0 #
SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing (==@#@$) #
SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing (/=@#@$) #
SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing Bool_Sym0 #
SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (>@#@$) #
SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (>=@#@$) #
SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (<@#@$) #
SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (<=@#@$) #
SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListtakeWhileSym0 #
SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListspanSym0 #
SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListpartitionSym0 #
SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListnubBySym0 #
SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListfilterSym0 #
SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing ListdropWhileSym0 #
SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnionBySym0 #
SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing TakeWhileSym0 #
SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SpanSym0 #
SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SelectSym0 #
SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing PartitionSym0 #
SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing NubBySym0 #
SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IntersectBySym0 #
SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing GroupBySym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindSym0 #
SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndicesSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 #
SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FilterSym0 #
SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing Elem_bySym0 #
SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileSym0 #
SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileEndSym0 #
SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteFirstsBySym0 #
SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteBySym0 #
SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing BreakSym0 #
SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AnySym0 #
SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing AllSym0 #
SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods sing :: Sing UntilSym0 #
SuppressUnusedWarnings ((\|\|@#@$$) a6989586621679360668 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((&&@#@$$) a6989586621679360427 :: TyFun Bool Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679391374Sym1 a6989586621679391372 :: TyFun Bool Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f6989586621679544591 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680280967Sym1 a6989586621680280964 :: TyFun Bool (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f6989586621681207764 () ~> f6989586621681207764 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f6989586621679544620 () ~> f6989586621679544620 ()) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnullSym0 :: TyFun [a6989586621680387251] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a6989586621680387274] ([a6989586621680387274] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun [a6989586621679939789] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a6989586621679939754] ([a6989586621679939754] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a6989586621679939755] ([a6989586621679939755] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a6989586621679939753] ([a6989586621679939753] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679495146) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679495147) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type)
Instance details Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym0 :: TyFun a6989586621680387262 ([a6989586621680387262] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621679939751 ([a6989586621679939751] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621679939752 ([a6989586621679939752] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OrSym0 :: TyFun (t6989586621680450647 Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451216Scrutinee_6989586621680450974Sym0 :: TyFun (t6989586621680450727 Bool) All -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451207Scrutinee_6989586621680450976Sym0 :: TyFun (t6989586621680450727 Bool) Any -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442550Scrutinee_6989586621680442488Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442523Scrutinee_6989586621680442486Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AndSym0 :: TyFun (t6989586621680450648 Bool) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k6989586621679363690 (k6989586621679363690 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$) :: TyFun a6989586621679363696 (a6989586621679363696 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$) :: TyFun a6989586621679363696 (a6989586621679363696 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym0 :: TyFun a6989586621679359676 (a6989586621679359676 ~> (Bool ~> a6989586621679359676)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380186Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380168Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380150Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380132Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380214Scrutinee_6989586621679380009Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380196Scrutinee_6989586621679380007Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380105Scrutinee_6989586621679379997Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380100Scrutinee_6989586621679379995Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680676101Sym0 :: TyFun a6989586621680450744 (Identity a6989586621680450744 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680676224Sym0 :: TyFun (Identity a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a6989586621680387280 ~> Bool) ([a6989586621680387280] ~> [a6989586621680387280]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListspanSym0 :: TyFun (a6989586621680387278 ~> Bool) ([a6989586621680387278] ~> ([a6989586621680387278], [a6989586621680387278])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a6989586621680387276 ~> Bool) ([a6989586621680387276] ~> ([a6989586621680387276], [a6989586621680387276])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a6989586621680387268 ~> (a6989586621680387268 ~> Bool)) ([a6989586621680387268] ~> [a6989586621680387268]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a6989586621680387277 ~> Bool) ([a6989586621680387277] ~> [a6989586621680387277]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a6989586621680387279 ~> Bool) ([a6989586621680387279] ~> [a6989586621680387279]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnionBySym0 :: TyFun (a6989586621679939668 ~> (a6989586621679939668 ~> Bool)) ([a6989586621679939668] ~> ([a6989586621679939668] ~> [a6989586621679939668])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a6989586621679939695 ~> Bool) ([a6989586621679939695] ~> [a6989586621679939695]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SpanSym0 :: TyFun (a6989586621679939692 ~> Bool) ([a6989586621679939692] ~> ([a6989586621679939692], [a6989586621679939692])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (SelectSym0 :: TyFun (a6989586621679939678 ~> Bool) (a6989586621679939678 ~> (([a6989586621679939678], [a6989586621679939678]) ~> ([a6989586621679939678], [a6989586621679939678]))) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (PartitionSym0 :: TyFun (a6989586621679939679 ~> Bool) ([a6989586621679939679] ~> ([a6989586621679939679], [a6989586621679939679])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NubBySym0 :: TyFun (a6989586621679939670 ~> (a6989586621679939670 ~> Bool)) ([a6989586621679939670] ~> [a6989586621679939670]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949153ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949153YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949153X_6989586621679949154Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949110ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949110YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949110X_6989586621679949111Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a6989586621679939696 ~> (a6989586621679939696 ~> Bool)) ([a6989586621679939696] ~> ([a6989586621679939696] ~> [a6989586621679939696])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GroupBySym0 :: TyFun (a6989586621679939682 ~> (a6989586621679939682 ~> Bool)) ([a6989586621679939682] ~> [[a6989586621679939682]]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621679939702 ~> Bool) ([a6989586621679939702] ~> Maybe a6989586621679939702) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a6989586621679939698 ~> Bool) ([a6989586621679939698] ~> [Nat]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621679939699 ~> Bool) ([a6989586621679939699] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterSym0 :: TyFun (a6989586621679939703 ~> Bool) ([a6989586621679939703] ~> [a6989586621679939703]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a6989586621679939669 ~> (a6989586621679939669 ~> Bool)) (a6989586621679939669 ~> ([a6989586621679939669] ~> Bool)) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a6989586621679939694 ~> Bool) ([a6989586621679939694] ~> [a6989586621679939694]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a6989586621679939693 ~> Bool) ([a6989586621679939693] ~> [a6989586621679939693]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a6989586621679939708 ~> (a6989586621679939708 ~> Bool)) ([a6989586621679939708] ~> ([a6989586621679939708] ~> [a6989586621679939708])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a6989586621679939709 ~> (a6989586621679939709 ~> Bool)) (a6989586621679939709 ~> ([a6989586621679939709] ~> [a6989586621679939709])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (BreakSym0 :: TyFun (a6989586621679939691 ~> Bool) ([a6989586621679939691] ~> ([a6989586621679939691], [a6989586621679939691])) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621679939772 ~> Bool) ([a6989586621679939772] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621679939773 ~> Bool) ([a6989586621679939773] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UntilSym0 :: TyFun (a6989586621679520379 ~> Bool) ((a6989586621679520379 ~> a6989586621679520379) ~> (a6989586621679520379 ~> a6989586621679520379)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () #
(SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing (ListisPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods sing :: Sing (ListelemSym1 d) #
(SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (NotElemSym1 d) #
(SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsSuffixOfSym1 d) #
(SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsPrefixOfSym1 d) #
(SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsInfixOfSym1 d) #
(SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemSym1 d) #
SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (AnySym1 d) #
SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (AllSym1 d) #
SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 #
SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 #
SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (Elem_bySym1 d) #
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NotElemSym0 #
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing ElemSym0 #
(SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing ((==@#@$$) x) #
(SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods sing :: Sing ((/=@#@$$) x) #
SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (Bool_Sym1 d) #
(SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((>@#@$$) d) #
(SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((>=@#@$$) d) #
(SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((<@#@$$) d) #
(SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ((<=@#@$$) d) #
SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing MfilterSym0 #
SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing FilterMSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AnySym0 #
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing AllSym0 #
SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680388326 :: TyFun [a6989586621680387274] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListelemSym1 a6989586621680388261 :: TyFun [a6989586621680387262] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621679949635 :: TyFun [a6989586621679939751] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621679950260 :: TyFun [a6989586621679939754] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621679949669 :: TyFun [a6989586621679939755] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsInfixOfSym1 a6989586621679949907 :: TyFun [a6989586621679939753] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 a6989586621679949642 :: TyFun [a6989586621679939752] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621679949900 :: TyFun [a6989586621679939772] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621679949955 :: TyFun [a6989586621679939773] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621680432173 b6989586621680432174) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621680432175 b6989586621680432176) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948982Scrutinee_6989586621679940370Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym1 a6989586621679948927 :: TyFun a6989586621679939669 ([a6989586621679939669] ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680450638 (t6989586621680450637 a6989586621680450638 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442550Scrutinee_6989586621680442488Sym1 x6989586621680442543 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442523Scrutinee_6989586621680442486Sym1 x6989586621680442516 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680452447Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680452280Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680452113Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680451776Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680451653Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (DefaultEqSym1 a6989586621679363691 :: TyFun k6989586621679363690 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((==@#@$$) x6989586621679363697 :: TyFun a6989586621679363696 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((/=@#@$$) x6989586621679363699 :: TyFun a6989586621679363696 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Bool_Sym1 a6989586621679359682 :: TyFun a6989586621679359676 (Bool ~> a6989586621679359676) -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380186Sym1 a6989586621679380184 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380168Sym1 a6989586621679380166 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380150Sym1 a6989586621679380148 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679380132Sym1 a6989586621679380130 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380214Scrutinee_6989586621679380009Sym1 x6989586621679380212 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380196Scrutinee_6989586621679380007Sym1 x6989586621679380194 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380105Scrutinee_6989586621679379997Sym1 x6989586621679380098 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679380100Scrutinee_6989586621679379995Sym1 x6989586621679380098 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>@#@$$) arg6989586621679380078 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((>=@#@$$) arg6989586621679380082 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<@#@$$) arg6989586621679380070 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings ((<=@#@$$) arg6989586621679380074 :: TyFun a6989586621679379977 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680882853Sym0 :: TyFun (Arg a6989586621680881636 b6989586621680881637) (Arg a6989586621680881636 b6989586621680881637 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680676101Sym1 a6989586621680676099 :: TyFun (Identity a6989586621680450744) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MfilterSym0 :: TyFun (a6989586621681207760 ~> Bool) (m6989586621681207759 a6989586621681207760 ~> m6989586621681207759 a6989586621681207760) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FilterMSym0 :: TyFun (a6989586621681207798 ~> m6989586621681207797 Bool) ([a6989586621681207798] ~> m6989586621681207797 [a6989586621681207798]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949185ZsSym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] [a6989586621679939692] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949185YsSym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] [a6989586621679939692] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949185X_6989586621679949186Sym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] ([a6989586621679939692], [a6989586621679939692]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948943NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621679950276Sym0 :: TyFun (a6989586621679939789 ~> Bool) (TyFun k (TyFun a6989586621679939789 (TyFun [a6989586621679939789] [a6989586621679939789] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451197Scrutinee_6989586621680450978Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) Any -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451184Scrutinee_6989586621680450980Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) All -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451099Scrutinee_6989586621680450986Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) (First a6989586621680450730) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680451100Sym0 :: TyFun (a6989586621679072651 ~> Bool) (TyFun k (TyFun a6989586621679072651 (First a6989586621679072651) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680450636 ~> Bool) (t6989586621680450635 a6989586621680450636 ~> Maybe a6989586621680450636) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680450646 ~> Bool) (t6989586621680450645 a6989586621680450646 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680450644 ~> Bool) (t6989586621680450643 a6989586621680450644 ~> Bool) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679520515GoSym0 :: TyFun (k2 ~> Bool) (TyFun (k2 ~> k2) (TyFun k1 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods sing :: Sing (Bool_Sym2 d1 d2) #
(SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (Elem_bySym2 d1 d2) #
SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NullSym0 #
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (NotElemSym1 d t) #
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (ElemSym1 d t) #
(SFoldable t, SingI d) => SingI (AnySym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AnySym1 d t) #
(SFoldable t, SingI d) => SingI (AllSym1 d t :: TyFun (t a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (AllSym1 d t) #
SuppressUnusedWarnings (Bool_Sym2 a6989586621679359683 a6989586621679359682 :: TyFun Bool a6989586621679359676 -> Type)
Instance details Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_bySym2 a6989586621679948928 a6989586621679948927 :: TyFun [a6989586621679939669] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681208272Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun Bool (TyFun [k3] [k3] -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949661Scrutinee_6989586621679940374Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949079Scrutinee_6989586621679940354Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949065Scrutinee_6989586621679940356Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949050Scrutinee_6989586621679940366Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948982Scrutinee_6989586621679940370Sym1 n6989586621679948980 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948969Scrutinee_6989586621679940372Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680452570Sym0 :: TyFun (t6989586621680450727 a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680452403Sym0 :: TyFun (t6989586621680450727 a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680452236Sym0 :: TyFun (t6989586621680450727 a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680452090Sym0 :: TyFun (t6989586621680450727 a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680451914Sym0 :: TyFun (t6989586621680450727 a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Null_6989586621680451616Sym0 :: TyFun (t6989586621680450727 a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NullSym0 :: TyFun (t6989586621680450727 a6989586621680450742) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (NotElemSym1 a6989586621680451120 t6989586621680450637 :: TyFun (t6989586621680450637 a6989586621680450638) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680451603Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680452447Sym1 a6989586621680452445 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680452280Sym1 a6989586621680452278 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680452113Sym1 a6989586621680452111 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680451776Sym1 a6989586621680451774 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Elem_6989586621680451653Sym1 a6989586621680451651 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemSym1 arg6989586621680451394 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AnySym1 a6989586621680451191 t6989586621680450645 :: TyFun (t6989586621680450645 a6989586621680450646) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (AllSym1 a6989586621680451178 t6989586621680450643 :: TyFun (t6989586621680450643 a6989586621680450644) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621680882853Sym1 a6989586621680882851 :: TyFun (Arg a6989586621680881636 b6989586621680881637) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681208269Sym0 :: TyFun (k3 ~> f6989586621679544675 Bool) (TyFun k2 (TyFun k3 (TyFun (f6989586621679544675 [k3]) (f6989586621679544675 [k3]) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681208101Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679544699 k1) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679950280Scrutinee_6989586621679940348Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948953Scrutinee_6989586621679940376Sym0 :: TyFun (k3 ~> (k3 ~> Bool)) (TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681208272Sym1 p6989586621681208267 :: TyFun k2 (TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679950280Scrutinee_6989586621679940348Sym1 p6989586621679950274 :: TyFun k1 (TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949661Scrutinee_6989586621679940374Sym1 l6989586621679949651 :: TyFun k2 (TyFun k1 (TyFun [k2] Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949079Scrutinee_6989586621679940354Sym1 n6989586621679949076 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949065Scrutinee_6989586621679940356Sym1 n6989586621679949062 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949050Scrutinee_6989586621679940366Sym1 key6989586621679949046 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948969Scrutinee_6989586621679940372Sym1 x6989586621679948966 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948953Scrutinee_6989586621679940376Sym1 eq6989586621679948941 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680451603Sym1 a_69895866216804515986989586621680451602 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740143Scrutinee_6989586621679739909Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679950280Scrutinee_6989586621679940348Sym2 x6989586621679950278 p6989586621679950274 :: TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681208272Sym2 x6989586621681208271 p6989586621681208267 :: TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949661Scrutinee_6989586621679940374Sym2 x6989586621679949658 l6989586621679949651 :: TyFun k1 (TyFun [k2] Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949079Scrutinee_6989586621679940354Sym2 x6989586621679949077 n6989586621679949076 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949065Scrutinee_6989586621679940356Sym2 x6989586621679949063 n6989586621679949062 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949050Scrutinee_6989586621679940366Sym2 x6989586621679949047 key6989586621679949046 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948969Scrutinee_6989586621679940372Sym2 xs6989586621679948967 x6989586621679948966 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948953Scrutinee_6989586621679940376Sym2 l6989586621679948942 eq6989586621679948941 :: TyFun k3 (TyFun k1 (TyFun [k3] Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680451603Sym2 t6989586621680451610 a_69895866216804515986989586621680451602 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740143Scrutinee_6989586621679739909Sym1 x06989586621679740133 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740066Scrutinee_6989586621679739923Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740009Scrutinee_6989586621679739933Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621679949935Sym0 :: TyFun (b6989586621679544703 ~> (a6989586621679939772 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621679939772 (TyFun [a6989586621679939772] (TyFun b6989586621679544703 (m6989586621679544699 b6989586621679544703) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621681208272Sym3 a_69895866216812082656989586621681208268 x6989586621681208271 p6989586621681208267 :: TyFun Bool (TyFun [k2] [k2] -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949661Scrutinee_6989586621679940374Sym3 xs6989586621679949659 x6989586621679949658 l6989586621679949651 :: TyFun [k2] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679950280Scrutinee_6989586621679940348Sym3 xs6989586621679950279 x6989586621679950278 p6989586621679950274 :: TyFun k Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679949050Scrutinee_6989586621679940366Sym3 y6989586621679949048 x6989586621679949047 key6989586621679949046 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948953Scrutinee_6989586621679940376Sym3 y6989586621679948950 l6989586621679948942 eq6989586621679948941 :: TyFun k1 (TyFun [k3] Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740143Scrutinee_6989586621679739909Sym2 y6989586621679740134 x06989586621679740133 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740066Scrutinee_6989586621679739923Sym1 x16989586621679740061 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740009Scrutinee_6989586621679739933Sym1 x16989586621679740004 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679948953Scrutinee_6989586621679940376Sym4 ys6989586621679948951 y6989586621679948950 l6989586621679948942 eq6989586621679948941 :: TyFun [k3] Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740143Scrutinee_6989586621679739909Sym3 x6989586621679740142 y6989586621679740134 x06989586621679740133 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740066Scrutinee_6989586621679739923Sym2 x26989586621679740062 x16989586621679740061 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740009Scrutinee_6989586621679739933Sym2 x26989586621679740005 x16989586621679740004 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740143Scrutinee_6989586621679739909Sym4 arg_69895866216797399056989586621679740129 x6989586621679740142 y6989586621679740134 x06989586621679740133 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740066Scrutinee_6989586621679739923Sym3 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740009Scrutinee_6989586621679739933Sym3 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740066Scrutinee_6989586621679739923Sym4 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740009Scrutinee_6989586621679739933Sym4 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740066Scrutinee_6989586621679739923Sym5 arg_69895866216797399196989586621679740057 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679740009Scrutinee_6989586621679739933Sym5 arg_69895866216797399296989586621679740000 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k1 Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () #
type Rep Bool	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep Bool = D1 (MetaData "Bool" "GHC.Types" "ghc-prim" False) (C1 (MetaCons "False" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "True" PrefixI False) (U1 :: Type -> Type))
data Sing (a :: Bool)
Instance details Defined in GHC.Generics data Sing (a :: Bool) where STrue :: forall (a :: Bool). Sing True SFalse :: forall (a :: Bool). Sing False
type DemoteRep Bool
Instance details Defined in GHC.Generics type DemoteRep Bool = Bool
type Arg Bool
Instance details Defined in Test.Hspec.Core.Example type Arg Bool = ()
newtype Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Bool = V_Bool (Vector Word8)
type ToCT Bool
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT Bool = CBool
type ToT Bool
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Bool = Tc (ToCT Bool)
data Sing (a :: Bool)
Instance details Defined in Data.Singletons.Prelude.Instances data Sing (a :: Bool) where SFalse :: forall (a :: Bool). Sing False STrue :: forall (a :: Bool). Sing True
type MaxBound
Instance details Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621679735896Sym0
type MinBound
Instance details Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621679735894Sym0
type Demote Bool
Instance details Defined in Data.Singletons.Prelude.Instances type Demote Bool = Bool
type Show_ (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Bool) = Apply (Show__6989586621680262717Sym0 :: TyFun Bool Symbol -> Type) arg
type FromEnum (a :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type FromEnum (a :: Bool) = Apply FromEnum_6989586621679763764Sym0 a
type ToEnum a
Instance details Defined in Data.Singletons.Prelude.Enum type ToEnum a = Apply ToEnum_6989586621679763758Sym0 a
type Pred (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Pred (arg :: Bool) = Apply (Pred_6989586621679740195Sym0 :: TyFun Bool Bool -> Type) arg
type Succ (arg :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Succ (arg :: Bool) = Apply (Succ_6989586621679740186Sym0 :: TyFun Bool Bool -> Type) arg
newtype MVector s Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Bool = MV_Bool (MVector s Word8)
type UnaryArithResHs Not Bool Source #
Instance details Defined in Lorentz.Arith type UnaryArithResHs Not Bool = Bool
type ShowList (arg1 :: [Bool]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Bool]) arg2 = Apply (Apply (ShowList_6989586621680262728Sym0 :: TyFun [Bool] (Symbol ~> Symbol) -> Type) arg1) arg2
type EnumFromTo (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (EnumFromTo_6989586621679740206Sym0 :: TyFun Bool (Bool ~> [Bool]) -> Type) arg1) arg2
type Min (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Min_6989586621679380222Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Max (arg1 :: Bool) (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Bool) (arg2 :: Bool) = Apply (Apply (Max_6989586621679380204Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) >= (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) >= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679380186Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) > (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) > (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679380168Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) <= (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) <= (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679380150Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type (arg1 :: Bool) < (arg2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Bool) < (arg2 :: Bool) = Apply (Apply (TFHelper_6989586621679380132Sym0 :: TyFun Bool (Bool ~> Bool) -> Type) arg1) arg2
type Compare (a1 :: Bool) (a2 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a1 :: Bool) (a2 :: Bool) = Apply (Apply Compare_6989586621679391374Sym0 a1) a2
type (x :: Bool) /= (y :: Bool)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Bool) /= (y :: Bool) = Not (x == y)
type (a :: Bool) == (b :: Bool)
Instance details Defined in Data.Singletons.Prelude.Eq type (a :: Bool) == (b :: Bool) = Equals_6989586621679365122 a b
type ArithResHs Or Bool Bool Source #
Instance details Defined in Lorentz.Arith type ArithResHs Or Bool Bool = Bool
type ArithResHs And Bool Bool Source #
Instance details Defined in Lorentz.Arith type ArithResHs And Bool Bool = Bool
type ArithResHs Xor Bool Bool Source #
Instance details Defined in Lorentz.Arith type ArithResHs Xor Bool Bool = Bool
type ShowsPrec a1 (a2 :: Bool) a3
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a1 (a2 :: Bool) a3 = Apply (Apply (Apply ShowsPrec_6989586621680280967Sym0 a1) a2) a3
type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) = Apply (Apply (Apply (EnumFromThenTo_6989586621679740222Sym0 :: TyFun Bool (Bool ~> (Bool ~> [Bool])) -> Type) arg1) arg2) arg3
type Apply NotSym0 (a6989586621679360968 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply NotSym0 (a6989586621679360968 :: Bool) = Not a6989586621679360968
type Apply ToEnum_6989586621679763758Sym0 (a6989586621679763757 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply ToEnum_6989586621679763758Sym0 (a6989586621679763757 :: Nat) = ToEnum_6989586621679763758 a6989586621679763757
type Apply GetAllSym0 (a6989586621679820201 :: All)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAllSym0 (a6989586621679820201 :: All) = GetAll a6989586621679820201
type Apply GetAnySym0 (a6989586621679820215 :: Any)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply GetAnySym0 (a6989586621679820215 :: Any) = GetAny a6989586621679820215
type Apply FromEnum_6989586621679763764Sym0 (a6989586621679763763 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply FromEnum_6989586621679763764Sym0 (a6989586621679763763 :: Bool) = FromEnum_6989586621679763764 a6989586621679763763
type Apply All_Sym0 (a6989586621679853055 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply All_Sym0 (a6989586621679853055 :: Bool) = All_ a6989586621679853055
type Apply AllSym0 (t6989586621679820204 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AllSym0 (t6989586621679820204 :: Bool) = All t6989586621679820204
type Apply Any_Sym0 (a6989586621679853054 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply Any_Sym0 (a6989586621679853054 :: Bool) = Any_ a6989586621679853054
type Apply AnySym0 (t6989586621679820218 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply AnySym0 (t6989586621679820218 :: Bool) = Any t6989586621679820218
type Apply ((\|\|@#@$$) a6989586621679360668 :: TyFun Bool Bool -> Type) (b6989586621679360669 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((\|\|@#@$$) a6989586621679360668 :: TyFun Bool Bool -> Type) (b6989586621679360669 :: Bool) = a6989586621679360668 \|\| b6989586621679360669
type Apply ((&&@#@$$) a6989586621679360427 :: TyFun Bool Bool -> Type) (b6989586621679360428 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply ((&&@#@$$) a6989586621679360427 :: TyFun Bool Bool -> Type) (b6989586621679360428 :: Bool) = a6989586621679360427 && b6989586621679360428
type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat) = a3530822107858468865 <=? b3530822107858468866
type Apply (Compare_6989586621679391374Sym1 a6989586621679391372 :: TyFun Bool Ordering -> Type) (a6989586621679391373 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679391374Sym1 a6989586621679391372 :: TyFun Bool Ordering -> Type) (a6989586621679391373 :: Bool) = Compare_6989586621679391374 a6989586621679391372 a6989586621679391373
type Apply (Let6989586621680442523Scrutinee_6989586621680442486Sym1 x6989586621680442516 :: TyFun k1 Bool -> Type) (y6989586621680442517 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442523Scrutinee_6989586621680442486Sym1 x6989586621680442516 :: TyFun k1 Bool -> Type) (y6989586621680442517 :: k1) = Let6989586621680442523Scrutinee_6989586621680442486 x6989586621680442516 y6989586621680442517
type Apply (Let6989586621680442550Scrutinee_6989586621680442488Sym1 x6989586621680442543 :: TyFun k1 Bool -> Type) (y6989586621680442544 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442550Scrutinee_6989586621680442488Sym1 x6989586621680442543 :: TyFun k1 Bool -> Type) (y6989586621680442544 :: k1) = Let6989586621680442550Scrutinee_6989586621680442488 x6989586621680442543 y6989586621680442544
type Apply ((==@#@$$) x6989586621679363697 :: TyFun a Bool -> Type) (y6989586621679363698 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$$) x6989586621679363697 :: TyFun a Bool -> Type) (y6989586621679363698 :: a) = x6989586621679363697 == y6989586621679363698
type Apply ((/=@#@$$) x6989586621679363699 :: TyFun a Bool -> Type) (y6989586621679363700 :: a)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$$) x6989586621679363699 :: TyFun a Bool -> Type) (y6989586621679363700 :: a) = x6989586621679363699 /= y6989586621679363700
type Apply (DefaultEqSym1 a6989586621679363691 :: TyFun k Bool -> Type) (b6989586621679363692 :: k)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym1 a6989586621679363691 :: TyFun k Bool -> Type) (b6989586621679363692 :: k) = DefaultEq a6989586621679363691 b6989586621679363692
type Apply (Let6989586621679380100Scrutinee_6989586621679379995Sym1 x6989586621679380098 :: TyFun k1 Bool -> Type) (y6989586621679380099 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380100Scrutinee_6989586621679379995Sym1 x6989586621679380098 :: TyFun k1 Bool -> Type) (y6989586621679380099 :: k1) = Let6989586621679380100Scrutinee_6989586621679379995 x6989586621679380098 y6989586621679380099
type Apply (TFHelper_6989586621679380186Sym1 a6989586621679380184 :: TyFun a Bool -> Type) (a6989586621679380185 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380186Sym1 a6989586621679380184 :: TyFun a Bool -> Type) (a6989586621679380185 :: a) = TFHelper_6989586621679380186 a6989586621679380184 a6989586621679380185
type Apply (TFHelper_6989586621679380168Sym1 a6989586621679380166 :: TyFun a Bool -> Type) (a6989586621679380167 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380168Sym1 a6989586621679380166 :: TyFun a Bool -> Type) (a6989586621679380167 :: a) = TFHelper_6989586621679380168 a6989586621679380166 a6989586621679380167
type Apply (TFHelper_6989586621679380150Sym1 a6989586621679380148 :: TyFun a Bool -> Type) (a6989586621679380149 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380150Sym1 a6989586621679380148 :: TyFun a Bool -> Type) (a6989586621679380149 :: a) = TFHelper_6989586621679380150 a6989586621679380148 a6989586621679380149
type Apply (TFHelper_6989586621679380132Sym1 a6989586621679380130 :: TyFun a Bool -> Type) (a6989586621679380131 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380132Sym1 a6989586621679380130 :: TyFun a Bool -> Type) (a6989586621679380131 :: a) = TFHelper_6989586621679380132 a6989586621679380130 a6989586621679380131
type Apply ((<=@#@$$) arg6989586621679380074 :: TyFun a Bool -> Type) (arg6989586621679380075 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$$) arg6989586621679380074 :: TyFun a Bool -> Type) (arg6989586621679380075 :: a) = arg6989586621679380074 <= arg6989586621679380075
type Apply ((>=@#@$$) arg6989586621679380082 :: TyFun a Bool -> Type) (arg6989586621679380083 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$$) arg6989586621679380082 :: TyFun a Bool -> Type) (arg6989586621679380083 :: a) = arg6989586621679380082 >= arg6989586621679380083
type Apply ((>@#@$$) arg6989586621679380078 :: TyFun a Bool -> Type) (arg6989586621679380079 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$$) arg6989586621679380078 :: TyFun a Bool -> Type) (arg6989586621679380079 :: a) = arg6989586621679380078 > arg6989586621679380079
type Apply (Let6989586621679380214Scrutinee_6989586621679380009Sym1 x6989586621679380212 :: TyFun k1 Bool -> Type) (y6989586621679380213 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380214Scrutinee_6989586621679380009Sym1 x6989586621679380212 :: TyFun k1 Bool -> Type) (y6989586621679380213 :: k1) = Let6989586621679380214Scrutinee_6989586621679380009 x6989586621679380212 y6989586621679380213
type Apply (Let6989586621679380196Scrutinee_6989586621679380007Sym1 x6989586621679380194 :: TyFun k1 Bool -> Type) (y6989586621679380195 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380196Scrutinee_6989586621679380007Sym1 x6989586621679380194 :: TyFun k1 Bool -> Type) (y6989586621679380195 :: k1) = Let6989586621679380196Scrutinee_6989586621679380007 x6989586621679380194 y6989586621679380195
type Apply (Let6989586621679380105Scrutinee_6989586621679379997Sym1 x6989586621679380098 :: TyFun k1 Bool -> Type) (y6989586621679380099 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380105Scrutinee_6989586621679379997Sym1 x6989586621679380098 :: TyFun k1 Bool -> Type) (y6989586621679380099 :: k1) = Let6989586621679380105Scrutinee_6989586621679379997 x6989586621679380098 y6989586621679380099
type Apply ((<@#@$$) arg6989586621679380070 :: TyFun a Bool -> Type) (arg6989586621679380071 :: a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$$) arg6989586621679380070 :: TyFun a Bool -> Type) (arg6989586621679380071 :: a) = arg6989586621679380070 < arg6989586621679380071
type Apply (Let6989586621679948982Scrutinee_6989586621679940370Sym1 n6989586621679948980 :: TyFun k Bool -> Type) (x6989586621679948981 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948982Scrutinee_6989586621679940370Sym1 n6989586621679948980 :: TyFun k Bool -> Type) (x6989586621679948981 :: k) = Let6989586621679948982Scrutinee_6989586621679940370 n6989586621679948980 x6989586621679948981
type Apply (Bool_Sym2 a6989586621679359683 a6989586621679359682 :: TyFun Bool a -> Type) (a6989586621679359684 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym2 a6989586621679359683 a6989586621679359682 :: TyFun Bool a -> Type) (a6989586621679359684 :: Bool) = Bool_ a6989586621679359683 a6989586621679359682 a6989586621679359684
type Apply (Let6989586621679948969Scrutinee_6989586621679940372Sym2 xs6989586621679948967 x6989586621679948966 :: TyFun k3 Bool -> Type) (n6989586621679948968 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948969Scrutinee_6989586621679940372Sym2 xs6989586621679948967 x6989586621679948966 :: TyFun k3 Bool -> Type) (n6989586621679948968 :: k3) = Let6989586621679948969Scrutinee_6989586621679940372 xs6989586621679948967 x6989586621679948966 n6989586621679948968
type Apply (Let6989586621679949065Scrutinee_6989586621679940356Sym2 x6989586621679949063 n6989586621679949062 :: TyFun k3 Bool -> Type) (xs6989586621679949064 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949065Scrutinee_6989586621679940356Sym2 x6989586621679949063 n6989586621679949062 :: TyFun k3 Bool -> Type) (xs6989586621679949064 :: k3) = Let6989586621679949065Scrutinee_6989586621679940356 x6989586621679949063 n6989586621679949062 xs6989586621679949064
type Apply (Let6989586621679949079Scrutinee_6989586621679940354Sym2 x6989586621679949077 n6989586621679949076 :: TyFun k3 Bool -> Type) (xs6989586621679949078 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949079Scrutinee_6989586621679940354Sym2 x6989586621679949077 n6989586621679949076 :: TyFun k3 Bool -> Type) (xs6989586621679949078 :: k3) = Let6989586621679949079Scrutinee_6989586621679940354 x6989586621679949077 n6989586621679949076 xs6989586621679949078
type Apply (Lambda_6989586621680451603Sym2 t6989586621680451610 a_69895866216804515986989586621680451602 :: TyFun k3 Bool -> Type) (t6989586621680451611 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680451603Sym2 t6989586621680451610 a_69895866216804515986989586621680451602 :: TyFun k3 Bool -> Type) (t6989586621680451611 :: k3) = Lambda_6989586621680451603 t6989586621680451610 a_69895866216804515986989586621680451602 t6989586621680451611
type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym3 y6989586621679949048 x6989586621679949047 key6989586621679949046 :: TyFun k3 Bool -> Type) (xys6989586621679949049 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym3 y6989586621679949048 x6989586621679949047 key6989586621679949046 :: TyFun k3 Bool -> Type) (xys6989586621679949049 :: k3) = Let6989586621679949050Scrutinee_6989586621679940366 y6989586621679949048 x6989586621679949047 key6989586621679949046 xys6989586621679949049
type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym3 xs6989586621679950279 x6989586621679950278 p6989586621679950274 :: TyFun k Bool -> Type) (a_69895866216799502726989586621679950275 :: k)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym3 xs6989586621679950279 x6989586621679950278 p6989586621679950274 :: TyFun k Bool -> Type) (a_69895866216799502726989586621679950275 :: k) = Let6989586621679950280Scrutinee_6989586621679940348 xs6989586621679950279 x6989586621679950278 p6989586621679950274 a_69895866216799502726989586621679950275
type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym4 arg_69895866216797399056989586621679740129 x6989586621679740142 y6989586621679740134 x06989586621679740133 :: TyFun k4 Bool -> Type) (arg_69895866216797399076989586621679740130 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym4 arg_69895866216797399056989586621679740129 x6989586621679740142 y6989586621679740134 x06989586621679740133 :: TyFun k4 Bool -> Type) (arg_69895866216797399076989586621679740130 :: k4) = Let6989586621679740143Scrutinee_6989586621679739909 arg_69895866216797399056989586621679740129 x6989586621679740142 y6989586621679740134 x06989586621679740133 arg_69895866216797399076989586621679740130
type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym5 arg_69895866216797399296989586621679740000 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k5 Bool -> Type) (arg_69895866216797399316989586621679740001 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym5 arg_69895866216797399296989586621679740000 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k5 Bool -> Type) (arg_69895866216797399316989586621679740001 :: k5) = Let6989586621679740009Scrutinee_6989586621679739933 arg_69895866216797399296989586621679740000 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 arg_69895866216797399316989586621679740001
type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym5 arg_69895866216797399196989586621679740057 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k5 Bool -> Type) (arg_69895866216797399216989586621679740058 :: k5)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym5 arg_69895866216797399196989586621679740057 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k5 Bool -> Type) (arg_69895866216797399216989586621679740058 :: k5) = Let6989586621679740066Scrutinee_6989586621679739923 arg_69895866216797399196989586621679740057 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 arg_69895866216797399216989586621679740058
type Eval (Not False)
Instance details Defined in Fcf.Data.Bool type Eval (Not False) = True
type Eval (Not True)
Instance details Defined in Fcf.Data.Bool type Eval (Not True) = False
type Apply OrSym0 (a6989586621679949962 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply OrSym0 (a6989586621679949962 :: [Bool]) = Or a6989586621679949962
type Apply AndSym0 (a6989586621679949966 :: [Bool])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply AndSym0 (a6989586621679949966 :: [Bool]) = And a6989586621679949966
type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680388179 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680388179 :: [a]) = Listnull a6989586621680388179
type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621679950266 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621679950266 :: [a]) = Null a6989586621679950266
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495349 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495349 :: Maybe a) = IsNothing a6989586621679495349
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495351 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495351 :: Maybe a) = IsJust a6989586621679495351
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680451213 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680451213 :: t Bool) = And a6989586621680451213
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680451204 :: t Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680451204 :: t Bool) = Or a6989586621680451204
type Apply (Null_6989586621680676224Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680676223 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Null_6989586621680676224Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680676223 :: Identity a) = Null_6989586621680676224 a6989586621680676223
type Apply (Let6989586621680451216Scrutinee_6989586621680450974Sym0 :: TyFun (t6989586621680450727 Bool) All -> Type) (x6989586621680451215 :: t6989586621680450727 Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451216Scrutinee_6989586621680450974Sym0 :: TyFun (t6989586621680450727 Bool) All -> Type) (x6989586621680451215 :: t6989586621680450727 Bool) = Let6989586621680451216Scrutinee_6989586621680450974 x6989586621680451215
type Apply (Let6989586621680451207Scrutinee_6989586621680450976Sym0 :: TyFun (t6989586621680450727 Bool) Any -> Type) (x6989586621680451206 :: t6989586621680450727 Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451207Scrutinee_6989586621680450976Sym0 :: TyFun (t6989586621680450727 Bool) Any -> Type) (x6989586621680451206 :: t6989586621680450727 Bool) = Let6989586621680451207Scrutinee_6989586621680450976 x6989586621680451206
type Apply (ListelemSym1 a6989586621680388261 :: TyFun [a] Bool -> Type) (a6989586621680388262 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym1 a6989586621680388261 :: TyFun [a] Bool -> Type) (a6989586621680388262 :: [a]) = Listelem a6989586621680388261 a6989586621680388262
type Apply (ListisPrefixOfSym1 a6989586621680388326 :: TyFun [a] Bool -> Type) (a6989586621680388327 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym1 a6989586621680388326 :: TyFun [a] Bool -> Type) (a6989586621680388327 :: [a]) = ListisPrefixOf a6989586621680388326 a6989586621680388327
type Apply (NotElemSym1 a6989586621679949635 :: TyFun [a] Bool -> Type) (a6989586621679949636 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym1 a6989586621679949635 :: TyFun [a] Bool -> Type) (a6989586621679949636 :: [a]) = NotElem a6989586621679949635 a6989586621679949636
type Apply (ElemSym1 a6989586621679949642 :: TyFun [a] Bool -> Type) (a6989586621679949643 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym1 a6989586621679949642 :: TyFun [a] Bool -> Type) (a6989586621679949643 :: [a]) = Elem a6989586621679949642 a6989586621679949643
type Apply (IsPrefixOfSym1 a6989586621679949669 :: TyFun [a] Bool -> Type) (a6989586621679949670 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621679949669 :: TyFun [a] Bool -> Type) (a6989586621679949670 :: [a]) = IsPrefixOf a6989586621679949669 a6989586621679949670
type Apply (AnySym1 a6989586621679949900 :: TyFun [a] Bool -> Type) (a6989586621679949901 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym1 a6989586621679949900 :: TyFun [a] Bool -> Type) (a6989586621679949901 :: [a]) = Any a6989586621679949900 a6989586621679949901
type Apply (IsInfixOfSym1 a6989586621679949907 :: TyFun [a] Bool -> Type) (a6989586621679949908 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym1 a6989586621679949907 :: TyFun [a] Bool -> Type) (a6989586621679949908 :: [a]) = IsInfixOf a6989586621679949907 a6989586621679949908
type Apply (AllSym1 a6989586621679949955 :: TyFun [a] Bool -> Type) (a6989586621679949956 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym1 a6989586621679949955 :: TyFun [a] Bool -> Type) (a6989586621679949956 :: [a]) = All a6989586621679949955 a6989586621679949956
type Apply (IsSuffixOfSym1 a6989586621679950260 :: TyFun [a] Bool -> Type) (a6989586621679950261 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621679950260 :: TyFun [a] Bool -> Type) (a6989586621679950261 :: [a]) = IsSuffixOf a6989586621679950260 a6989586621679950261
type Apply (Elem_6989586621680676101Sym1 a6989586621680676099 :: TyFun (Identity a) Bool -> Type) (a6989586621680676100 :: Identity a)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680676101Sym1 a6989586621680676099 :: TyFun (Identity a) Bool -> Type) (a6989586621680676100 :: Identity a) = Elem_6989586621680676101 a6989586621680676099 a6989586621680676100
type Apply (Elem_bySym2 a6989586621679948928 a6989586621679948927 :: TyFun [a] Bool -> Type) (a6989586621679948929 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym2 a6989586621679948928 a6989586621679948927 :: TyFun [a] Bool -> Type) (a6989586621679948929 :: [a]) = Elem_by a6989586621679948928 a6989586621679948927 a6989586621679948929
type Apply (Elem_6989586621680451653Sym1 a6989586621680451651 t :: TyFun (t a) Bool -> Type) (a6989586621680451652 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680451653Sym1 a6989586621680451651 t :: TyFun (t a) Bool -> Type) (a6989586621680451652 :: t a) = Elem_6989586621680451653 a6989586621680451651 a6989586621680451652
type Apply (Null_6989586621680451616Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680451615 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680451616Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680451615 :: t a) = Null_6989586621680451616 a6989586621680451615
type Apply (AnySym1 a6989586621680451191 t :: TyFun (t a) Bool -> Type) (a6989586621680451192 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym1 a6989586621680451191 t :: TyFun (t a) Bool -> Type) (a6989586621680451192 :: t a) = Any a6989586621680451191 a6989586621680451192
type Apply (ElemSym1 arg6989586621680451394 t :: TyFun (t a) Bool -> Type) (arg6989586621680451395 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym1 arg6989586621680451394 t :: TyFun (t a) Bool -> Type) (arg6989586621680451395 :: t a) = Elem arg6989586621680451394 arg6989586621680451395
type Apply (NotElemSym1 a6989586621680451120 t :: TyFun (t a) Bool -> Type) (a6989586621680451121 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym1 a6989586621680451120 t :: TyFun (t a) Bool -> Type) (a6989586621680451121 :: t a) = NotElem a6989586621680451120 a6989586621680451121
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680451390 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680451390 :: t a) = Null arg6989586621680451390
type Apply (AllSym1 a6989586621680451178 t :: TyFun (t a) Bool -> Type) (a6989586621680451179 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym1 a6989586621680451178 t :: TyFun (t a) Bool -> Type) (a6989586621680451179 :: t a) = All a6989586621680451178 a6989586621680451179
type Apply (Elem_6989586621680451776Sym1 a6989586621680451774 t :: TyFun (t a) Bool -> Type) (a6989586621680451775 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680451776Sym1 a6989586621680451774 t :: TyFun (t a) Bool -> Type) (a6989586621680451775 :: t a) = Elem_6989586621680451776 a6989586621680451774 a6989586621680451775
type Apply (Null_6989586621680451914Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680451913 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680451914Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680451913 :: t a) = Null_6989586621680451914 a6989586621680451913
type Apply (Null_6989586621680452090Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452089 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680452090Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452089 :: t a) = Null_6989586621680452090 a6989586621680452089
type Apply (Elem_6989586621680452113Sym1 a6989586621680452111 t :: TyFun (t a) Bool -> Type) (a6989586621680452112 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680452113Sym1 a6989586621680452111 t :: TyFun (t a) Bool -> Type) (a6989586621680452112 :: t a) = Elem_6989586621680452113 a6989586621680452111 a6989586621680452112
type Apply (Null_6989586621680452236Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452235 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680452236Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452235 :: t a) = Null_6989586621680452236 a6989586621680452235
type Apply (Elem_6989586621680452280Sym1 a6989586621680452278 t :: TyFun (t a) Bool -> Type) (a6989586621680452279 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680452280Sym1 a6989586621680452278 t :: TyFun (t a) Bool -> Type) (a6989586621680452279 :: t a) = Elem_6989586621680452280 a6989586621680452278 a6989586621680452279
type Apply (Null_6989586621680452403Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452402 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680452403Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452402 :: t a) = Null_6989586621680452403 a6989586621680452402
type Apply (Elem_6989586621680452447Sym1 a6989586621680452445 t :: TyFun (t a) Bool -> Type) (a6989586621680452446 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680452447Sym1 a6989586621680452445 t :: TyFun (t a) Bool -> Type) (a6989586621680452446 :: t a) = Elem_6989586621680452447 a6989586621680452445 a6989586621680452446
type Apply (Null_6989586621680452570Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452569 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Null_6989586621680452570Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680452569 :: t a) = Null_6989586621680452570 a6989586621680452569
type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym3 xs6989586621679949659 x6989586621679949658 l6989586621679949651 :: TyFun [k1] Bool -> Type) (ls6989586621679949660 :: [k1])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym3 xs6989586621679949659 x6989586621679949658 l6989586621679949651 :: TyFun [k1] Bool -> Type) (ls6989586621679949660 :: [k1]) = Let6989586621679949661Scrutinee_6989586621679940374 xs6989586621679949659 x6989586621679949658 l6989586621679949651 ls6989586621679949660
type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym4 ys6989586621679948951 y6989586621679948950 l6989586621679948942 eq6989586621679948941 :: TyFun [k2] Bool -> Type) (xs6989586621679948952 :: [k2])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym4 ys6989586621679948951 y6989586621679948950 l6989586621679948942 eq6989586621679948941 :: TyFun [k2] Bool -> Type) (xs6989586621679948952 :: [k2]) = Let6989586621679948953Scrutinee_6989586621679940376 ys6989586621679948951 y6989586621679948950 l6989586621679948942 eq6989586621679948941 xs6989586621679948952
type Eval (Null (a2 ': as) :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Null (a2 ': as) :: Bool -> Type) = False
type Eval (Null ([] :: [a]) :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Null ([] :: [a]) :: Bool -> Type) = True
type Eval (a <= b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a <= b :: Bool -> Type) = a <=? b
type Eval (a >= b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a >= b :: Bool -> Type) = b <=? a
type Eval (a < b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a < b :: Bool -> Type) = Eval (Not =<< (a >= b))
type Eval (a > b :: Bool -> Type)
Instance details Defined in Fcf.Data.Nat type Eval (a > b :: Bool -> Type) = Eval (Not =<< (a <= b))
type Eval (False \|\| b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (False \|\| b :: Bool -> Type) = b
type Eval (True \|\| b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (True \|\| b :: Bool -> Type) = True
type Eval (a \|\| False :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a \|\| False :: Bool -> Type) = a
type Eval (a \|\| True :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a \|\| True :: Bool -> Type) = True
type Eval (False && b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (False && b :: Bool -> Type) = False
type Eval (True && b :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (True && b :: Bool -> Type) = b
type Eval (a && True :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a && True :: Bool -> Type) = a
type Eval (a && False :: Bool -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (a && False :: Bool -> Type) = False
type Eval (IsNothing (Nothing :: Maybe a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsNothing (Nothing :: Maybe a) :: Bool -> Type) = True
type Eval (IsNothing (Just _a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsNothing (Just _a) :: Bool -> Type) = False
type Eval (IsJust (Nothing :: Maybe a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsJust (Nothing :: Maybe a) :: Bool -> Type) = False
type Eval (IsJust (Just _a) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsJust (Just _a) :: Bool -> Type) = True
type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680432540 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680432540 :: Either a b) = IsRight a6989586621680432540
type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680432542 :: Either a b)
Instance details Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680432542 :: Either a b) = IsLeft a6989586621680432542
type Apply (TFHelper_6989586621680882853Sym1 a6989586621680882851 :: TyFun (Arg a b) Bool -> Type) (a6989586621680882852 :: Arg a b)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621680882853Sym1 a6989586621680882851 :: TyFun (Arg a b) Bool -> Type) (a6989586621680882852 :: Arg a b) = TFHelper_6989586621680882853 a6989586621680882851 a6989586621680882852
type Eval (Elem a2 as :: Bool -> Type)
Instance details Defined in Fcf.Data.List type Eval (Elem a2 as :: Bool -> Type) = Eval ((IsJust :: Maybe Nat -> Bool -> Type) =<< FindIndex (TyEq a2 :: a1 -> Bool -> Type) as)
type Eval (IsLeft (Right _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsLeft (Right _a :: Either a b) :: Bool -> Type) = False
type Eval (IsLeft (Left _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsLeft (Left _a :: Either a b) :: Bool -> Type) = True
type Eval (IsRight (Right _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsRight (Right _a :: Either a b) :: Bool -> Type) = True
type Eval (IsRight (Left _a :: Either a b) :: Bool -> Type)
Instance details Defined in Fcf.Data.Common type Eval (IsRight (Left _a :: Either a b) :: Bool -> Type) = False
type Eval (TyEq a b :: Bool -> Type)
Instance details Defined in Fcf.Utils type Eval (TyEq a b :: Bool -> Type) = TyEqImpl a b
type Eval (TyEqSing a b :: Bool -> Type)
Instance details Defined in Util.Fcf type Eval (TyEqSing a b :: Bool -> Type) = DefaultEq a b
type Eval (Guarded x ((p := y) ': ys) :: a2 -> Type)
Instance details Defined in Fcf.Data.Bool type Eval (Guarded x ((p := y) ': ys) :: a2 -> Type) = Eval (If (Eval (p x)) y (Guarded x ys))
type Apply (GuardSym0 :: TyFun Bool (f6989586621679544591 ()) -> Type) (a6989586621679544760 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (GuardSym0 :: TyFun Bool (f6989586621679544591 ()) -> Type) (a6989586621679544760 :: Bool) = (Guard a6989586621679544760 :: f6989586621679544591 ())
type Arg (a -> Bool)
Instance details Defined in Test.Hspec.Core.Example type Arg (a -> Bool) = a
type Apply (\|\|@#@$) (a6989586621679360668 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (\|\|@#@$) (a6989586621679360668 :: Bool) = (\|\|@#@$$) a6989586621679360668
type Apply (&&@#@$) (a6989586621679360427 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (&&@#@$) (a6989586621679360427 :: Bool) = (&&@#@$$) a6989586621679360427
type Apply Compare_6989586621679391374Sym0 (a6989586621679391372 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679391374Sym0 (a6989586621679391372 :: Bool) = Compare_6989586621679391374Sym1 a6989586621679391372
type Apply ShowsPrec_6989586621680280967Sym0 (a6989586621680280964 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowsPrec_6989586621680280967Sym0 (a6989586621680280964 :: Nat) = ShowsPrec_6989586621680280967Sym1 a6989586621680280964
type Apply (<=?@#@$) (a3530822107858468865 :: Nat)
Instance details Defined in Data.Singletons.TypeLits.Internal type Apply (<=?@#@$) (a3530822107858468865 :: Nat) = (<=?@#@$$) a3530822107858468865
type Apply ShowParenSym0 (a6989586621680262625 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply ShowParenSym0 (a6989586621680262625 :: Bool) = ShowParenSym1 a6989586621680262625
type Apply (Let6989586621680442523Scrutinee_6989586621680442486Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680442516 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442523Scrutinee_6989586621680442486Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680442516 :: k1) = Let6989586621680442523Scrutinee_6989586621680442486Sym1 x6989586621680442516
type Apply (Let6989586621680442550Scrutinee_6989586621680442488Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680442543 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442550Scrutinee_6989586621680442488Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680442543 :: k1) = Let6989586621680442550Scrutinee_6989586621680442488Sym1 x6989586621680442543
type Apply (Let6989586621679380100Scrutinee_6989586621679379995Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380098 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380100Scrutinee_6989586621679379995Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380098 :: k1) = Let6989586621679380100Scrutinee_6989586621679379995Sym1 x6989586621679380098
type Apply (Let6989586621679380214Scrutinee_6989586621679380009Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380212 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380214Scrutinee_6989586621679380009Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380212 :: k1) = Let6989586621679380214Scrutinee_6989586621679380009Sym1 x6989586621679380212
type Apply (Let6989586621679380196Scrutinee_6989586621679380007Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380194 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380196Scrutinee_6989586621679380007Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380194 :: k1) = Let6989586621679380196Scrutinee_6989586621679380007Sym1 x6989586621679380194
type Apply (Let6989586621679380105Scrutinee_6989586621679379997Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380098 :: k1)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Let6989586621679380105Scrutinee_6989586621679379997Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679380098 :: k1) = Let6989586621679380105Scrutinee_6989586621679379997Sym1 x6989586621679380098
type Apply (ListelemSym0 :: TyFun a6989586621680387262 ([a6989586621680387262] ~> Bool) -> Type) (a6989586621680388261 :: a6989586621680387262)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListelemSym0 :: TyFun a6989586621680387262 ([a6989586621680387262] ~> Bool) -> Type) (a6989586621680388261 :: a6989586621680387262) = ListelemSym1 a6989586621680388261
type Apply (NotElemSym0 :: TyFun a6989586621679939751 ([a6989586621679939751] ~> Bool) -> Type) (a6989586621679949635 :: a6989586621679939751)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NotElemSym0 :: TyFun a6989586621679939751 ([a6989586621679939751] ~> Bool) -> Type) (a6989586621679949635 :: a6989586621679939751) = NotElemSym1 a6989586621679949635
type Apply (ElemSym0 :: TyFun a6989586621679939752 ([a6989586621679939752] ~> Bool) -> Type) (a6989586621679949642 :: a6989586621679939752)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemSym0 :: TyFun a6989586621679939752 ([a6989586621679939752] ~> Bool) -> Type) (a6989586621679949642 :: a6989586621679939752) = ElemSym1 a6989586621679949642
type Apply (ShowsPrec_6989586621680280967Sym1 a6989586621680280964 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680280965 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680280967Sym1 a6989586621680280964 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680280965 :: Bool) = ShowsPrec_6989586621680280967Sym2 a6989586621680280964 a6989586621680280965
type Apply (UnlessSym0 :: TyFun Bool (f6989586621681207764 () ~> f6989586621681207764 ()) -> Type) (a6989586621681208132 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f6989586621681207764 () ~> f6989586621681207764 ()) -> Type) (a6989586621681208132 :: Bool) = (UnlessSym1 a6989586621681208132 f6989586621681207764 :: TyFun (f6989586621681207764 ()) (f6989586621681207764 ()) -> Type)
type Apply (WhenSym0 :: TyFun Bool (f6989586621679544620 () ~> f6989586621679544620 ()) -> Type) (a6989586621679545008 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (WhenSym0 :: TyFun Bool (f6989586621679544620 () ~> f6989586621679544620 ()) -> Type) (a6989586621679545008 :: Bool) = (WhenSym1 a6989586621679545008 f6989586621679544620 :: TyFun (f6989586621679544620 ()) (f6989586621679544620 ()) -> Type)
type Apply ((==@#@$) :: TyFun a6989586621679363696 (a6989586621679363696 ~> Bool) -> Type) (x6989586621679363697 :: a6989586621679363696)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((==@#@$) :: TyFun a6989586621679363696 (a6989586621679363696 ~> Bool) -> Type) (x6989586621679363697 :: a6989586621679363696) = (==@#@$$) x6989586621679363697
type Apply ((/=@#@$) :: TyFun a6989586621679363696 (a6989586621679363696 ~> Bool) -> Type) (x6989586621679363699 :: a6989586621679363696)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply ((/=@#@$) :: TyFun a6989586621679363696 (a6989586621679363696 ~> Bool) -> Type) (x6989586621679363699 :: a6989586621679363696) = (/=@#@$$) x6989586621679363699
type Apply (DefaultEqSym0 :: TyFun k6989586621679363690 (k6989586621679363690 ~> Bool) -> Type) (a6989586621679363691 :: k6989586621679363690)
Instance details Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k6989586621679363690 (k6989586621679363690 ~> Bool) -> Type) (a6989586621679363691 :: k6989586621679363690) = DefaultEqSym1 a6989586621679363691
type Apply (Bool_Sym0 :: TyFun a6989586621679359676 (a6989586621679359676 ~> (Bool ~> a6989586621679359676)) -> Type) (a6989586621679359682 :: a6989586621679359676)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym0 :: TyFun a6989586621679359676 (a6989586621679359676 ~> (Bool ~> a6989586621679359676)) -> Type) (a6989586621679359682 :: a6989586621679359676) = Bool_Sym1 a6989586621679359682
type Apply (TFHelper_6989586621679380186Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380184 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380186Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380184 :: a6989586621679379977) = TFHelper_6989586621679380186Sym1 a6989586621679380184
type Apply (TFHelper_6989586621679380168Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380166 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380168Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380166 :: a6989586621679379977) = TFHelper_6989586621679380168Sym1 a6989586621679380166
type Apply (TFHelper_6989586621679380150Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380148 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380150Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380148 :: a6989586621679379977) = TFHelper_6989586621679380150Sym1 a6989586621679380148
type Apply (TFHelper_6989586621679380132Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380130 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (TFHelper_6989586621679380132Sym0 :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (a6989586621679380130 :: a6989586621679379977) = TFHelper_6989586621679380132Sym1 a6989586621679380130
type Apply ((<=@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380074 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<=@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380074 :: a6989586621679379977) = (<=@#@$$) arg6989586621679380074
type Apply ((>=@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380082 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>=@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380082 :: a6989586621679379977) = (>=@#@$$) arg6989586621679380082
type Apply ((>@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380078 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((>@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380078 :: a6989586621679379977) = (>@#@$$) arg6989586621679380078
type Apply ((<@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380070 :: a6989586621679379977)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply ((<@#@$) :: TyFun a6989586621679379977 (a6989586621679379977 ~> Bool) -> Type) (arg6989586621679380070 :: a6989586621679379977) = (<@#@$$) arg6989586621679380070
type Apply (Elem_6989586621680676101Sym0 :: TyFun a6989586621680450744 (Identity a6989586621680450744 ~> Bool) -> Type) (a6989586621680676099 :: a6989586621680450744)
Instance details Defined in Data.Singletons.Prelude.Identity type Apply (Elem_6989586621680676101Sym0 :: TyFun a6989586621680450744 (Identity a6989586621680450744 ~> Bool) -> Type) (a6989586621680676099 :: a6989586621680450744) = Elem_6989586621680676101Sym1 a6989586621680676099
type Apply (Let6989586621679948982Scrutinee_6989586621679940370Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621679948980 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948982Scrutinee_6989586621679940370Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621679948980 :: k1) = (Let6989586621679948982Scrutinee_6989586621679940370Sym1 n6989586621679948980 :: TyFun k Bool -> Type)
type Apply (Bool_Sym1 a6989586621679359682 :: TyFun a6989586621679359676 (Bool ~> a6989586621679359676) -> Type) (a6989586621679359683 :: a6989586621679359676)
Instance details Defined in Data.Singletons.Prelude.Bool type Apply (Bool_Sym1 a6989586621679359682 :: TyFun a6989586621679359676 (Bool ~> a6989586621679359676) -> Type) (a6989586621679359683 :: a6989586621679359676) = Bool_Sym2 a6989586621679359682 a6989586621679359683
type Apply (Elem_bySym1 a6989586621679948927 :: TyFun a6989586621679939669 ([a6989586621679939669] ~> Bool) -> Type) (a6989586621679948928 :: a6989586621679939669)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym1 a6989586621679948927 :: TyFun a6989586621679939669 ([a6989586621679939669] ~> Bool) -> Type) (a6989586621679948928 :: a6989586621679939669) = Elem_bySym2 a6989586621679948927 a6989586621679948928
type Apply (Elem_6989586621680451653Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680451651 :: a6989586621680450744)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680451653Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680451651 :: a6989586621680450744) = (Elem_6989586621680451653Sym1 a6989586621680451651 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
type Apply (ElemSym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (arg6989586621680451394 :: a6989586621680450744)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (ElemSym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (arg6989586621680451394 :: a6989586621680450744) = (ElemSym1 arg6989586621680451394 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
type Apply (NotElemSym0 :: TyFun a6989586621680450638 (t6989586621680450637 a6989586621680450638 ~> Bool) -> Type) (a6989586621680451120 :: a6989586621680450638)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a6989586621680450638 (t6989586621680450637 a6989586621680450638 ~> Bool) -> Type) (a6989586621680451120 :: a6989586621680450638) = (NotElemSym1 a6989586621680451120 t6989586621680450637 :: TyFun (t6989586621680450637 a6989586621680450638) Bool -> Type)
type Apply (Elem_6989586621680451776Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680451774 :: a6989586621680450744)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680451776Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680451774 :: a6989586621680450744) = (Elem_6989586621680451776Sym1 a6989586621680451774 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
type Apply (Elem_6989586621680452113Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680452111 :: a6989586621680450744)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680452113Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680452111 :: a6989586621680450744) = (Elem_6989586621680452113Sym1 a6989586621680452111 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
type Apply (Elem_6989586621680452280Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680452278 :: a6989586621680450744)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680452280Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680452278 :: a6989586621680450744) = (Elem_6989586621680452280Sym1 a6989586621680452278 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
type Apply (Elem_6989586621680452447Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680452445 :: a6989586621680450744)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680452447Sym0 :: TyFun a6989586621680450744 (t6989586621680450727 a6989586621680450744 ~> Bool) -> Type) (a6989586621680452445 :: a6989586621680450744) = (Elem_6989586621680452447Sym1 a6989586621680452445 t6989586621680450727 :: TyFun (t6989586621680450727 a6989586621680450744) Bool -> Type)
type Apply (Lambda_6989586621681208272Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681208267 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681208272Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681208267 :: k1) = (Lambda_6989586621681208272Sym1 p6989586621681208267 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621679948969Scrutinee_6989586621679940372Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679948966 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948969Scrutinee_6989586621679940372Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679948966 :: k1) = (Let6989586621679948969Scrutinee_6989586621679940372Sym1 x6989586621679948966 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621679949046 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621679949046 :: k1) = (Let6989586621679949050Scrutinee_6989586621679940366Sym1 key6989586621679949046 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621679949065Scrutinee_6989586621679940356Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679949062 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949065Scrutinee_6989586621679940356Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679949062 :: k1) = (Let6989586621679949065Scrutinee_6989586621679940356Sym1 n6989586621679949062 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621679949079Scrutinee_6989586621679940354Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679949076 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949079Scrutinee_6989586621679940354Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621679949076 :: k1) = (Let6989586621679949079Scrutinee_6989586621679940354Sym1 n6989586621679949076 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621679949651 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621679949651 :: k1) = (Let6989586621679949661Scrutinee_6989586621679940374Sym1 l6989586621679949651 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621680451603Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216804515986989586621680451602 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680451603Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216804515986989586621680451602 :: k1) = (Lambda_6989586621680451603Sym1 a_69895866216804515986989586621680451602 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym1 p6989586621679950274 :: TyFun k1 (TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621679950278 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym1 p6989586621679950274 :: TyFun k1 (TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621679950278 :: k1) = (Let6989586621679950280Scrutinee_6989586621679940348Sym2 p6989586621679950274 x6989586621679950278 :: TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type)
type Apply (Lambda_6989586621681208272Sym1 p6989586621681208267 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681208271 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681208272Sym1 p6989586621681208267 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681208271 :: k1) = (Lambda_6989586621681208272Sym2 p6989586621681208267 x6989586621681208271 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type)
type Apply (Let6989586621679948969Scrutinee_6989586621679940372Sym1 x6989586621679948966 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (xs6989586621679948967 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948969Scrutinee_6989586621679940372Sym1 x6989586621679948966 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (xs6989586621679948967 :: k1) = (Let6989586621679948969Scrutinee_6989586621679940372Sym2 x6989586621679948966 xs6989586621679948967 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym1 key6989586621679949046 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679949047 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym1 key6989586621679949046 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621679949047 :: k1) = (Let6989586621679949050Scrutinee_6989586621679940366Sym2 key6989586621679949046 x6989586621679949047 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type)
type Apply (Let6989586621679949065Scrutinee_6989586621679940356Sym1 n6989586621679949062 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621679949063 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949065Scrutinee_6989586621679940356Sym1 n6989586621679949062 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621679949063 :: k1) = (Let6989586621679949065Scrutinee_6989586621679940356Sym2 n6989586621679949062 x6989586621679949063 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621679949079Scrutinee_6989586621679940354Sym1 n6989586621679949076 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621679949077 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949079Scrutinee_6989586621679940354Sym1 n6989586621679949076 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621679949077 :: k1) = (Let6989586621679949079Scrutinee_6989586621679940354Sym2 n6989586621679949076 x6989586621679949077 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym1 eq6989586621679948941 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621679948942 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym1 eq6989586621679948941 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621679948942 :: k1) = (Let6989586621679948953Scrutinee_6989586621679940376Sym2 eq6989586621679948941 l6989586621679948942 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym1 l6989586621679949651 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621679949658 :: k1)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym1 l6989586621679949651 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621679949658 :: k1) = (Let6989586621679949661Scrutinee_6989586621679940374Sym2 l6989586621679949651 x6989586621679949658 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type)
type Apply (Lambda_6989586621680451603Sym1 a_69895866216804515986989586621680451602 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (t6989586621680451610 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680451603Sym1 a_69895866216804515986989586621680451602 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (t6989586621680451610 :: k1) = (Lambda_6989586621680451603Sym2 a_69895866216804515986989586621680451602 t6989586621680451610 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621679740133 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621679740133 :: k1) = (Let6989586621679740143Scrutinee_6989586621679739909Sym1 x06989586621679740133 :: TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621681208272Sym2 x6989586621681208271 p6989586621681208267 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216812082656989586621681208268 :: k3)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681208272Sym2 x6989586621681208271 p6989586621681208267 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216812082656989586621681208268 :: k3) = Lambda_6989586621681208272Sym3 x6989586621681208271 p6989586621681208267 a_69895866216812082656989586621681208268
type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym2 x6989586621679949658 l6989586621679949651 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621679949659 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949661Scrutinee_6989586621679940374Sym2 x6989586621679949658 l6989586621679949651 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621679949659 :: k3) = Let6989586621679949661Scrutinee_6989586621679940374Sym3 x6989586621679949658 l6989586621679949651 xs6989586621679949659
type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym2 x6989586621679949047 key6989586621679949046 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621679949048 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949050Scrutinee_6989586621679940366Sym2 x6989586621679949047 key6989586621679949046 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621679949048 :: k2) = (Let6989586621679949050Scrutinee_6989586621679940366Sym3 x6989586621679949047 key6989586621679949046 y6989586621679949048 :: TyFun k3 Bool -> Type)
type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym2 l6989586621679948942 eq6989586621679948941 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621679948950 :: k2)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym2 l6989586621679948942 eq6989586621679948941 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621679948950 :: k2) = (Let6989586621679948953Scrutinee_6989586621679940376Sym3 l6989586621679948942 eq6989586621679948941 y6989586621679948950 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type)
type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679740004 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679740004 :: k1) = (Let6989586621679740009Scrutinee_6989586621679739933Sym1 x16989586621679740004 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679740061 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621679740061 :: k1) = (Let6989586621679740066Scrutinee_6989586621679739923Sym1 x16989586621679740061 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym1 x06989586621679740133 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679740134 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym1 x06989586621679740133 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679740134 :: k1) = (Let6989586621679740143Scrutinee_6989586621679739909Sym2 x06989586621679740133 y6989586621679740134 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621681208272Sym3 a_69895866216812082656989586621681208268 x6989586621681208271 p6989586621681208267 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681208278 :: Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681208272Sym3 a_69895866216812082656989586621681208268 x6989586621681208271 p6989586621681208267 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681208278 :: Bool) = Lambda_6989586621681208272 a_69895866216812082656989586621681208268 x6989586621681208271 p6989586621681208267 t6989586621681208278
type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym3 y6989586621679948950 l6989586621679948942 eq6989586621679948941 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621679948951 :: k3)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym3 y6989586621679948950 l6989586621679948942 eq6989586621679948941 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621679948951 :: k3) = Let6989586621679948953Scrutinee_6989586621679940376Sym4 y6989586621679948950 l6989586621679948942 eq6989586621679948941 ys6989586621679948951
type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym1 x16989586621679740004 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679740005 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym1 x16989586621679740004 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679740005 :: k1) = (Let6989586621679740009Scrutinee_6989586621679739933Sym2 x16989586621679740004 x26989586621679740005 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym1 x16989586621679740061 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679740062 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym1 x16989586621679740061 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621679740062 :: k1) = (Let6989586621679740066Scrutinee_6989586621679739923Sym2 x16989586621679740061 x26989586621679740062 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym2 y6989586621679740134 x06989586621679740133 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621679740142 :: k1)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym2 y6989586621679740134 x06989586621679740133 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621679740142 :: k1) = (Let6989586621679740143Scrutinee_6989586621679739909Sym3 y6989586621679740134 x06989586621679740133 x6989586621679740142 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type)
type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym2 x26989586621679740005 x16989586621679740004 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679740006 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym2 x26989586621679740005 x16989586621679740004 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679740006 :: k2) = (Let6989586621679740009Scrutinee_6989586621679739933Sym3 x26989586621679740005 x16989586621679740004 y6989586621679740006 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym2 x26989586621679740062 x16989586621679740061 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679740063 :: k2)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym2 x26989586621679740062 x16989586621679740061 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621679740063 :: k2) = (Let6989586621679740066Scrutinee_6989586621679739923Sym3 x26989586621679740062 x16989586621679740061 y6989586621679740063 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type)
type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym3 x6989586621679740142 y6989586621679740134 x06989586621679740133 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216797399056989586621679740129 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740143Scrutinee_6989586621679739909Sym3 x6989586621679740142 y6989586621679740134 x06989586621679740133 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216797399056989586621679740129 :: k3) = (Let6989586621679740143Scrutinee_6989586621679739909Sym4 x6989586621679740142 y6989586621679740134 x06989586621679740133 arg_69895866216797399056989586621679740129 :: TyFun k4 Bool -> Type)
type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym3 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216797399276989586621679739999 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym3 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216797399276989586621679739999 :: k3) = (Let6989586621679740009Scrutinee_6989586621679739933Sym4 y6989586621679740006 x26989586621679740005 x16989586621679740004 arg_69895866216797399276989586621679739999 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym3 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216797399176989586621679740056 :: k3)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym3 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216797399176989586621679740056 :: k3) = (Let6989586621679740066Scrutinee_6989586621679739923Sym4 y6989586621679740063 x26989586621679740062 x16989586621679740061 arg_69895866216797399176989586621679740056 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type)
type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym4 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216797399296989586621679740000 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740009Scrutinee_6989586621679739933Sym4 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216797399296989586621679740000 :: k4) = (Let6989586621679740009Scrutinee_6989586621679739933Sym5 arg_69895866216797399276989586621679739999 y6989586621679740006 x26989586621679740005 x16989586621679740004 arg_69895866216797399296989586621679740000 :: TyFun k5 Bool -> Type)
type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym4 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216797399196989586621679740057 :: k4)
Instance details Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621679740066Scrutinee_6989586621679739923Sym4 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216797399196989586621679740057 :: k4) = (Let6989586621679740066Scrutinee_6989586621679739923Sym5 arg_69895866216797399176989586621679740056 y6989586621679740063 x26989586621679740062 x16989586621679740061 arg_69895866216797399196989586621679740057 :: TyFun k5 Bool -> Type)
type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680387274] ([a6989586621680387274] ~> Bool) -> Type) (a6989586621680388326 :: [a6989586621680387274])
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680387274] ([a6989586621680387274] ~> Bool) -> Type) (a6989586621680388326 :: [a6989586621680387274]) = ListisPrefixOfSym1 a6989586621680388326
type Apply (IsPrefixOfSym0 :: TyFun [a6989586621679939755] ([a6989586621679939755] ~> Bool) -> Type) (a6989586621679949669 :: [a6989586621679939755])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a6989586621679939755] ([a6989586621679939755] ~> Bool) -> Type) (a6989586621679949669 :: [a6989586621679939755]) = IsPrefixOfSym1 a6989586621679949669
type Apply (IsInfixOfSym0 :: TyFun [a6989586621679939753] ([a6989586621679939753] ~> Bool) -> Type) (a6989586621679949907 :: [a6989586621679939753])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a6989586621679939753] ([a6989586621679939753] ~> Bool) -> Type) (a6989586621679949907 :: [a6989586621679939753]) = IsInfixOfSym1 a6989586621679949907
type Apply (IsSuffixOfSym0 :: TyFun [a6989586621679939754] ([a6989586621679939754] ~> Bool) -> Type) (a6989586621679950260 :: [a6989586621679939754])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a6989586621679939754] ([a6989586621679939754] ~> Bool) -> Type) (a6989586621679950260 :: [a6989586621679939754]) = IsSuffixOfSym1 a6989586621679950260
type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym2 x6989586621679950278 p6989586621679950274 :: TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) (xs6989586621679950279 :: [a6989586621679939789])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym2 x6989586621679950278 p6989586621679950274 :: TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) (xs6989586621679950279 :: [a6989586621679939789]) = (Let6989586621679950280Scrutinee_6989586621679940348Sym3 x6989586621679950278 p6989586621679950274 xs6989586621679950279 :: TyFun k Bool -> Type)
type Apply (Let6989586621679949110ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949097 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949110ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949097 :: k ~> Bool) = Let6989586621679949110ZsSym1 p6989586621679949097
type Apply (Let6989586621679949110YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949097 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949110YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949097 :: k ~> Bool) = Let6989586621679949110YsSym1 p6989586621679949097
type Apply (Let6989586621679949110X_6989586621679949111Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679949097 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949110X_6989586621679949111Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679949097 :: k ~> Bool) = Let6989586621679949110X_6989586621679949111Sym1 p6989586621679949097
type Apply (Let6989586621679949153ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949140 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949153ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949140 :: k ~> Bool) = Let6989586621679949153ZsSym1 p6989586621679949140
type Apply (Let6989586621679949153YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949140 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949153YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621679949140 :: k ~> Bool) = Let6989586621679949153YsSym1 p6989586621679949140
type Apply (Let6989586621679949153X_6989586621679949154Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679949140 :: k ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949153X_6989586621679949154Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621679949140 :: k ~> Bool) = Let6989586621679949153X_6989586621679949154Sym1 p6989586621679949140
type Apply (ListnubBySym0 :: TyFun (a6989586621680387268 ~> (a6989586621680387268 ~> Bool)) ([a6989586621680387268] ~> [a6989586621680387268]) -> Type) (a6989586621680388291 :: a6989586621680387268 ~> (a6989586621680387268 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListnubBySym0 :: TyFun (a6989586621680387268 ~> (a6989586621680387268 ~> Bool)) ([a6989586621680387268] ~> [a6989586621680387268]) -> Type) (a6989586621680388291 :: a6989586621680387268 ~> (a6989586621680387268 ~> Bool)) = ListnubBySym1 a6989586621680388291
type Apply (ListpartitionSym0 :: TyFun (a6989586621680387276 ~> Bool) ([a6989586621680387276] ~> ([a6989586621680387276], [a6989586621680387276])) -> Type) (a6989586621680388346 :: a6989586621680387276 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListpartitionSym0 :: TyFun (a6989586621680387276 ~> Bool) ([a6989586621680387276] ~> ([a6989586621680387276], [a6989586621680387276])) -> Type) (a6989586621680388346 :: a6989586621680387276 ~> Bool) = ListpartitionSym1 a6989586621680388346
type Apply (ListfilterSym0 :: TyFun (a6989586621680387277 ~> Bool) ([a6989586621680387277] ~> [a6989586621680387277]) -> Type) (a6989586621680388356 :: a6989586621680387277 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListfilterSym0 :: TyFun (a6989586621680387277 ~> Bool) ([a6989586621680387277] ~> [a6989586621680387277]) -> Type) (a6989586621680388356 :: a6989586621680387277 ~> Bool) = ListfilterSym1 a6989586621680388356
type Apply (ListspanSym0 :: TyFun (a6989586621680387278 ~> Bool) ([a6989586621680387278] ~> ([a6989586621680387278], [a6989586621680387278])) -> Type) (a6989586621680388366 :: a6989586621680387278 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListspanSym0 :: TyFun (a6989586621680387278 ~> Bool) ([a6989586621680387278] ~> ([a6989586621680387278], [a6989586621680387278])) -> Type) (a6989586621680388366 :: a6989586621680387278 ~> Bool) = ListspanSym1 a6989586621680388366
type Apply (ListdropWhileSym0 :: TyFun (a6989586621680387279 ~> Bool) ([a6989586621680387279] ~> [a6989586621680387279]) -> Type) (a6989586621680388376 :: a6989586621680387279 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListdropWhileSym0 :: TyFun (a6989586621680387279 ~> Bool) ([a6989586621680387279] ~> [a6989586621680387279]) -> Type) (a6989586621680388376 :: a6989586621680387279 ~> Bool) = ListdropWhileSym1 a6989586621680388376
type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680387280 ~> Bool) ([a6989586621680387280] ~> [a6989586621680387280]) -> Type) (a6989586621680388386 :: a6989586621680387280 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal.Disambiguation type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680387280 ~> Bool) ([a6989586621680387280] ~> [a6989586621680387280]) -> Type) (a6989586621680388386 :: a6989586621680387280 ~> Bool) = ListtakeWhileSym1 a6989586621680388386
type Apply (NubBySym0 :: TyFun (a6989586621679939670 ~> (a6989586621679939670 ~> Bool)) ([a6989586621679939670] ~> [a6989586621679939670]) -> Type) (a6989586621679948937 :: a6989586621679939670 ~> (a6989586621679939670 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (NubBySym0 :: TyFun (a6989586621679939670 ~> (a6989586621679939670 ~> Bool)) ([a6989586621679939670] ~> [a6989586621679939670]) -> Type) (a6989586621679948937 :: a6989586621679939670 ~> (a6989586621679939670 ~> Bool)) = NubBySym1 a6989586621679948937
type Apply (PartitionSym0 :: TyFun (a6989586621679939679 ~> Bool) ([a6989586621679939679] ~> ([a6989586621679939679], [a6989586621679939679])) -> Type) (a6989586621679949035 :: a6989586621679939679 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a6989586621679939679 ~> Bool) ([a6989586621679939679] ~> ([a6989586621679939679], [a6989586621679939679])) -> Type) (a6989586621679949035 :: a6989586621679939679 ~> Bool) = PartitionSym1 a6989586621679949035
type Apply (BreakSym0 :: TyFun (a6989586621679939691 ~> Bool) ([a6989586621679939691] ~> ([a6989586621679939691], [a6989586621679939691])) -> Type) (a6989586621679949092 :: a6989586621679939691 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (BreakSym0 :: TyFun (a6989586621679939691 ~> Bool) ([a6989586621679939691] ~> ([a6989586621679939691], [a6989586621679939691])) -> Type) (a6989586621679949092 :: a6989586621679939691 ~> Bool) = BreakSym1 a6989586621679949092
type Apply (SpanSym0 :: TyFun (a6989586621679939692 ~> Bool) ([a6989586621679939692] ~> ([a6989586621679939692], [a6989586621679939692])) -> Type) (a6989586621679949135 :: a6989586621679939692 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SpanSym0 :: TyFun (a6989586621679939692 ~> Bool) ([a6989586621679939692] ~> ([a6989586621679939692], [a6989586621679939692])) -> Type) (a6989586621679949135 :: a6989586621679939692 ~> Bool) = SpanSym1 a6989586621679949135
type Apply (GroupBySym0 :: TyFun (a6989586621679939682 ~> (a6989586621679939682 ~> Bool)) ([a6989586621679939682] ~> [[a6989586621679939682]]) -> Type) (a6989586621679949178 :: a6989586621679939682 ~> (a6989586621679939682 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (GroupBySym0 :: TyFun (a6989586621679939682 ~> (a6989586621679939682 ~> Bool)) ([a6989586621679939682] ~> [[a6989586621679939682]]) -> Type) (a6989586621679949178 :: a6989586621679939682 ~> (a6989586621679939682 ~> Bool)) = GroupBySym1 a6989586621679949178
type Apply (DropWhileSym0 :: TyFun (a6989586621679939694 ~> Bool) ([a6989586621679939694] ~> [a6989586621679939694]) -> Type) (a6989586621679949212 :: a6989586621679939694 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a6989586621679939694 ~> Bool) ([a6989586621679939694] ~> [a6989586621679939694]) -> Type) (a6989586621679949212 :: a6989586621679939694 ~> Bool) = DropWhileSym1 a6989586621679949212
type Apply (TakeWhileSym0 :: TyFun (a6989586621679939695 ~> Bool) ([a6989586621679939695] ~> [a6989586621679939695]) -> Type) (a6989586621679949230 :: a6989586621679939695 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a6989586621679939695 ~> Bool) ([a6989586621679939695] ~> [a6989586621679939695]) -> Type) (a6989586621679949230 :: a6989586621679939695 ~> Bool) = TakeWhileSym1 a6989586621679949230
type Apply (FilterSym0 :: TyFun (a6989586621679939703 ~> Bool) ([a6989586621679939703] ~> [a6989586621679939703]) -> Type) (a6989586621679949244 :: a6989586621679939703 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a6989586621679939703 ~> Bool) ([a6989586621679939703] ~> [a6989586621679939703]) -> Type) (a6989586621679949244 :: a6989586621679939703 ~> Bool) = FilterSym1 a6989586621679949244
type Apply (FindSym0 :: TyFun (a6989586621679939702 ~> Bool) ([a6989586621679939702] ~> Maybe a6989586621679939702) -> Type) (a6989586621679949259 :: a6989586621679939702 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a6989586621679939702 ~> Bool) ([a6989586621679939702] ~> Maybe a6989586621679939702) -> Type) (a6989586621679949259 :: a6989586621679939702 ~> Bool) = FindSym1 a6989586621679949259
type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621679939708 ~> (a6989586621679939708 ~> Bool)) ([a6989586621679939708] ~> ([a6989586621679939708] ~> [a6989586621679939708])) -> Type) (a6989586621679949328 :: a6989586621679939708 ~> (a6989586621679939708 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621679939708 ~> (a6989586621679939708 ~> Bool)) ([a6989586621679939708] ~> ([a6989586621679939708] ~> [a6989586621679939708])) -> Type) (a6989586621679949328 :: a6989586621679939708 ~> (a6989586621679939708 ~> Bool)) = DeleteFirstsBySym1 a6989586621679949328
type Apply (UnionBySym0 :: TyFun (a6989586621679939668 ~> (a6989586621679939668 ~> Bool)) ([a6989586621679939668] ~> ([a6989586621679939668] ~> [a6989586621679939668])) -> Type) (a6989586621679949341 :: a6989586621679939668 ~> (a6989586621679939668 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnionBySym0 :: TyFun (a6989586621679939668 ~> (a6989586621679939668 ~> Bool)) ([a6989586621679939668] ~> ([a6989586621679939668] ~> [a6989586621679939668])) -> Type) (a6989586621679949341 :: a6989586621679939668 ~> (a6989586621679939668 ~> Bool)) = UnionBySym1 a6989586621679949341
type Apply (FindIndicesSym0 :: TyFun (a6989586621679939698 ~> Bool) ([a6989586621679939698] ~> [Nat]) -> Type) (a6989586621679949585 :: a6989586621679939698 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndicesSym0 :: TyFun (a6989586621679939698 ~> Bool) ([a6989586621679939698] ~> [Nat]) -> Type) (a6989586621679949585 :: a6989586621679939698 ~> Bool) = FindIndicesSym1 a6989586621679949585
type Apply (FindIndexSym0 :: TyFun (a6989586621679939699 ~> Bool) ([a6989586621679939699] ~> Maybe Nat) -> Type) (a6989586621679949619 :: a6989586621679939699 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a6989586621679939699 ~> Bool) ([a6989586621679939699] ~> Maybe Nat) -> Type) (a6989586621679949619 :: a6989586621679939699 ~> Bool) = FindIndexSym1 a6989586621679949619
type Apply (AnySym0 :: TyFun (a6989586621679939772 ~> Bool) ([a6989586621679939772] ~> Bool) -> Type) (a6989586621679949900 :: a6989586621679939772 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AnySym0 :: TyFun (a6989586621679939772 ~> Bool) ([a6989586621679939772] ~> Bool) -> Type) (a6989586621679949900 :: a6989586621679939772 ~> Bool) = AnySym1 a6989586621679949900
type Apply (IntersectBySym0 :: TyFun (a6989586621679939696 ~> (a6989586621679939696 ~> Bool)) ([a6989586621679939696] ~> ([a6989586621679939696] ~> [a6989586621679939696])) -> Type) (a6989586621679949913 :: a6989586621679939696 ~> (a6989586621679939696 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (IntersectBySym0 :: TyFun (a6989586621679939696 ~> (a6989586621679939696 ~> Bool)) ([a6989586621679939696] ~> ([a6989586621679939696] ~> [a6989586621679939696])) -> Type) (a6989586621679949913 :: a6989586621679939696 ~> (a6989586621679939696 ~> Bool)) = IntersectBySym1 a6989586621679949913
type Apply (AllSym0 :: TyFun (a6989586621679939773 ~> Bool) ([a6989586621679939773] ~> Bool) -> Type) (a6989586621679949955 :: a6989586621679939773 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (AllSym0 :: TyFun (a6989586621679939773 ~> Bool) ([a6989586621679939773] ~> Bool) -> Type) (a6989586621679949955 :: a6989586621679939773 ~> Bool) = AllSym1 a6989586621679949955
type Apply (DropWhileEndSym0 :: TyFun (a6989586621679939693 ~> Bool) ([a6989586621679939693] ~> [a6989586621679939693]) -> Type) (a6989586621679950268 :: a6989586621679939693 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a6989586621679939693 ~> Bool) ([a6989586621679939693] ~> [a6989586621679939693]) -> Type) (a6989586621679950268 :: a6989586621679939693 ~> Bool) = DropWhileEndSym1 a6989586621679950268
type Apply (Elem_bySym0 :: TyFun (a6989586621679939669 ~> (a6989586621679939669 ~> Bool)) (a6989586621679939669 ~> ([a6989586621679939669] ~> Bool)) -> Type) (a6989586621679948927 :: a6989586621679939669 ~> (a6989586621679939669 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Elem_bySym0 :: TyFun (a6989586621679939669 ~> (a6989586621679939669 ~> Bool)) (a6989586621679939669 ~> ([a6989586621679939669] ~> Bool)) -> Type) (a6989586621679948927 :: a6989586621679939669 ~> (a6989586621679939669 ~> Bool)) = Elem_bySym1 a6989586621679948927
type Apply (SelectSym0 :: TyFun (a6989586621679939678 ~> Bool) (a6989586621679939678 ~> (([a6989586621679939678], [a6989586621679939678]) ~> ([a6989586621679939678], [a6989586621679939678]))) -> Type) (a6989586621679949017 :: a6989586621679939678 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (SelectSym0 :: TyFun (a6989586621679939678 ~> Bool) (a6989586621679939678 ~> (([a6989586621679939678], [a6989586621679939678]) ~> ([a6989586621679939678], [a6989586621679939678]))) -> Type) (a6989586621679949017 :: a6989586621679939678 ~> Bool) = SelectSym1 a6989586621679949017
type Apply (DeleteBySym0 :: TyFun (a6989586621679939709 ~> (a6989586621679939709 ~> Bool)) (a6989586621679939709 ~> ([a6989586621679939709] ~> [a6989586621679939709])) -> Type) (a6989586621679949310 :: a6989586621679939709 ~> (a6989586621679939709 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteBySym0 :: TyFun (a6989586621679939709 ~> (a6989586621679939709 ~> Bool)) (a6989586621679939709 ~> ([a6989586621679939709] ~> [a6989586621679939709])) -> Type) (a6989586621679949310 :: a6989586621679939709 ~> (a6989586621679939709 ~> Bool)) = DeleteBySym1 a6989586621679949310
type Apply (UntilSym0 :: TyFun (a6989586621679520379 ~> Bool) ((a6989586621679520379 ~> a6989586621679520379) ~> (a6989586621679520379 ~> a6989586621679520379)) -> Type) (a6989586621679520504 :: a6989586621679520379 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (UntilSym0 :: TyFun (a6989586621679520379 ~> Bool) ((a6989586621679520379 ~> a6989586621679520379) ~> (a6989586621679520379 ~> a6989586621679520379)) -> Type) (a6989586621679520504 :: a6989586621679520379 ~> Bool) = UntilSym1 a6989586621679520504
type Apply (Let6989586621679948943NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621679948941 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948943NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621679948941 :: k1 ~> (k1 ~> Bool)) = (Let6989586621679948943NubBy'Sym1 eq6989586621679948941 :: TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type)
type Apply (Let6989586621679949185ZsSym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] [a6989586621679939692] -> Type) -> Type) -> Type) (eq6989586621679949182 :: k1 ~> (a6989586621679939692 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949185ZsSym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] [a6989586621679939692] -> Type) -> Type) -> Type) (eq6989586621679949182 :: k1 ~> (a6989586621679939692 ~> Bool)) = Let6989586621679949185ZsSym1 eq6989586621679949182
type Apply (Let6989586621679949185YsSym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] [a6989586621679939692] -> Type) -> Type) -> Type) (eq6989586621679949182 :: k1 ~> (a6989586621679939692 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949185YsSym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] [a6989586621679939692] -> Type) -> Type) -> Type) (eq6989586621679949182 :: k1 ~> (a6989586621679939692 ~> Bool)) = Let6989586621679949185YsSym1 eq6989586621679949182
type Apply (Let6989586621679949185X_6989586621679949186Sym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] ([a6989586621679939692], [a6989586621679939692]) -> Type) -> Type) -> Type) (eq6989586621679949182 :: k1 ~> (a6989586621679939692 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679949185X_6989586621679949186Sym0 :: TyFun (k1 ~> (a6989586621679939692 ~> Bool)) (TyFun k1 (TyFun [a6989586621679939692] ([a6989586621679939692], [a6989586621679939692]) -> Type) -> Type) -> Type) (eq6989586621679949182 :: k1 ~> (a6989586621679939692 ~> Bool)) = Let6989586621679949185X_6989586621679949186Sym1 eq6989586621679949182
type Apply (Lambda_6989586621679950276Sym0 :: TyFun (a6989586621679939789 ~> Bool) (TyFun k (TyFun a6989586621679939789 (TyFun [a6989586621679939789] [a6989586621679939789] -> Type) -> Type) -> Type) -> Type) (p6989586621679950274 :: a6989586621679939789 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621679950276Sym0 :: TyFun (a6989586621679939789 ~> Bool) (TyFun k (TyFun a6989586621679939789 (TyFun [a6989586621679939789] [a6989586621679939789] -> Type) -> Type) -> Type) -> Type) (p6989586621679950274 :: a6989586621679939789 ~> Bool) = (Lambda_6989586621679950276Sym1 p6989586621679950274 :: TyFun k (TyFun a6989586621679939789 (TyFun [a6989586621679939789] [a6989586621679939789] -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621680451100Sym0 :: TyFun (a6989586621679072651 ~> Bool) (TyFun k (TyFun a6989586621679072651 (First a6989586621679072651) -> Type) -> Type) -> Type) (p6989586621680451097 :: a6989586621679072651 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680451100Sym0 :: TyFun (a6989586621679072651 ~> Bool) (TyFun k (TyFun a6989586621679072651 (First a6989586621679072651) -> Type) -> Type) -> Type) (p6989586621680451097 :: a6989586621679072651 ~> Bool) = (Lambda_6989586621680451100Sym1 p6989586621680451097 :: TyFun k (TyFun a6989586621679072651 (First a6989586621679072651) -> Type) -> Type)
type Apply (Let6989586621680451197Scrutinee_6989586621680450978Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) Any -> Type) -> Type) (p6989586621680451195 :: a6989586621680450730 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451197Scrutinee_6989586621680450978Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) Any -> Type) -> Type) (p6989586621680451195 :: a6989586621680450730 ~> Bool) = (Let6989586621680451197Scrutinee_6989586621680450978Sym1 p6989586621680451195 :: TyFun (t6989586621680450727 a6989586621680450730) Any -> Type)
type Apply (Let6989586621680451184Scrutinee_6989586621680450980Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) All -> Type) -> Type) (p6989586621680451182 :: a6989586621680450730 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451184Scrutinee_6989586621680450980Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) All -> Type) -> Type) (p6989586621680451182 :: a6989586621680450730 ~> Bool) = (Let6989586621680451184Scrutinee_6989586621680450980Sym1 p6989586621680451182 :: TyFun (t6989586621680450727 a6989586621680450730) All -> Type)
type Apply (Let6989586621680451099Scrutinee_6989586621680450986Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) (First a6989586621680450730) -> Type) -> Type) (p6989586621680451097 :: a6989586621680450730 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451099Scrutinee_6989586621680450986Sym0 :: TyFun (a6989586621680450730 ~> Bool) (TyFun (t6989586621680450727 a6989586621680450730) (First a6989586621680450730) -> Type) -> Type) (p6989586621680451097 :: a6989586621680450730 ~> Bool) = (Let6989586621680451099Scrutinee_6989586621680450986Sym1 p6989586621680451097 :: TyFun (t6989586621680450727 a6989586621680450730) (First a6989586621680450730) -> Type)
type Apply (Let6989586621679520515GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679520512 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Base type Apply (Let6989586621679520515GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679520512 :: k1 ~> Bool) = (Let6989586621679520515GoSym1 p6989586621679520512 :: TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type)
type Apply (FilterMSym0 :: TyFun (a6989586621681207798 ~> m6989586621681207797 Bool) ([a6989586621681207798] ~> m6989586621681207797 [a6989586621681207798]) -> Type) (a6989586621681208261 :: a6989586621681207798 ~> m6989586621681207797 Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a6989586621681207798 ~> m6989586621681207797 Bool) ([a6989586621681207798] ~> m6989586621681207797 [a6989586621681207798]) -> Type) (a6989586621681208261 :: a6989586621681207798 ~> m6989586621681207797 Bool) = FilterMSym1 a6989586621681208261
type Apply (MfilterSym0 :: TyFun (a6989586621681207760 ~> Bool) (m6989586621681207759 a6989586621681207760 ~> m6989586621681207759 a6989586621681207760) -> Type) (a6989586621681208095 :: a6989586621681207760 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (MfilterSym0 :: TyFun (a6989586621681207760 ~> Bool) (m6989586621681207759 a6989586621681207760 ~> m6989586621681207759 a6989586621681207760) -> Type) (a6989586621681208095 :: a6989586621681207760 ~> Bool) = (MfilterSym1 a6989586621681208095 m6989586621681207759 :: TyFun (m6989586621681207759 a6989586621681207760) (m6989586621681207759 a6989586621681207760) -> Type)
type Apply (AnySym0 :: TyFun (a6989586621680450646 ~> Bool) (t6989586621680450645 a6989586621680450646 ~> Bool) -> Type) (a6989586621680451191 :: a6989586621680450646 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AnySym0 :: TyFun (a6989586621680450646 ~> Bool) (t6989586621680450645 a6989586621680450646 ~> Bool) -> Type) (a6989586621680451191 :: a6989586621680450646 ~> Bool) = (AnySym1 a6989586621680451191 t6989586621680450645 :: TyFun (t6989586621680450645 a6989586621680450646) Bool -> Type)
type Apply (AllSym0 :: TyFun (a6989586621680450644 ~> Bool) (t6989586621680450643 a6989586621680450644 ~> Bool) -> Type) (a6989586621680451178 :: a6989586621680450644 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (AllSym0 :: TyFun (a6989586621680450644 ~> Bool) (t6989586621680450643 a6989586621680450644 ~> Bool) -> Type) (a6989586621680451178 :: a6989586621680450644 ~> Bool) = (AllSym1 a6989586621680451178 t6989586621680450643 :: TyFun (t6989586621680450643 a6989586621680450644) Bool -> Type)
type Apply (FindSym0 :: TyFun (a6989586621680450636 ~> Bool) (t6989586621680450635 a6989586621680450636 ~> Maybe a6989586621680450636) -> Type) (a6989586621680451093 :: a6989586621680450636 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680450636 ~> Bool) (t6989586621680450635 a6989586621680450636 ~> Maybe a6989586621680450636) -> Type) (a6989586621680451093 :: a6989586621680450636 ~> Bool) = (FindSym1 a6989586621680451093 t6989586621680450635 :: TyFun (t6989586621680450635 a6989586621680450636) (Maybe a6989586621680450636) -> Type)
type Apply (TFHelper_6989586621680882853Sym0 :: TyFun (Arg a6989586621680881636 b6989586621680881637) (Arg a6989586621680881636 b6989586621680881637 ~> Bool) -> Type) (a6989586621680882851 :: Arg a6989586621680881636 b6989586621680881637)
Instance details Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621680882853Sym0 :: TyFun (Arg a6989586621680881636 b6989586621680881637) (Arg a6989586621680881636 b6989586621680881637 ~> Bool) -> Type) (a6989586621680882851 :: Arg a6989586621680881636 b6989586621680881637) = TFHelper_6989586621680882853Sym1 a6989586621680882851
type Apply (Lambda_6989586621681208101Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679544699 k1) -> Type) -> Type) -> Type) (p6989586621681208099 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681208101Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679544699 k1) -> Type) -> Type) -> Type) (p6989586621681208099 :: k1 ~> Bool) = (Lambda_6989586621681208101Sym1 p6989586621681208099 :: TyFun k (TyFun k1 (m6989586621679544699 k1) -> Type) -> Type)
type Apply (Lambda_6989586621681208269Sym0 :: TyFun (k2 ~> f6989586621679544675 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679544675 [k2]) (f6989586621679544675 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681208267 :: k2 ~> f6989586621679544675 Bool)
Instance details Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681208269Sym0 :: TyFun (k2 ~> f6989586621679544675 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679544675 [k2]) (f6989586621679544675 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681208267 :: k2 ~> f6989586621679544675 Bool) = (Lambda_6989586621681208269Sym1 p6989586621681208267 :: TyFun k3 (TyFun k2 (TyFun (f6989586621679544675 [k2]) (f6989586621679544675 [k2]) -> Type) -> Type) -> Type)
type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679948941 :: k1 ~> (k1 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679948953Scrutinee_6989586621679940376Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679948941 :: k1 ~> (k1 ~> Bool)) = (Let6989586621679948953Scrutinee_6989586621679940376Sym1 eq6989586621679948941 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type)
type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621679950274 :: k1 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621679950280Scrutinee_6989586621679940348Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621679950274 :: k1 ~> Bool) = (Let6989586621679950280Scrutinee_6989586621679940348Sym1 p6989586621679950274 :: TyFun k1 (TyFun [a6989586621679939789] (TyFun k Bool -> Type) -> Type) -> Type)
type Apply (Lambda_6989586621679949935Sym0 :: TyFun (b6989586621679544703 ~> (a6989586621679939772 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621679939772 (TyFun [a6989586621679939772] (TyFun b6989586621679544703 (m6989586621679544699 b6989586621679544703) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679949919 :: b6989586621679544703 ~> (a6989586621679939772 ~> Bool))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621679949935Sym0 :: TyFun (b6989586621679544703 ~> (a6989586621679939772 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621679939772 (TyFun [a6989586621679939772] (TyFun b6989586621679544703 (m6989586621679544699 b6989586621679544703) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621679949919 :: b6989586621679544703 ~> (a6989586621679939772 ~> Bool)) = (Lambda_6989586621679949935Sym1 eq6989586621679949919 :: TyFun k1 (TyFun k2 (TyFun a6989586621679939772 (TyFun [a6989586621679939772] (TyFun b6989586621679544703 (m6989586621679544699 b6989586621679544703) -> Type) -> Type) -> Type) -> Type) -> Type)

data ByteString #

A space-efficient representation of a Word8 vector, supporting many efficient operations.

A ByteString contains 8-bit bytes, or by using the operations from Data.ByteString.Char8 it can be interpreted as containing 8-bit characters.

Instances

Eq ByteString
Instance details Defined in Data.ByteString.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Data ByteString
Instance details Defined in Data.ByteString.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ByteString -> c ByteString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ByteString # toConstr :: ByteString -> Constr # dataTypeOf :: ByteString -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ByteString) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ByteString) # gmapT :: (forall b. Data b => b -> b) -> ByteString -> ByteString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQ :: (forall d. Data d => d -> u) -> ByteString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ByteString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString #
Ord ByteString
Instance details Defined in Data.ByteString.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString #
Read ByteString
Instance details Defined in Data.ByteString.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] #
Show ByteString
Instance details Defined in Data.ByteString.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
IsString ByteString
Instance details Defined in Data.ByteString.Internal Methods fromString :: String -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
Hashable ByteString
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> ByteString -> Int # hash :: ByteString -> Int #
Chunk ByteString
Instance details Defined in Data.Attoparsec.Internal.Types Associated Types type ChunkElem ByteString :: Type # Methods nullChunk :: ByteString -> Bool # pappendChunk :: State ByteString -> ByteString -> State ByteString # atBufferEnd :: ByteString -> State ByteString -> Pos # bufferElemAt :: ByteString -> Pos -> State ByteString -> Maybe (ChunkElem ByteString, Int) # chunkElemToChar :: ByteString -> ChunkElem ByteString -> Char #
NFData ByteString
Instance details Defined in Data.ByteString.Internal Methods rnf :: ByteString -> () #
FromBuilder ByteString
Instance details Defined in Fmt.Internal.Core Methods fromBuilder :: Builder -> ByteString #
Ixed ByteString
Instance details Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #
Stream ByteString
Instance details Defined in Text.Megaparsec.Stream Associated Types type Token ByteString :: Type # type Tokens ByteString :: Type # Methods tokenToChunk :: Proxy ByteString -> Token ByteString -> Tokens ByteString # tokensToChunk :: Proxy ByteString -> [Token ByteString] -> Tokens ByteString # chunkToTokens :: Proxy ByteString -> Tokens ByteString -> [Token ByteString] # chunkLength :: Proxy ByteString -> Tokens ByteString -> Int # chunkEmpty :: Proxy ByteString -> Tokens ByteString -> Bool # take1_ :: ByteString -> Maybe (Token ByteString, ByteString) # takeN_ :: Int -> ByteString -> Maybe (Tokens ByteString, ByteString) # takeWhile_ :: (Token ByteString -> Bool) -> ByteString -> (Tokens ByteString, ByteString) # showTokens :: Proxy ByteString -> NonEmpty (Token ByteString) -> String # tokensLength :: Proxy ByteString -> NonEmpty (Token ByteString) -> Int # reachOffset :: Int -> PosState ByteString -> (String, PosState ByteString) # reachOffsetNoLine :: Int -> PosState ByteString -> PosState ByteString #
TypeHasDoc ByteString
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy ByteString -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy ByteString -> WithinParens -> Markdown # typeDocDependencies :: Proxy ByteString -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep ByteString # typeDocMichelsonRep :: TypeDocMichelsonRep ByteString #
IsoCValue ByteString
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT ByteString :: CT # Methods toCVal :: ByteString -> CValue (ToCT ByteString) # fromCVal :: CValue (ToCT ByteString) -> ByteString #
IsoValue ByteString
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT ByteString :: T # Methods toVal :: ByteString -> Value (ToT ByteString) # fromVal :: Value (ToT ByteString) -> ByteString #
One ByteString
Instance details Defined in Universum.Container.Class Associated Types type OneItem ByteString :: Type # Methods one :: OneItem ByteString -> ByteString #
Container ByteString
Instance details Defined in Universum.Container.Class Associated Types type Element ByteString :: Type # Methods toList :: ByteString -> [Element ByteString] # null :: ByteString -> Bool # foldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b # foldl :: (b -> Element ByteString -> b) -> b -> ByteString -> b # foldl' :: (b -> Element ByteString -> b) -> b -> ByteString -> b # length :: ByteString -> Int # elem :: Element ByteString -> ByteString -> Bool # maximum :: ByteString -> Element ByteString # minimum :: ByteString -> Element ByteString # foldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # fold :: ByteString -> Element ByteString # foldr' :: (Element ByteString -> b -> b) -> b -> ByteString -> b # foldr1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # foldl1 :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # notElem :: Element ByteString -> ByteString -> Bool # all :: (Element ByteString -> Bool) -> ByteString -> Bool # any :: (Element ByteString -> Bool) -> ByteString -> Bool # and :: ByteString -> Bool # or :: ByteString -> Bool # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # safeHead :: ByteString -> Maybe (Element ByteString) #
Print ByteString
Instance details Defined in Universum.Print.Internal Methods hPutStr :: Handle -> ByteString -> IO () # hPutStrLn :: Handle -> ByteString -> IO () #
SliceOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
ConcatOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
SizeOpHs ByteString Source #
Instance details Defined in Lorentz.Polymorphic
HasTypeAnn ByteString Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT ByteString) Source #
ConvertUtf8 String ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: String -> ByteString # decodeUtf8 :: ByteString -> String # decodeUtf8Strict :: ByteString -> Either UnicodeException String #
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
ConvertUtf8 Text ByteString
Instance details Defined in Universum.String.Conversion Methods encodeUtf8 :: Text -> ByteString # decodeUtf8 :: ByteString -> Text # decodeUtf8Strict :: ByteString -> Either UnicodeException Text #
Cons ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #
Snoc ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #
type State ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type State ByteString = Buffer
type ChunkElem ByteString
Instance details Defined in Data.Attoparsec.Internal.Types type ChunkElem ByteString = Word8
type Index ByteString
Instance details Defined in Control.Lens.At type Index ByteString = Int
type IxValue ByteString
Instance details Defined in Control.Lens.At type IxValue ByteString = Word8
type Tokens ByteString
Instance details Defined in Text.Megaparsec.Stream type Tokens ByteString = ByteString
type Token ByteString
Instance details Defined in Text.Megaparsec.Stream type Token ByteString = Word8
type ToCT ByteString
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT ByteString = CBytes
type ToT ByteString
Instance details Defined in Michelson.Typed.Haskell.Value type ToT ByteString = Tc (ToCT ByteString)
type OneItem ByteString
Instance details Defined in Universum.Container.Class type OneItem ByteString = Word8
type Element ByteString
Instance details Defined in Universum.Container.Class type Element ByteString = Word8

data Address #

Data type corresponding to address structure in Tezos.

Instances

Eq Address
Instance details Defined in Tezos.Address Methods (==) :: Address -> Address -> Bool # (/=) :: Address -> Address -> Bool #
Ord Address
Instance details Defined in Tezos.Address Methods compare :: Address -> Address -> Ordering # (<) :: Address -> Address -> Bool # (<=) :: Address -> Address -> Bool # (>) :: Address -> Address -> Bool # (>=) :: Address -> Address -> Bool # max :: Address -> Address -> Address # min :: Address -> Address -> Address #
Show Address
Instance details Defined in Tezos.Address Methods showsPrec :: Int -> Address -> ShowS # show :: Address -> String # showList :: [Address] -> ShowS #
Arbitrary Address
Instance details Defined in Tezos.Address Methods arbitrary :: Gen Address # shrink :: Address -> [Address] #
ToJSON Address
Instance details Defined in Tezos.Address Methods toJSON :: Address -> Value # toEncoding :: Address -> Encoding # toJSONList :: [Address] -> Value # toEncodingList :: [Address] -> Encoding #
ToJSONKey Address
Instance details Defined in Tezos.Address Methods toJSONKey :: ToJSONKeyFunction Address # toJSONKeyList :: ToJSONKeyFunction [Address] #
FromJSON Address
Instance details Defined in Tezos.Address Methods parseJSON :: Value -> Parser Address # parseJSONList :: Value -> Parser [Address] #
FromJSONKey Address
Instance details Defined in Tezos.Address Methods fromJSONKey :: FromJSONKeyFunction Address # fromJSONKeyList :: FromJSONKeyFunction [Address] #
Buildable Address
Instance details Defined in Tezos.Address Methods build :: Address -> Builder #
TypeHasDoc Address
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy Address -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Address -> WithinParens -> Markdown # typeDocDependencies :: Proxy Address -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep Address # typeDocMichelsonRep :: TypeDocMichelsonRep Address #
IsoCValue Address	This instance erases reference to contract entrypoint! If this is an issue, use `EpAddress` instead. Applications which use addresses just as participants identifiers should not experience problems with using plain `Address`.
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Address :: CT # Methods toCVal :: Address -> CValue (ToCT Address) # fromCVal :: CValue (ToCT Address) -> Address #
IsoValue Address
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Address :: T # Methods toVal :: Address -> Value (ToT Address) # fromVal :: Value (ToT Address) -> Address #
ToAddress Address Source #
Instance details Defined in Lorentz.Value Methods toAddress :: Address -> Address Source #
HasTypeAnn Address Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT Address) Source #
FromContractRef cp Address Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> Address Source #
ToTAddress cp Address Source #
Instance details Defined in Lorentz.Value Methods toTAddress :: Address -> TAddress cp Source #
CanCastTo Address (TAddress p :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: () Source #
CanCastTo (TAddress p :: Type) Address Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: () Source #
type ToCT Address
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT Address = CAddress
type ToT Address
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Address = Tc (ToCT Address)

data EpAddress #

Address with optional entrypoint name attached to it. TODO: come up with better name?

Constructors

EpAddress
Fields eaAddress :: Address Address itself eaEntryPoint :: EpName Entrypoint name (might be empty)

Instances

Eq EpAddress
Instance details Defined in Michelson.Typed.EntryPoints Methods (==) :: EpAddress -> EpAddress -> Bool # (/=) :: EpAddress -> EpAddress -> Bool #
Ord EpAddress
Instance details Defined in Michelson.Typed.EntryPoints Methods compare :: EpAddress -> EpAddress -> Ordering # (<) :: EpAddress -> EpAddress -> Bool # (<=) :: EpAddress -> EpAddress -> Bool # (>) :: EpAddress -> EpAddress -> Bool # (>=) :: EpAddress -> EpAddress -> Bool # max :: EpAddress -> EpAddress -> EpAddress # min :: EpAddress -> EpAddress -> EpAddress #
Show EpAddress
Instance details Defined in Michelson.Typed.EntryPoints Methods showsPrec :: Int -> EpAddress -> ShowS # show :: EpAddress -> String # showList :: [EpAddress] -> ShowS #
Arbitrary FieldAnn => Arbitrary EpAddress
Instance details Defined in Michelson.Typed.EntryPoints Methods arbitrary :: Gen EpAddress # shrink :: EpAddress -> [EpAddress] #
Buildable EpAddress
Instance details Defined in Michelson.Typed.EntryPoints Methods build :: EpAddress -> Builder #
TypeHasDoc EpAddress
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy EpAddress -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy EpAddress -> WithinParens -> Markdown # typeDocDependencies :: Proxy EpAddress -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep EpAddress # typeDocMichelsonRep :: TypeDocMichelsonRep EpAddress #
IsoCValue EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT EpAddress :: CT # Methods toCVal :: EpAddress -> CValue (ToCT EpAddress) # fromCVal :: CValue (ToCT EpAddress) -> EpAddress #
IsoValue EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT EpAddress :: T # Methods toVal :: EpAddress -> Value (ToT EpAddress) # fromVal :: Value (ToT EpAddress) -> EpAddress #
ToAddress EpAddress Source #
Instance details Defined in Lorentz.Value Methods toAddress :: EpAddress -> Address Source #
HasTypeAnn EpAddress Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT EpAddress) Source #
FromContractRef cp EpAddress Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> EpAddress Source #
CanCastTo (FutureContract p :: Type) EpAddress Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: () Source #
type ToCT EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT EpAddress = CAddress
type ToT EpAddress
Instance details Defined in Michelson.Typed.Haskell.Value type ToT EpAddress = Tc (ToCT EpAddress)

data Mutez #

Mutez is a wrapper over integer data type. 1 mutez is 1 token (μTz).

Instances

Bounded Mutez
Instance details Defined in Tezos.Core Methods minBound :: Mutez # maxBound :: Mutez #
Enum Mutez
Instance details Defined in Tezos.Core Methods succ :: Mutez -> Mutez # pred :: Mutez -> Mutez # toEnum :: Int -> Mutez # fromEnum :: Mutez -> Int # enumFrom :: Mutez -> [Mutez] # enumFromThen :: Mutez -> Mutez -> [Mutez] # enumFromTo :: Mutez -> Mutez -> [Mutez] # enumFromThenTo :: Mutez -> Mutez -> Mutez -> [Mutez] #
Eq Mutez
Instance details Defined in Tezos.Core Methods (==) :: Mutez -> Mutez -> Bool # (/=) :: Mutez -> Mutez -> Bool #
Data Mutez
Instance details Defined in Tezos.Core Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Mutez -> c Mutez # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Mutez # toConstr :: Mutez -> Constr # dataTypeOf :: Mutez -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Mutez) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Mutez) # gmapT :: (forall b. Data b => b -> b) -> Mutez -> Mutez # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Mutez -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Mutez -> r # gmapQ :: (forall d. Data d => d -> u) -> Mutez -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Mutez -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Mutez -> m Mutez # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Mutez -> m Mutez # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Mutez -> m Mutez #
Ord Mutez
Instance details Defined in Tezos.Core Methods compare :: Mutez -> Mutez -> Ordering # (<) :: Mutez -> Mutez -> Bool # (<=) :: Mutez -> Mutez -> Bool # (>) :: Mutez -> Mutez -> Bool # (>=) :: Mutez -> Mutez -> Bool # max :: Mutez -> Mutez -> Mutez # min :: Mutez -> Mutez -> Mutez #
Show Mutez
Instance details Defined in Tezos.Core Methods showsPrec :: Int -> Mutez -> ShowS # show :: Mutez -> String # showList :: [Mutez] -> ShowS #
Generic Mutez
Instance details Defined in Tezos.Core Associated Types type Rep Mutez :: Type -> Type # Methods from :: Mutez -> Rep Mutez x # to :: Rep Mutez x -> Mutez #
ToJSON Mutez
Instance details Defined in Tezos.Core Methods toJSON :: Mutez -> Value # toEncoding :: Mutez -> Encoding # toJSONList :: [Mutez] -> Value # toEncodingList :: [Mutez] -> Encoding #
FromJSON Mutez
Instance details Defined in Tezos.Core Methods parseJSON :: Value -> Parser Mutez # parseJSONList :: Value -> Parser [Mutez] #
Buildable Mutez
Instance details Defined in Tezos.Core Methods build :: Mutez -> Builder #
TypeHasDoc Mutez
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy Mutez -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Mutez -> WithinParens -> Markdown # typeDocDependencies :: Proxy Mutez -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep Mutez # typeDocMichelsonRep :: TypeDocMichelsonRep Mutez #
IsoCValue Mutez
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Mutez :: CT # Methods toCVal :: Mutez -> CValue (ToCT Mutez) # fromCVal :: CValue (ToCT Mutez) -> Mutez #
IsoValue Mutez
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Mutez :: T # Methods toVal :: Mutez -> Value (ToT Mutez) # fromVal :: Value (ToT Mutez) -> Mutez #
HasTypeAnn Mutez Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT Mutez) Source #
EDivOpHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Natural :: Type Source # type EModOpResHs Mutez Natural :: Type Source #
EDivOpHs Mutez Mutez Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type EDivOpResHs Mutez Mutez :: Type Source # type EModOpResHs Mutez Mutez :: Type Source #
ArithOpHs Add Mutez Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Mutez Mutez :: Type Source #
ArithOpHs Sub Mutez Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Mutez Mutez :: Type Source #
ArithOpHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Natural Mutez :: Type Source #
ArithOpHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Mul Mutez Natural :: Type Source #
type Rep Mutez
Instance details Defined in Tezos.Core type Rep Mutez = D1 (MetaData "Mutez" "Tezos.Core" "morley-1.0.0-C7XzI9RyjTtBq2aPgQePpZ" True) (C1 (MetaCons "Mutez" PrefixI True) (S1 (MetaSel (Just "unMutez") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Word64)))
type ToCT Mutez
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT Mutez = CMutez
type ToT Mutez
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Mutez = Tc (ToCT Mutez)
type EDivOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Natural = Mutez
type EDivOpResHs Mutez Mutez Source #
Instance details Defined in Lorentz.Polymorphic type EDivOpResHs Mutez Mutez = Natural
type EModOpResHs Mutez Natural Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Natural = Mutez
type EModOpResHs Mutez Mutez Source #
Instance details Defined in Lorentz.Polymorphic type EModOpResHs Mutez Mutez = Mutez
type ArithResHs Add Mutez Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Mutez Mutez = Mutez
type ArithResHs Sub Mutez Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Mutez Mutez = Mutez
type ArithResHs Mul Natural Mutez Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Natural Mutez = Mutez
type ArithResHs Mul Mutez Natural Source #
Instance details Defined in Lorentz.Arith type ArithResHs Mul Mutez Natural = Mutez

data Timestamp #

Time in the real world. Use the functions below to convert it to/from Unix time in seconds.

Instances

Eq Timestamp
Instance details Defined in Tezos.Core Methods (==) :: Timestamp -> Timestamp -> Bool # (/=) :: Timestamp -> Timestamp -> Bool #
Data Timestamp
Instance details Defined in Tezos.Core Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Timestamp -> c Timestamp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Timestamp # toConstr :: Timestamp -> Constr # dataTypeOf :: Timestamp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Timestamp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Timestamp) # gmapT :: (forall b. Data b => b -> b) -> Timestamp -> Timestamp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Timestamp -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Timestamp -> r # gmapQ :: (forall d. Data d => d -> u) -> Timestamp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Timestamp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Timestamp -> m Timestamp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Timestamp -> m Timestamp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Timestamp -> m Timestamp #
Ord Timestamp
Instance details Defined in Tezos.Core Methods compare :: Timestamp -> Timestamp -> Ordering # (<) :: Timestamp -> Timestamp -> Bool # (<=) :: Timestamp -> Timestamp -> Bool # (>) :: Timestamp -> Timestamp -> Bool # (>=) :: Timestamp -> Timestamp -> Bool # max :: Timestamp -> Timestamp -> Timestamp # min :: Timestamp -> Timestamp -> Timestamp #
Show Timestamp
Instance details Defined in Tezos.Core Methods showsPrec :: Int -> Timestamp -> ShowS # show :: Timestamp -> String # showList :: [Timestamp] -> ShowS #
Generic Timestamp
Instance details Defined in Tezos.Core Associated Types type Rep Timestamp :: Type -> Type # Methods from :: Timestamp -> Rep Timestamp x # to :: Rep Timestamp x -> Timestamp #
ToJSON Timestamp
Instance details Defined in Tezos.Core Methods toJSON :: Timestamp -> Value # toEncoding :: Timestamp -> Encoding # toJSONList :: [Timestamp] -> Value # toEncodingList :: [Timestamp] -> Encoding #
FromJSON Timestamp
Instance details Defined in Tezos.Core Methods parseJSON :: Value -> Parser Timestamp # parseJSONList :: Value -> Parser [Timestamp] #
Buildable Timestamp
Instance details Defined in Tezos.Core Methods build :: Timestamp -> Builder #
TypeHasDoc Timestamp
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy Timestamp -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Timestamp -> WithinParens -> Markdown # typeDocDependencies :: Proxy Timestamp -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep Timestamp # typeDocMichelsonRep :: TypeDocMichelsonRep Timestamp #
IsoCValue Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT Timestamp :: CT # Methods toCVal :: Timestamp -> CValue (ToCT Timestamp) # fromCVal :: CValue (ToCT Timestamp) -> Timestamp #
IsoValue Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Timestamp :: T # Methods toVal :: Timestamp -> Value (ToT Timestamp) # fromVal :: Value (ToT Timestamp) -> Timestamp #
HasTypeAnn Timestamp Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT Timestamp) Source #
ArithOpHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Integer Timestamp :: Type Source #
ArithOpHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Add Timestamp Integer :: Type Source #
ArithOpHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Integer :: Type Source #
ArithOpHs Sub Timestamp Timestamp Source #
Instance details Defined in Lorentz.Arith Associated Types type ArithResHs Sub Timestamp Timestamp :: Type Source #
type Rep Timestamp
Instance details Defined in Tezos.Core type Rep Timestamp = D1 (MetaData "Timestamp" "Tezos.Core" "morley-1.0.0-C7XzI9RyjTtBq2aPgQePpZ" True) (C1 (MetaCons "Timestamp" PrefixI True) (S1 (MetaSel (Just "unTimestamp") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 POSIXTime)))
type ToCT Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT Timestamp = CTimestamp
type ToT Timestamp
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Timestamp = Tc (ToCT Timestamp)
type ArithResHs Add Integer Timestamp Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Integer Timestamp = Timestamp
type ArithResHs Add Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Add Timestamp Integer = Timestamp
type ArithResHs Sub Timestamp Integer Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Integer = Timestamp
type ArithResHs Sub Timestamp Timestamp Source #
Instance details Defined in Lorentz.Arith type ArithResHs Sub Timestamp Timestamp = Integer

data ChainId #

Identifier of a network (babylonnet, mainnet, test network or other). Evaluated as hash of the genesis block.

The only operation supported for this type is packing. Use case: multisig contract, for instance, now includes chain ID into signed data "in order to add extra replay protection between the main chain and the test chain".

Instances

Eq ChainId
Instance details Defined in Tezos.Core Methods (==) :: ChainId -> ChainId -> Bool # (/=) :: ChainId -> ChainId -> Bool #
Show ChainId
Instance details Defined in Tezos.Core Methods showsPrec :: Int -> ChainId -> ShowS # show :: ChainId -> String # showList :: [ChainId] -> ShowS #
Arbitrary ChainId
Instance details Defined in Tezos.Core Methods arbitrary :: Gen ChainId # shrink :: ChainId -> [ChainId] #
ToJSON ChainId
Instance details Defined in Tezos.Core Methods toJSON :: ChainId -> Value # toEncoding :: ChainId -> Encoding # toJSONList :: [ChainId] -> Value # toEncodingList :: [ChainId] -> Encoding #
FromJSON ChainId
Instance details Defined in Tezos.Core Methods parseJSON :: Value -> Parser ChainId # parseJSONList :: Value -> Parser [ChainId] #
Buildable ChainId
Instance details Defined in Tezos.Core Methods build :: ChainId -> Builder #
IsoValue ChainId
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT ChainId :: T # Methods toVal :: ChainId -> Value (ToT ChainId) # fromVal :: Value (ToT ChainId) -> ChainId #
type ToT ChainId
Instance details Defined in Michelson.Typed.Haskell.Value type ToT ChainId = TChainId

data KeyHash #

Blake2b_160 hash of a public key.

Instances

Eq KeyHash
Instance details Defined in Tezos.Crypto Methods (==) :: KeyHash -> KeyHash -> Bool # (/=) :: KeyHash -> KeyHash -> Bool #
Ord KeyHash
Instance details Defined in Tezos.Crypto Methods compare :: KeyHash -> KeyHash -> Ordering # (<) :: KeyHash -> KeyHash -> Bool # (<=) :: KeyHash -> KeyHash -> Bool # (>) :: KeyHash -> KeyHash -> Bool # (>=) :: KeyHash -> KeyHash -> Bool # max :: KeyHash -> KeyHash -> KeyHash # min :: KeyHash -> KeyHash -> KeyHash #
Show KeyHash
Instance details Defined in Tezos.Crypto Methods showsPrec :: Int -> KeyHash -> ShowS # show :: KeyHash -> String # showList :: [KeyHash] -> ShowS #
Arbitrary KeyHash
Instance details Defined in Tezos.Crypto Methods arbitrary :: Gen KeyHash # shrink :: KeyHash -> [KeyHash] #
ToJSON KeyHash
Instance details Defined in Tezos.Crypto Methods toJSON :: KeyHash -> Value # toEncoding :: KeyHash -> Encoding # toJSONList :: [KeyHash] -> Value # toEncodingList :: [KeyHash] -> Encoding #
FromJSON KeyHash
Instance details Defined in Tezos.Crypto Methods parseJSON :: Value -> Parser KeyHash # parseJSONList :: Value -> Parser [KeyHash] #
Buildable KeyHash
Instance details Defined in Tezos.Crypto Methods build :: KeyHash -> Builder #
TypeHasDoc KeyHash
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy KeyHash -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy KeyHash -> WithinParens -> Markdown # typeDocDependencies :: Proxy KeyHash -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep KeyHash # typeDocMichelsonRep :: TypeDocMichelsonRep KeyHash #
IsoCValue KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToCT KeyHash :: CT # Methods toCVal :: KeyHash -> CValue (ToCT KeyHash) # fromCVal :: CValue (ToCT KeyHash) -> KeyHash #
IsoValue KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT KeyHash :: T # Methods toVal :: KeyHash -> Value (ToT KeyHash) # fromVal :: Value (ToT KeyHash) -> KeyHash #
HasTypeAnn KeyHash Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT KeyHash) Source #
type ToCT KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value type ToCT KeyHash = CKeyHash
type ToT KeyHash
Instance details Defined in Michelson.Typed.Haskell.Value type ToT KeyHash = Tc (ToCT KeyHash)

data PublicKey #

Public cryptographic key used by Tezos. There are three cryptographic curves each represented by its own constructor.

Instances

Eq PublicKey
Instance details Defined in Tezos.Crypto Methods (==) :: PublicKey -> PublicKey -> Bool # (/=) :: PublicKey -> PublicKey -> Bool #
Show PublicKey
Instance details Defined in Tezos.Crypto Methods showsPrec :: Int -> PublicKey -> ShowS # show :: PublicKey -> String # showList :: [PublicKey] -> ShowS #
Arbitrary PublicKey
Instance details Defined in Tezos.Crypto Methods arbitrary :: Gen PublicKey # shrink :: PublicKey -> [PublicKey] #
ToJSON PublicKey
Instance details Defined in Tezos.Crypto Methods toJSON :: PublicKey -> Value # toEncoding :: PublicKey -> Encoding # toJSONList :: [PublicKey] -> Value # toEncodingList :: [PublicKey] -> Encoding #
FromJSON PublicKey
Instance details Defined in Tezos.Crypto Methods parseJSON :: Value -> Parser PublicKey # parseJSONList :: Value -> Parser [PublicKey] #
Buildable PublicKey
Instance details Defined in Tezos.Crypto Methods build :: PublicKey -> Builder #
TypeHasDoc PublicKey
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy PublicKey -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy PublicKey -> WithinParens -> Markdown # typeDocDependencies :: Proxy PublicKey -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep PublicKey # typeDocMichelsonRep :: TypeDocMichelsonRep PublicKey #
IsoValue PublicKey
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT PublicKey :: T # Methods toVal :: PublicKey -> Value (ToT PublicKey) # fromVal :: Value (ToT PublicKey) -> PublicKey #
HasTypeAnn PublicKey Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT PublicKey) Source #
type ToT PublicKey
Instance details Defined in Michelson.Typed.Haskell.Value type ToT PublicKey = TKey

data Signature #

Cryptographic signatures used by Tezos. Constructors correspond to PublicKey constructors.

Tezos distinguishes signatures for different curves. For instance, ed25519 signatures and secp256k1 signatures are printed differently (have different prefix). However, signatures are packed without information about the curve. For this purpose there is a generic signature which only stores bytes and doesn't carry information about the curve. Apparently unpacking from bytes always produces such signature. Unpacking from string produces a signature with curve information.

Instances

Eq Signature
Instance details Defined in Tezos.Crypto Methods (==) :: Signature -> Signature -> Bool # (/=) :: Signature -> Signature -> Bool #
Show Signature
Instance details Defined in Tezos.Crypto Methods showsPrec :: Int -> Signature -> ShowS # show :: Signature -> String # showList :: [Signature] -> ShowS #
Arbitrary Signature
Instance details Defined in Tezos.Crypto Methods arbitrary :: Gen Signature # shrink :: Signature -> [Signature] #
ToJSON Signature
Instance details Defined in Tezos.Crypto Methods toJSON :: Signature -> Value # toEncoding :: Signature -> Encoding # toJSONList :: [Signature] -> Value # toEncodingList :: [Signature] -> Encoding #
FromJSON Signature
Instance details Defined in Tezos.Crypto Methods parseJSON :: Value -> Parser Signature # parseJSONList :: Value -> Parser [Signature] #
Buildable Signature
Instance details Defined in Tezos.Crypto Methods build :: Signature -> Builder #
TypeHasDoc Signature
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy Signature -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Signature -> WithinParens -> Markdown # typeDocDependencies :: Proxy Signature -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep Signature # typeDocMichelsonRep :: TypeDocMichelsonRep Signature #
IsoValue Signature
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT Signature :: T # Methods toVal :: Signature -> Value (ToT Signature) # fromVal :: Value (ToT Signature) -> Signature #
HasTypeAnn Signature Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT Signature) Source #
type ToT Signature
Instance details Defined in Michelson.Typed.Haskell.Value type ToT Signature = TSignature

data Set a #

A set of values a.

Instances

Foldable Set
Instance details Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # toList :: Set a -> [a] # null :: Set a -> Bool # length :: Set a -> Int # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # minimum :: Ord a => Set a -> a # sum :: Num a => Set a -> a # product :: Num a => Set a -> a #
Eq1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftEq :: (a -> b -> Bool) -> Set a -> Set b -> Bool #
Ord1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftCompare :: (a -> b -> Ordering) -> Set a -> Set b -> Ordering #
Show1 Set	Since: containers-0.5.9
Instance details Defined in Data.Set.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS #
Ord a => IsList (Set a)	Since: containers-0.5.6.2
Instance details Defined in Data.Set.Internal Associated Types type Item (Set a) :: Type # Methods fromList :: [Item (Set a)] -> Set a # fromListN :: Int -> [Item (Set a)] -> Set a # toList :: Set a -> [Item (Set a)] #
Eq a => Eq (Set a)
Instance details Defined in Data.Set.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
(Data a, Ord a) => Data (Set a)
Instance details Defined in Data.Set.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) # toConstr :: Set a -> Constr # dataTypeOf :: Set a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) # gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) #
Ord a => Ord (Set a)
Instance details Defined in Data.Set.Internal Methods compare :: Set a -> Set a -> Ordering # (<) :: Set a -> Set a -> Bool # (<=) :: Set a -> Set a -> Bool # (>) :: Set a -> Set a -> Bool # (>=) :: Set a -> Set a -> Bool # max :: Set a -> Set a -> Set a # min :: Set a -> Set a -> Set a #
(Read a, Ord a) => Read (Set a)
Instance details Defined in Data.Set.Internal Methods readsPrec :: Int -> ReadS (Set a) # readList :: ReadS [Set a] # readPrec :: ReadPrec (Set a) # readListPrec :: ReadPrec [Set a] #
Show a => Show (Set a)
Instance details Defined in Data.Set.Internal Methods showsPrec :: Int -> Set a -> ShowS # show :: Set a -> String # showList :: [Set a] -> ShowS #
Ord a => Semigroup (Set a)	Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a # sconcat :: NonEmpty (Set a) -> Set a # stimes :: Integral b => b -> Set a -> Set a #
Ord a => Monoid (Set a)
Instance details Defined in Data.Set.Internal Methods mempty :: Set a # mappend :: Set a -> Set a -> Set a # mconcat :: [Set a] -> Set a #
(Ord a, Arbitrary a) => Arbitrary (Set a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Set a) # shrink :: Set a -> [Set a] #
CoArbitrary a => CoArbitrary (Set a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Set a -> Gen b -> Gen b #
NFData a => NFData (Set a)
Instance details Defined in Data.Set.Internal Methods rnf :: Set a -> () #
Ord a => Contains (Set a)
Instance details Defined in Control.Lens.At Methods contains :: Index (Set a) -> Lens' (Set a) Bool #
Ord k => Ixed (Set k)
Instance details Defined in Control.Lens.At Methods ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) #
Ord k => At (Set k)
Instance details Defined in Control.Lens.At Methods at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k))) #
Ord a => Wrapped (Set a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Set a) :: Type # Methods _Wrapped' :: Iso' (Set a) (Unwrapped (Set a)) #
PolyCTypeHasDocC (a ': ([] :: [Type])) => TypeHasDoc (Set a)
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (Set a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Set a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Set a) -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep (Set a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Set a) #
(Ord c, IsoCValue c) => IsoValue (Set c)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Set c) :: T # Methods toVal :: Set c -> Value (ToT (Set c)) # fromVal :: Value (ToT (Set c)) -> Set c #
One (Set v)
Instance details Defined in Universum.Container.Class Associated Types type OneItem (Set v) :: Type # Methods one :: OneItem (Set v) -> Set v #
Ord v => Container (Set v)
Instance details Defined in Universum.Container.Class Associated Types type Element (Set v) :: Type # Methods toList :: Set v -> [Element (Set v)] # null :: Set v -> Bool # foldr :: (Element (Set v) -> b -> b) -> b -> Set v -> b # foldl :: (b -> Element (Set v) -> b) -> b -> Set v -> b # foldl' :: (b -> Element (Set v) -> b) -> b -> Set v -> b # length :: Set v -> Int # elem :: Element (Set v) -> Set v -> Bool # maximum :: Set v -> Element (Set v) # minimum :: Set v -> Element (Set v) # foldMap :: Monoid m => (Element (Set v) -> m) -> Set v -> m # fold :: Set v -> Element (Set v) # foldr' :: (Element (Set v) -> b -> b) -> b -> Set v -> b # foldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Element (Set v) # foldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Element (Set v) # notElem :: Element (Set v) -> Set v -> Bool # all :: (Element (Set v) -> Bool) -> Set v -> Bool # any :: (Element (Set v) -> Bool) -> Set v -> Bool # and :: Set v -> Bool # or :: Set v -> Bool # find :: (Element (Set v) -> Bool) -> Set v -> Maybe (Element (Set v)) # safeHead :: Set v -> Maybe (Element (Set v)) #
IsComparable a => UpdOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Set a) :: Type Source # type UpdOpParamsHs (Set a) :: Type Source #
SizeOpHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic
IsComparable e => IterOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Set e) :: Type Source #
IsComparable e => MemOpHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Set e) :: Type Source #
(SingI (ToCT v), Typeable (ToCT v)) => HasTypeAnn (Set v) Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT (Set v)) Source #
(t ~ Set a', Ord a) => Rewrapped (Set a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
type Item (Set a)
Instance details Defined in Data.Set.Internal type Item (Set a) = a
type Index (Set a)
Instance details Defined in Control.Lens.At type Index (Set a) = a
type IxValue (Set k)
Instance details Defined in Control.Lens.At type IxValue (Set k) = ()
type Unwrapped (Set a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Set a) = [a]
type ToT (Set c)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Set c) = TSet (ToCT c)
type OneItem (Set v)
Instance details Defined in Universum.Container.Class type OneItem (Set v) = v
type Element (Set v)
Instance details Defined in Universum.Container.Class type Element (Set v) = ElementDefault (Set v)
type UpdOpKeyHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Set a) = a
type UpdOpParamsHs (Set a) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Set a) = Bool
type IterOpElHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Set e) = e
type MemOpKeyHs (Set e) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Set e) = e

data Map k a #

A Map from keys k to values a.

Instances

Eq2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Map a c -> Map b d -> Bool #
Ord2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Map a c -> Map b d -> Ordering #
Show2 Map	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Map a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Map a b] -> ShowS #
Ord k => TraverseMin k (Map k)
Instance details Defined in Control.Lens.Traversal Methods traverseMin :: IndexedTraversal' k (Map k v) v #
Ord k => TraverseMax k (Map k)
Instance details Defined in Control.Lens.Traversal Methods traverseMax :: IndexedTraversal' k (Map k v) v #
Functor (Map k)
Instance details Defined in Data.Map.Internal Methods fmap :: (a -> b) -> Map k a -> Map k b # (<$) :: a -> Map k b -> Map k a #
Foldable (Map k)
Instance details Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # toList :: Map k a -> [a] # null :: Map k a -> Bool # length :: Map k a -> Int # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # sum :: Num a => Map k a -> a # product :: Num a => Map k a -> a #
Traversable (Map k)
Instance details Defined in Data.Map.Internal Methods traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) # sequenceA :: Applicative f => Map k (f a) -> f (Map k a) # mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) # sequence :: Monad m => Map k (m a) -> m (Map k a) #
(Ord k, Arbitrary k) => Arbitrary1 (Map k)
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a -> Gen (Map k a) # liftShrink :: (a -> [a]) -> Map k a -> [Map k a] #
Eq k => Eq1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftEq :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool #
Ord k => Ord1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftCompare :: (a -> b -> Ordering) -> Map k a -> Map k b -> Ordering #
(Ord k, Read k) => Read1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Map k a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Map k a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Map k a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Map k a] #
Show k => Show1 (Map k)	Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Map k a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Map k a] -> ShowS #
Ord k => Apply (Map k)	A 'Map k' is not `Applicative`, but it is an instance of `Apply`
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Map k (a -> b) -> Map k a -> Map k b # (.>) :: Map k a -> Map k b -> Map k b # (<.) :: Map k a -> Map k b -> Map k a # liftF2 :: (a -> b -> c) -> Map k a -> Map k b -> Map k c #
Ord k => Bind (Map k)	A 'Map k' is not a `Monad`, but it is an instance of `Bind`
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Map k a -> (a -> Map k b) -> Map k b # join :: Map k (Map k a) -> Map k a #
Ord k => IsList (Map k v)	Since: containers-0.5.6.2
Instance details Defined in Data.Map.Internal Associated Types type Item (Map k v) :: Type # Methods fromList :: [Item (Map k v)] -> Map k v # fromListN :: Int -> [Item (Map k v)] -> Map k v # toList :: Map k v -> [Item (Map k v)] #
(Eq k, Eq a) => Eq (Map k a)
Instance details Defined in Data.Map.Internal Methods (==) :: Map k a -> Map k a -> Bool # (/=) :: Map k a -> Map k a -> Bool #
(Data k, Data a, Ord k) => Data (Map k a)
Instance details Defined in Data.Map.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) # toConstr :: Map k a -> Constr # dataTypeOf :: Map k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) # gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) #
(Ord k, Ord v) => Ord (Map k v)
Instance details Defined in Data.Map.Internal Methods compare :: Map k v -> Map k v -> Ordering # (<) :: Map k v -> Map k v -> Bool # (<=) :: Map k v -> Map k v -> Bool # (>) :: Map k v -> Map k v -> Bool # (>=) :: Map k v -> Map k v -> Bool # max :: Map k v -> Map k v -> Map k v # min :: Map k v -> Map k v -> Map k v #
(Ord k, Read k, Read e) => Read (Map k e)
Instance details Defined in Data.Map.Internal Methods readsPrec :: Int -> ReadS (Map k e) # readList :: ReadS [Map k e] # readPrec :: ReadPrec (Map k e) # readListPrec :: ReadPrec [Map k e] #
(Show k, Show a) => Show (Map k a)
Instance details Defined in Data.Map.Internal Methods showsPrec :: Int -> Map k a -> ShowS # show :: Map k a -> String # showList :: [Map k a] -> ShowS #
Ord k => Semigroup (Map k v)
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v # sconcat :: NonEmpty (Map k v) -> Map k v # stimes :: Integral b => b -> Map k v -> Map k v #
Ord k => Monoid (Map k v)
Instance details Defined in Data.Map.Internal Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #
(Ord k, Arbitrary k, Arbitrary v) => Arbitrary (Map k v)
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Map k v) # shrink :: Map k v -> [Map k v] #
(CoArbitrary k, CoArbitrary v) => CoArbitrary (Map k v)
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Map k v -> Gen b -> Gen b #
(NFData k, NFData a) => NFData (Map k a)
Instance details Defined in Data.Map.Internal Methods rnf :: Map k a -> () #
Ord k => Ixed (Map k a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Map k a) -> Traversal' (Map k a) (IxValue (Map k a)) #
Ord k => At (Map k a)
Instance details Defined in Control.Lens.At Methods at :: Index (Map k a) -> Lens' (Map k a) (Maybe (IxValue (Map k a))) #
Ord k => Wrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Map k a) :: Type # Methods _Wrapped' :: Iso' (Map k a) (Unwrapped (Map k a)) #
(PolyCTypeHasDocC (k ': ([] :: [Type])), PolyTypeHasDocC (v ': ([] :: [Type])), Ord k) => TypeHasDoc (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (Map k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Map k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Map k v) -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep (Map k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (Map k v) #
(Ord k, IsoCValue k, IsoValue v) => IsoValue (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Map k v) :: T # Methods toVal :: Map k v -> Value (ToT (Map k v)) # fromVal :: Value (ToT (Map k v)) -> Map k v #
One (Map k v)
Instance details Defined in Universum.Container.Class Associated Types type OneItem (Map k v) :: Type # Methods one :: OneItem (Map k v) -> Map k v #
Container (Map k v)
Instance details Defined in Universum.Container.Class Associated Types type Element (Map k v) :: Type # Methods toList :: Map k v -> [Element (Map k v)] # null :: Map k v -> Bool # foldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # foldl :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # foldl' :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # length :: Map k v -> Int # elem :: Element (Map k v) -> Map k v -> Bool # maximum :: Map k v -> Element (Map k v) # minimum :: Map k v -> Element (Map k v) # foldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # fold :: Map k v -> Element (Map k v) # foldr' :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # foldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # foldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # notElem :: Element (Map k v) -> Map k v -> Bool # all :: (Element (Map k v) -> Bool) -> Map k v -> Bool # any :: (Element (Map k v) -> Bool) -> Map k v -> Bool # and :: Map k v -> Bool # or :: Map k v -> Bool # find :: (Element (Map k v) -> Bool) -> Map k v -> Maybe (Element (Map k v)) # safeHead :: Map k v -> Maybe (Element (Map k v)) #
ToPairs (Map k v)
Instance details Defined in Universum.Container.Class Associated Types type Key (Map k v) :: Type # type Val (Map k v) :: Type # Methods toPairs :: Map k v -> [(Key (Map k v), Val (Map k v))] # keys :: Map k v -> [Key (Map k v)] # elems :: Map k v -> [Val (Map k v)] #
IsComparable k => GetOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (Map k v) :: Type Source # type GetOpValHs (Map k v) :: Type Source #
IsComparable k => UpdOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (Map k v) :: Type Source # type UpdOpParamsHs (Map k v) :: Type Source #
SizeOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic
IsComparable k => IterOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Map k v) :: Type Source #
IsComparable k => MapOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MapOpInpHs (Map k v) :: Type Source # type MapOpResHs (Map k v) :: Type -> Type Source #
IsComparable k => MemOpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Map k v) :: Type Source #
HasTypeAnn v => HasTypeAnn (Map k v) Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT (Map k v)) Source #
(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t	Use `wrapping fromList`. unwrapping returns a sorted list.
Instance details Defined in Control.Lens.Wrapped
(key ~ key', value ~ value', IsComparable key) => StoreHasSubmap (Map key' value') name key value Source #	`Map` can be used as standalone key-value storage if very needed.
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key' value') name key value Source #
type Item (Map k v)
Instance details Defined in Data.Map.Internal type Item (Map k v) = (k, v)
type Index (Map k a)
Instance details Defined in Control.Lens.At type Index (Map k a) = k
type IxValue (Map k a)
Instance details Defined in Control.Lens.At type IxValue (Map k a) = a
type Unwrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Map k a) = [(k, a)]
type ToT (Map k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Map k v) = TMap (ToCT k) (ToT v)
type OneItem (Map k v)
Instance details Defined in Universum.Container.Class type OneItem (Map k v) = (k, v)
type Element (Map k v)
Instance details Defined in Universum.Container.Class type Element (Map k v) = ElementDefault (Map k v)
type Val (Map k v)
Instance details Defined in Universum.Container.Class type Val (Map k v) = v
type Key (Map k v)
Instance details Defined in Universum.Container.Class type Key (Map k v) = k
type GetOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (Map k v) = k
type GetOpValHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (Map k v) = v
type UpdOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (Map k v) = k
type UpdOpParamsHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (Map k v) = Maybe v
type IterOpElHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type IterOpElHs (Map k v) = (k, v)
type MapOpInpHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpInpHs (Map k v) = (k, v)
type MapOpResHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MapOpResHs (Map k v) = Map k
type MemOpKeyHs (Map k v) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (Map k v) = k

newtype BigMap k v #

Constructors

BigMap
Fields unBigMap :: Map k v

Instances

(Eq k, Eq v) => Eq (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods (==) :: BigMap k v -> BigMap k v -> Bool # (/=) :: BigMap k v -> BigMap k v -> Bool #
(Show k, Show v) => Show (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> BigMap k v -> ShowS # show :: BigMap k v -> String # showList :: [BigMap k v] -> ShowS #
Ord k => Semigroup (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods (<>) :: BigMap k v -> BigMap k v -> BigMap k v # sconcat :: NonEmpty (BigMap k v) -> BigMap k v # stimes :: Integral b => b -> BigMap k v -> BigMap k v #
Ord k => Monoid (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods mempty :: BigMap k v # mappend :: BigMap k v -> BigMap k v -> BigMap k v # mconcat :: [BigMap k v] -> BigMap k v #
Default (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods def :: BigMap k v #
(PolyCTypeHasDocC (k ': ([] :: [Type])), PolyTypeHasDocC (v ': ([] :: [Type])), Ord k) => TypeHasDoc (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (BigMap k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (BigMap k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (BigMap k v) -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep (BigMap k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (BigMap k v) #
(Ord k, IsoCValue k, IsoValue v) => IsoValue (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (BigMap k v) :: T # Methods toVal :: BigMap k v -> Value (ToT (BigMap k v)) # fromVal :: Value (ToT (BigMap k v)) -> BigMap k v #
IsComparable k => GetOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type GetOpKeyHs (BigMap k v) :: Type Source # type GetOpValHs (BigMap k v) :: Type Source #
IsComparable k => UpdOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type UpdOpKeyHs (BigMap k v) :: Type Source # type UpdOpParamsHs (BigMap k v) :: Type Source #
IsComparable k => MemOpHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (BigMap k v) :: Type Source #
HasTypeAnn v => HasTypeAnn (BigMap k v) Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT (BigMap k v)) Source #
(key ~ key', value ~ value', IsComparable key) => StoreHasSubmap (BigMap key' value') name key value Source #	`BigMap` can be used as standalone key-value storage, name of submap is not accounted in this case.
Instance details Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (BigMap key' value') name key value Source #
type ToT (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (BigMap k v) = TBigMap (ToCT k) (ToT v)
type GetOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpKeyHs (BigMap k v) = k
type GetOpValHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type GetOpValHs (BigMap k v) = v
type UpdOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpKeyHs (BigMap k v) = k
type UpdOpParamsHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type UpdOpParamsHs (BigMap k v) = Maybe v
type MemOpKeyHs (BigMap k v) Source #
Instance details Defined in Lorentz.Polymorphic type MemOpKeyHs (BigMap k v) = k

type Operation = Operation' Instr #

data Maybe a #

The Maybe type encapsulates an optional value. A value of type Maybe a either contains a value of type a (represented as Just a), or it is empty (represented as Nothing). Using Maybe is a good way to deal with errors or exceptional cases without resorting to drastic measures such as error.

The Maybe type is also a monad. It is a simple kind of error monad, where all errors are represented by Nothing. A richer error monad can be built using the Either type.

Constructors

Nothing
Just a

Instances

Monad Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b # (>>) :: Maybe a -> Maybe b -> Maybe b # return :: a -> Maybe a # fail :: String -> Maybe a #
Functor Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods fmap :: (a -> b) -> Maybe a -> Maybe b # (<$) :: a -> Maybe b -> Maybe a #
MonadFail Maybe	Since: base-4.9.0.0
Instance details Defined in Control.Monad.Fail Methods fail :: String -> Maybe a #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Foldable Maybe	Since: base-2.1
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # toList :: Maybe a -> [a] # null :: Maybe a -> Bool # length :: Maybe a -> Int # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # sum :: Num a => Maybe a -> a # product :: Num a => Maybe a -> a #
Traversable Maybe	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) # sequence :: Monad m => Maybe (m a) -> m (Maybe a) #
Arbitrary1 Maybe
Instance details Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a -> Gen (Maybe a) # liftShrink :: (a -> [a]) -> Maybe a -> [Maybe a] #
Alternative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods empty :: Maybe a # (<\|>) :: Maybe a -> Maybe a -> Maybe a # some :: Maybe a -> Maybe [a] # many :: Maybe a -> Maybe [a] #
MonadPlus Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods mzero :: Maybe a # mplus :: Maybe a -> Maybe a -> Maybe a #
Eq1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Maybe a -> Maybe b -> Bool #
Ord1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering #
Read1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] #
Show1 Maybe	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS #
MonadFailure Maybe
Instance details Defined in Basement.Monad Associated Types type Failure Maybe :: Type # Methods mFail :: Failure Maybe -> Maybe () #
NFData1 Maybe	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Maybe a -> () #
MonadThrow Maybe
Instance details Defined in Control.Monad.Catch Methods throwM :: Exception e => e -> Maybe a #
Hashable1 Maybe
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Maybe a -> Int #
Apply Maybe
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Maybe (a -> b) -> Maybe a -> Maybe b # (.>) :: Maybe a -> Maybe b -> Maybe b # (<.) :: Maybe a -> Maybe b -> Maybe a # liftF2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #
InjValue Maybe
Instance details Defined in Named.Internal Methods injValue :: a -> Maybe a #
Bind Maybe
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Maybe a -> (a -> Maybe b) -> Maybe b # join :: Maybe (Maybe a) -> Maybe a #
PTraversable Maybe
Instance details Defined in Data.Singletons.Prelude.Traversable Associated Types type Traverse arg arg1 :: f (t b) # type SequenceA arg :: f (t a) # type MapM arg arg1 :: m (t b) # type Sequence arg :: m (t a) #
STraversable Maybe
Instance details Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) #
PFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Associated Types type Fold arg :: m # type FoldMap arg arg1 :: m # type Foldr arg arg1 arg2 :: b # type Foldr' arg arg1 arg2 :: b # type Foldl arg arg1 arg2 :: b # type Foldl' arg arg1 arg2 :: b # type Foldr1 arg arg1 :: a # type Foldl1 arg arg1 :: a # type ToList arg :: [a] # type Null arg :: Bool # type Length arg :: Nat # type Elem arg arg1 :: Bool # type Maximum arg :: a # type Minimum arg :: a # type Sum arg :: a # type Product arg :: a #
SFoldable Maybe
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sFold :: SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) #
PFunctor Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Fmap arg arg1 :: f b # type arg <$ arg1 :: f a #
PApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Pure arg :: f a # type arg <> arg1 :: f b # type LiftA2 arg arg1 arg2 :: f c # type arg > arg1 :: f b # type arg <* arg1 :: f a #
PMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type arg >>= arg1 :: m b # type arg >> arg1 :: m b # type Return arg :: m a # type Fail arg :: m a #
PAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Empty :: f a # type arg <\|> arg1 :: f a #
PMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Associated Types type Mzero :: m a # type Mplus arg arg1 :: m a #
SFunctor Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sFmap :: Sing t1 -> Sing t2 -> Sing (Apply (Apply FmapSym0 t1) t2) # (%<$) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<$@#@$) t1) t2) #
SApplicative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: Sing t -> Sing (Apply PureSym0 t) # (%<>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sLiftA2 :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) #
SMonad Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: Sing t -> Sing (Apply ReturnSym0 t) # sFail :: Sing t -> Sing (Apply FailSym0 t) #
SAlternative Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sEmpty :: Sing EmptySym0 # (%<\|>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<\|>@#@$) t1) t2) #
SMonadPlus Maybe
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods sMzero :: Sing MzeroSym0 # sMplus :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MplusSym0 t1) t2) #
LorentzFunctor Maybe Source #
Instance details Defined in Lorentz.Instr Methods lmap :: KnownValue b => ((a ': s) :-> (b ': s)) -> (Maybe a ': s) :-> (Maybe b ': s) Source #
() :=> (Functor Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Functor Maybe #
() :=> (Applicative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Applicative Maybe #
() :=> (Alternative Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- Alternative Maybe #
() :=> (MonadPlus Maybe)
Instance details Defined in Data.Constraint Methods ins :: () :- MonadPlus Maybe #
Eq a => Eq (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods (==) :: Maybe a -> Maybe a -> Bool # (/=) :: Maybe a -> Maybe a -> Bool #
Data a => Data (Maybe a)	Since: base-4.0.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) #
Ord a => Ord (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Maybe Methods compare :: Maybe a -> Maybe a -> Ordering # (<) :: Maybe a -> Maybe a -> Bool # (<=) :: Maybe a -> Maybe a -> Bool # (>) :: Maybe a -> Maybe a -> Bool # (>=) :: Maybe a -> Maybe a -> Bool # max :: Maybe a -> Maybe a -> Maybe a # min :: Maybe a -> Maybe a -> Maybe a #
Read a => Read (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Read Methods readsPrec :: Int -> ReadS (Maybe a) # readList :: ReadS [Maybe a] # readPrec :: ReadPrec (Maybe a) # readListPrec :: ReadPrec [Maybe a] #
Show a => Show (Maybe a)	Since: base-2.1
Instance details Defined in GHC.Show Methods showsPrec :: Int -> Maybe a -> ShowS # show :: Maybe a -> String # showList :: [Maybe a] -> ShowS #
Generic (Maybe a)
Instance details Defined in GHC.Generics Associated Types type Rep (Maybe a) :: Type -> Type # Methods from :: Maybe a -> Rep (Maybe a) x # to :: Rep (Maybe a) x -> Maybe a #
Semigroup a => Semigroup (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Semigroup a => Monoid (Maybe a)	Lift a semigroup into `Maybe` forming a `Monoid` according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup `S` may be turned into a monoid simply by adjoining an element `e` not in `S` and defining `ee = e` and `es = s = se` for all `s ∈ S`." Since 4.11.0: constraint on inner `a` value generalised from `Monoid` to `Semigroup`. Since: base-2.1*
Instance details Defined in GHC.Base Methods mempty :: Maybe a # mappend :: Maybe a -> Maybe a -> Maybe a # mconcat :: [Maybe a] -> Maybe a #
Lift a => Lift (Maybe a)
Instance details Defined in Language.Haskell.TH.Syntax Methods lift :: Maybe a -> Q Exp #
Testable prop => Testable (Maybe prop)
Instance details Defined in Test.QuickCheck.Property Methods property :: Maybe prop -> Property # propertyForAllShrinkShow :: Gen a -> (a -> [a]) -> (a -> [String]) -> (a -> Maybe prop) -> Property #
Arbitrary a => Arbitrary (Maybe a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods arbitrary :: Gen (Maybe a) # shrink :: Maybe a -> [Maybe a] #
CoArbitrary a => CoArbitrary (Maybe a)
Instance details Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Maybe a -> Gen b -> Gen b #
Hashable a => Hashable (Maybe a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Maybe a -> Int # hash :: Maybe a -> Int #
SingKind a => SingKind (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) :: Type Methods fromSing :: Sing a0 -> DemoteRep (Maybe a)
NFData a => NFData (Maybe a)
Instance details Defined in Control.DeepSeq Methods rnf :: Maybe a -> () #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
Buildable a => Buildable (Maybe a)
Instance details Defined in Formatting.Buildable Methods build :: Maybe a -> Builder #
Ixed (Maybe a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #
At (Maybe a)
Instance details Defined in Control.Lens.At Methods at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #
PolyTypeHasDocC (a ': ([] :: [Type])) => TypeHasDoc (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (Maybe a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Maybe a) -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) # typeDocMichelsonRep :: TypeDocMichelsonRep (Maybe a) #
IsoValue a => IsoValue (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (Maybe a) :: T # Methods toVal :: Maybe a -> Value (ToT (Maybe a)) # fromVal :: Value (ToT (Maybe a)) -> Maybe a #
(TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a)
Instance details Defined in Universum.Container.Class Associated Types type Element (Maybe a) :: Type # Methods toList :: Maybe a -> [Element (Maybe a)] # null :: Maybe a -> Bool # foldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # foldl' :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # length :: Maybe a -> Int # elem :: Element (Maybe a) -> Maybe a -> Bool # maximum :: Maybe a -> Element (Maybe a) # minimum :: Maybe a -> Element (Maybe a) # foldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # fold :: Maybe a -> Element (Maybe a) # foldr' :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # foldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # and :: Maybe a -> Bool # or :: Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # safeHead :: Maybe a -> Maybe (Element (Maybe a)) #
PMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Associated Types type Mempty :: a # type Mappend arg arg1 :: a # type Mconcat arg :: a #
SSemigroup a => SMonoid (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sMempty :: Sing MemptySym0 # sMappend :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MappendSym0 t1) t2) # sMconcat :: Sing t -> Sing (Apply MconcatSym0 t) #
PShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Associated Types type ShowsPrec arg arg1 arg2 :: Symbol # type Show_ arg :: Symbol # type ShowList arg arg1 :: Symbol #
SShow a => SShow (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) #
PSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Associated Types type arg <> arg1 :: a # type Sconcat arg :: a #
SSemigroup a => SSemigroup (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods (%<>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<>@#@$) t1) t2) # sSconcat :: Sing t -> Sing (Apply SconcatSym0 t) #
POrd (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord Associated Types type Compare arg arg1 :: Ordering # type arg < arg1 :: Bool # type arg <= arg1 :: Bool # type arg > arg1 :: Bool # type arg >= arg1 :: Bool # type Max arg arg1 :: a # type Min arg arg1 :: a #
SOrd a => SOrd (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) #
SEq a => SEq (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq Methods (%==) :: Sing a0 -> Sing b -> Sing (a0 == b) # (%/=) :: Sing a0 -> Sing b -> Sing (a0 /= b) #
PEq (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq Associated Types type x == y :: Bool # type x /= y :: Bool #
Pretty a => Pretty (Maybe a)
Instance details Defined in Text.PrettyPrint.Leijen.Text Methods pretty :: Maybe a -> Doc # prettyList :: [Maybe a] -> Doc #
HasTypeAnn a => HasTypeAnn (Maybe a) Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT (Maybe a)) Source #
Generic1 Maybe
Instance details Defined in GHC.Generics Associated Types type Rep1 Maybe :: k -> Type # Methods from1 :: Maybe a -> Rep1 Maybe a # to1 :: Rep1 Maybe a -> Maybe a #
IsoHKD Maybe (a :: Type)
Instance details Defined in Data.Vinyl.XRec Associated Types type HKD Maybe a :: Type # Methods unHKD :: HKD Maybe a -> Maybe a # toHKD :: Maybe a -> HKD Maybe a #
SingI (Nothing :: Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing Nothing
(Eq a) :=> (Eq (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Eq a :- Eq (Maybe a) #
(Ord a) :=> (Ord (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Ord a :- Ord (Maybe a) #
(Read a) :=> (Read (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Read a :- Read (Maybe a) #
(Show a) :=> (Show (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Show a :- Show (Maybe a) #
(Semigroup a) :=> (Semigroup (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Semigroup a :- Semigroup (Maybe a) #
(Monoid a) :=> (Monoid (Maybe a))
Instance details Defined in Data.Constraint Methods ins :: Monoid a :- Monoid (Maybe a) #
Each (Maybe a) (Maybe b) a b
Instance details Defined in Lens.Micro.Internal Methods each :: Traversal (Maybe a) (Maybe b) a b #
CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: () Source #
SingI a2 => SingI (Just a2 :: Maybe a1)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing (Just a2)
SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 #
SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 #
SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 #
SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 #
SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 #
SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 #
SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 #
SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing LastSym0 #
SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing FirstSym0 #
SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 #
SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 #
SingI (JustSym0 :: TyFun a (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing JustSym0 #
SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindSym0 #
SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 #
SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621679495141] [a6989586621679495141] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621679495142] (Maybe a6989586621679495142) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680065917] ([a6989586621680065917] ~> Maybe [a6989586621680065917]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679608129Sym0 :: TyFun (Maybe a6989586621679544754) (Maybe a6989586621679544754 ~> Maybe a6989586621679544754) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621679495143) [a6989586621679495143] -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679495146) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679495147) Bool -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621679495145) a6989586621679495145 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680441747) (MinInternal a6989586621680441747) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680441068) (MaxInternal a6989586621680441068) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679390863Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679051026) (Option a6989586621679051026) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679072646) (Last a6989586621679072646) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679072651) (First a6989586621679072651) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680280853Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fail_6989586621679608036Sym0 :: TyFun Symbol (Maybe a6989586621679544705) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Pure_6989586621679607829Sym0 :: TyFun a6989586621679544676 (Maybe a6989586621679544676) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679608125LSym0 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621679495144 (Maybe a6989586621679495144 ~> a6989586621679495144) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621679939701 ([a6989586621679939701] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type)
Instance details Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679051026) (Maybe a6989586621679051026) -> Type)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679072651) (Maybe a6989586621679072651) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679072646) (Maybe a6989586621679072646) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621679939702 ~> Bool) ([a6989586621679939702] ~> Maybe a6989586621679939702) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621679939699 ~> Bool) ([a6989586621679939699] ~> Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindSym1 d) #
SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) #
(SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) #
SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) #
SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 #
SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 #
SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 #
SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 #
SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 #
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing FindSym0 #
SuppressUnusedWarnings (StripPrefixSym1 a6989586621680078627 :: TyFun [a6989586621680065917] (Maybe [a6989586621680065917]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621679949259 :: TyFun [a6989586621679939702] (Maybe a6989586621679939702) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindIndexSym1 a6989586621679949619 :: TyFun [a6989586621679939699] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ElemIndexSym1 a6989586621679949627 :: TyFun [a6989586621679939701] (Maybe Nat) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (ShowsPrec_6989586621680280853Sym1 a6989586621680280850 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type)
Instance details Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679608129Sym1 a6989586621679608127 :: TyFun (Maybe a6989586621679544754) (Maybe a6989586621679544754) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679608029Sym0 :: TyFun (Maybe a6989586621679544702) (Maybe b6989586621679544703 ~> Maybe b6989586621679544703) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679608013Sym0 :: TyFun (Maybe a6989586621679544700) ((a6989586621679544700 ~> Maybe b6989586621679544701) ~> Maybe b6989586621679544701) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679607871Sym0 :: TyFun (Maybe a6989586621679544682) (Maybe b6989586621679544683 ~> Maybe b6989586621679544683) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FromMaybeSym1 a6989586621679495336 :: TyFun (Maybe a6989586621679495144) a6989586621679495144 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Compare_6989586621679390863Sym1 a6989586621679390861 :: TyFun (Maybe a3530822107858468865) Ordering -> Type)
Instance details Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679607841Sym0 :: TyFun (Maybe (a6989586621679544677 ~> b6989586621679544678)) (Maybe a6989586621679544677 ~> Maybe b6989586621679544678) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621681199025 a6989586621681199026) (f6989586621681199025 (Maybe a6989586621681199026)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679607700Sym0 :: TyFun a6989586621679544673 (Maybe b6989586621679544674 ~> Maybe a6989586621679544673) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621679493717 ((a6989586621679493718 ~> b6989586621679493717) ~> (Maybe a6989586621679493718 ~> b6989586621679493717)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621679939680 ([(a6989586621679939680, b6989586621679939681)] ~> Maybe b6989586621679939681) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442545NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442545MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442518NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442518MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621679607680Sym0 :: TyFun (a6989586621679544671 ~> b6989586621679544672) (Maybe a6989586621679544671 ~> Maybe b6989586621679544672) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621679495139 ~> Maybe b6989586621679495140) ([a6989586621679495139] ~> [b6989586621679495140]) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621679939758 ~> Maybe (a6989586621679939759, b6989586621679939758)) (b6989586621679939758 ~> [a6989586621679939759]) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680450636 ~> Bool) (t6989586621680450635 a6989586621680450636 ~> Maybe a6989586621680450636) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
(SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d b) #
(SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (FindSym1 d t) #
SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d a) #
SuppressUnusedWarnings (LookupSym1 a6989586621679949041 b6989586621679939681 :: TyFun [(a6989586621679939680, b6989586621679939681)] (Maybe b6989586621679939681) -> Type)
Instance details Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679608029Sym1 a6989586621679608027 b6989586621679544703 :: TyFun (Maybe b6989586621679544703) (Maybe b6989586621679544703) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679607871Sym1 a6989586621679607869 b6989586621679544683 :: TyFun (Maybe b6989586621679544683) (Maybe b6989586621679544683) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679607841Sym1 a6989586621679607839 :: TyFun (Maybe a6989586621679544677) (Maybe b6989586621679544678) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679607700Sym1 a6989586621679607698 b6989586621679544674 :: TyFun (Maybe b6989586621679544674) (Maybe a6989586621679544673) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Fmap_6989586621679607680Sym1 a6989586621679607678 :: TyFun (Maybe a6989586621679544671) (Maybe b6989586621679544672) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442545NSym1 x6989586621680442543 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442545MSym1 x6989586621680442543 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442518NSym1 x6989586621680442516 :: TyFun k1 (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680442518MSym1 x6989586621680442516 :: TyFun k (Maybe k1) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (FindSym1 a6989586621680451093 t6989586621680450635 :: TyFun (t6989586621680450635 a6989586621680450636) (Maybe a6989586621680450636) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680338899Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680338811Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Traverse_6989586621680754401Sym0 :: TyFun (a6989586621680748240 ~> f6989586621680748239 b6989586621680748241) (Maybe a6989586621680748240 ~> f6989586621680748239 (Maybe b6989586621680748241)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (TFHelper_6989586621679608013Sym1 a6989586621679608011 b6989586621679544701 :: TyFun (a6989586621679544700 ~> Maybe b6989586621679544701) (Maybe b6989586621679544701) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621679607857Sym0 :: TyFun (a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681)) (Maybe a6989586621679544679 ~> (Maybe b6989586621679544680 ~> Maybe c6989586621679544681)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym1 a6989586621679493735 a6989586621679493718 :: TyFun (a6989586621679493718 ~> b6989586621679493717) (Maybe a6989586621679493718 ~> b6989586621679493717) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621679495313RsSym0 :: TyFun (a6989586621679495139 ~> Maybe k1) (TyFun k (TyFun [a6989586621679495139] [k1] -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451570MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451545MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
(SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) #
SuppressUnusedWarnings (Traverse_6989586621680754401Sym1 a6989586621680754399 :: TyFun (Maybe a6989586621680748240) (f6989586621680748239 (Maybe b6989586621680748241)) -> Type)
Instance details Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621679607857Sym1 a6989586621679607854 :: TyFun (Maybe a6989586621679544679) (Maybe b6989586621679544680 ~> Maybe c6989586621679544681) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Maybe_Sym2 a6989586621679493736 a6989586621679493735 :: TyFun (Maybe a6989586621679493718) b6989586621679493717 -> Type)
Instance details Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451570MfSym1 f6989586621680451568 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451545MfSym1 f6989586621680451543 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680338899Sym1 a6989586621680338897 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680338811Sym1 a6989586621680338809 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (LiftA2_6989586621679607857Sym2 a6989586621679607855 a6989586621679607854 :: TyFun (Maybe b6989586621679544680) (Maybe c6989586621679544681) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451570MfSym2 xs6989586621680451569 f6989586621680451568 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451545MfSym2 xs6989586621680451544 f6989586621680451543 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680338899Sym2 k6989586621680338898 a6989586621680338897 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Lambda_6989586621680338811Sym2 k6989586621680338810 a6989586621680338809 :: TyFun k1 (Maybe a) -> Type)
Instance details Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451545MfSym3 a6989586621680451546 xs6989586621680451544 f6989586621680451543 :: TyFun (Maybe k2) (Maybe k3) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
SuppressUnusedWarnings (Let6989586621680451570MfSym3 a6989586621680451571 xs6989586621680451569 f6989586621680451568 :: TyFun k3 (Maybe k3) -> Type)
Instance details Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () #
IsoValue a => IsoValue (NamedF Maybe a name)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (NamedF Maybe a name) :: T # Methods toVal :: NamedF Maybe a name -> Value (ToT (NamedF Maybe a name)) # fromVal :: Value (ToT (NamedF Maybe a name)) -> NamedF Maybe a name #
(HasTypeAnn (Maybe a), KnownSymbol name) => HasTypeAnn (NamedF Maybe a name) Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT (NamedF Maybe a name)) Source #
type Failure Maybe
Instance details Defined in Basement.Monad type Failure Maybe = ()
type Empty
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Empty = (Empty_6989586621679608117Sym0 :: Maybe a)
type Mzero
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mzero = (Mzero_6989586621679545229Sym0 :: Maybe a)
type Product (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Product (arg :: Maybe a) = Apply (Product_6989586621680451706Sym0 :: TyFun (Maybe a) a -> Type) arg
type Sum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Sum (arg :: Maybe a) = Apply (Sum_6989586621680451693Sym0 :: TyFun (Maybe a) a -> Type) arg
type Minimum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Minimum (arg :: Maybe a) = Apply (Minimum_6989586621680451680Sym0 :: TyFun (Maybe a) a -> Type) arg
type Maximum (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Maximum (arg :: Maybe a) = Apply (Maximum_6989586621680451667Sym0 :: TyFun (Maybe a) a -> Type) arg
type Length (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Length (arg :: Maybe a) = Apply (Length_6989586621680451638Sym0 :: TyFun (Maybe a) Nat -> Type) arg
type Null (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Null (arg :: Maybe a) = Apply (Null_6989586621680451616Sym0 :: TyFun (Maybe a) Bool -> Type) arg
type ToList (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type ToList (arg :: Maybe a) = Apply (ToList_6989586621680451595Sym0 :: TyFun (Maybe a) [a] -> Type) arg
type Fold (arg :: Maybe m)
Instance details Defined in Data.Singletons.Prelude.Foldable type Fold (arg :: Maybe m) = Apply (Fold_6989586621680451412Sym0 :: TyFun (Maybe m) m -> Type) arg
type Pure (a :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Pure (a :: k1) = Apply (Pure_6989586621679607829Sym0 :: TyFun k1 (Maybe k1) -> Type) a
type Fail a2
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fail a2 = Apply (Fail_6989586621679608036Sym0 :: TyFun Symbol (Maybe a1) -> Type) a2
type Return (arg :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Return (arg :: a) = Apply (Return_6989586621679545211Sym0 :: TyFun a (Maybe a) -> Type) arg
type Sequence (arg :: Maybe (m a))
Instance details Defined in Data.Singletons.Prelude.Traversable type Sequence (arg :: Maybe (m a)) = Apply (Sequence_6989586621680748307Sym0 :: TyFun (Maybe (m a)) (m (Maybe a)) -> Type) arg
type SequenceA (arg :: Maybe (f a))
Instance details Defined in Data.Singletons.Prelude.Traversable type SequenceA (arg :: Maybe (f a)) = Apply (SequenceA_6989586621680748282Sym0 :: TyFun (Maybe (f a)) (f (Maybe a)) -> Type) arg
type Elem (arg1 :: a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Elem (arg1 :: a) (arg2 :: Maybe a) = Apply (Apply (Elem_6989586621680451653Sym0 :: TyFun a (Maybe a ~> Bool) -> Type) arg1) arg2
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldl1_6989586621680451585Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) = Apply (Apply (Foldr1_6989586621680451560Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) arg1) arg2
type (a1 :: Maybe a6989586621679544754) <\|> (a2 :: Maybe a6989586621679544754)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679544754) <\|> (a2 :: Maybe a6989586621679544754) = Apply (Apply (TFHelper_6989586621679608129Sym0 :: TyFun (Maybe a6989586621679544754) (Maybe a6989586621679544754 ~> Maybe a6989586621679544754) -> Type) a1) a2
type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mplus_6989586621679545243Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type FoldMap (a1 :: a6989586621680450730 ~> k2) (a2 :: Maybe a6989586621680450730)
Instance details Defined in Data.Singletons.Prelude.Foldable type FoldMap (a1 :: a6989586621680450730 ~> k2) (a2 :: Maybe a6989586621680450730) = Apply (Apply (FoldMap_6989586621680451724Sym0 :: TyFun (a6989586621680450730 ~> k2) (Maybe a6989586621680450730 ~> k2) -> Type) a1) a2
type (a1 :: k1) <$ (a2 :: Maybe b6989586621679544674)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: k1) <$ (a2 :: Maybe b6989586621679544674) = Apply (Apply (TFHelper_6989586621679607700Sym0 :: TyFun k1 (Maybe b6989586621679544674 ~> Maybe k1) -> Type) a1) a2
type Fmap (a1 :: a6989586621679544671 ~> b6989586621679544672) (a2 :: Maybe a6989586621679544671)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Fmap (a1 :: a6989586621679544671 ~> b6989586621679544672) (a2 :: Maybe a6989586621679544671) = Apply (Apply (Fmap_6989586621679607680Sym0 :: TyFun (a6989586621679544671 ~> b6989586621679544672) (Maybe a6989586621679544671 ~> Maybe b6989586621679544672) -> Type) a1) a2
type (arg1 :: Maybe a) <* (arg2 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (arg1 :: Maybe a) <* (arg2 :: Maybe b) = Apply (Apply (TFHelper_6989586621679545167Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe a) -> Type) arg1) arg2
type (a1 :: Maybe a6989586621679544682) *> (a2 :: Maybe b6989586621679544683)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679544682) *> (a2 :: Maybe b6989586621679544683) = Apply (Apply (TFHelper_6989586621679607871Sym0 :: TyFun (Maybe a6989586621679544682) (Maybe b6989586621679544683 ~> Maybe b6989586621679544683) -> Type) a1) a2
type (a1 :: Maybe (a6989586621679544677 ~> b6989586621679544678)) <*> (a2 :: Maybe a6989586621679544677)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe (a6989586621679544677 ~> b6989586621679544678)) <*> (a2 :: Maybe a6989586621679544677) = Apply (Apply (TFHelper_6989586621679607841Sym0 :: TyFun (Maybe (a6989586621679544677 ~> b6989586621679544678)) (Maybe a6989586621679544677 ~> Maybe b6989586621679544678) -> Type) a1) a2
type (a1 :: Maybe a6989586621679544702) >> (a2 :: Maybe b6989586621679544703)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679544702) >> (a2 :: Maybe b6989586621679544703) = Apply (Apply (TFHelper_6989586621679608029Sym0 :: TyFun (Maybe a6989586621679544702) (Maybe b6989586621679544703 ~> Maybe b6989586621679544703) -> Type) a1) a2
type (a1 :: Maybe a6989586621679544700) >>= (a2 :: a6989586621679544700 ~> Maybe b6989586621679544701)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Maybe a6989586621679544700) >>= (a2 :: a6989586621679544700 ~> Maybe b6989586621679544701) = Apply (Apply (TFHelper_6989586621679608013Sym0 :: TyFun (Maybe a6989586621679544700) ((a6989586621679544700 ~> Maybe b6989586621679544701) ~> Maybe b6989586621679544701) -> Type) a1) a2
type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) = Apply (Apply (MapM_6989586621680748297Sym0 :: TyFun (a ~> m b) (Maybe a ~> m (Maybe b)) -> Type) arg1) arg2
type Traverse (a1 :: a6989586621680748240 ~> f6989586621680748239 b6989586621680748241) (a2 :: Maybe a6989586621680748240)
Instance details Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680748240 ~> f6989586621680748239 b6989586621680748241) (a2 :: Maybe a6989586621680748240) = Apply (Apply (Traverse_6989586621680754401Sym0 :: TyFun (a6989586621680748240 ~> f6989586621680748239 b6989586621680748241) (Maybe a6989586621680748240 ~> f6989586621680748239 (Maybe b6989586621680748241)) -> Type) a1) a2
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldl'_6989586621680451534Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldl (a1 :: k2 ~> (a6989586621680450736 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680450736)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldl (a1 :: k2 ~> (a6989586621680450736 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680450736) = Apply (Apply (Apply (Foldl_6989586621680451759Sym0 :: TyFun (k2 ~> (a6989586621680450736 ~> k2)) (k2 ~> (Maybe a6989586621680450736 ~> k2)) -> Type) a1) a2) a3
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) = Apply (Apply (Apply (Foldr'_6989586621680451479Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) arg1) arg2) arg3
type Foldr (a1 :: a6989586621680450731 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680450731)
Instance details Defined in Data.Singletons.Prelude.Foldable type Foldr (a1 :: a6989586621680450731 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680450731) = Apply (Apply (Apply (Foldr_6989586621680451741Sym0 :: TyFun (a6989586621680450731 ~> (k2 ~> k2)) (k2 ~> (Maybe a6989586621680450731 ~> k2)) -> Type) a1) a2) a3
type LiftA2 (a1 :: a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681)) (a2 :: Maybe a6989586621679544679) (a3 :: Maybe b6989586621679544680)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681)) (a2 :: Maybe a6989586621679544679) (a3 :: Maybe b6989586621679544680) = Apply (Apply (Apply (LiftA2_6989586621679607857Sym0 :: TyFun (a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681)) (Maybe a6989586621679544679 ~> (Maybe b6989586621679544680 ~> Maybe c6989586621679544681)) -> Type) a1) a2) a3
type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495349 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495349 :: Maybe a) = IsNothing a6989586621679495349
type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495351 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679495351 :: Maybe a) = IsJust a6989586621679495351
type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679495346 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679495346 :: Maybe a) = FromJust a6989586621679495346
type Apply (Compare_6989586621679390863Sym1 a6989586621679390861 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679390862 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679390863Sym1 a6989586621679390861 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679390862 :: Maybe a) = Compare_6989586621679390863 a6989586621679390861 a6989586621679390862
type Apply (FromMaybeSym1 a6989586621679495336 :: TyFun (Maybe a) a -> Type) (a6989586621679495337 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym1 a6989586621679495336 :: TyFun (Maybe a) a -> Type) (a6989586621679495337 :: Maybe a) = FromMaybe a6989586621679495336 a6989586621679495337
type Apply (Maybe_Sym2 a6989586621679493736 a6989586621679493735 :: TyFun (Maybe a) b -> Type) (a6989586621679493737 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621679493736 a6989586621679493735 :: TyFun (Maybe a) b -> Type) (a6989586621679493737 :: Maybe a) = Maybe_ a6989586621679493736 a6989586621679493735 a6989586621679493737
type Rep (Maybe a)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep (Maybe a) = D1 (MetaData "Maybe" "GHC.Maybe" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
data Sing (b :: Maybe a)
Instance details Defined in GHC.Generics data Sing (b :: Maybe a) where SNothing :: forall a (b :: Maybe a). Sing (Nothing :: Maybe a) SJust :: forall a (b :: Maybe a) (a1 :: a). Sing a1 -> Sing (Just a1)
type DemoteRep (Maybe a)
Instance details Defined in GHC.Generics type DemoteRep (Maybe a) = Maybe (DemoteRep a)
type Index (Maybe a)
Instance details Defined in Control.Lens.At type Index (Maybe a) = ()
type IxValue (Maybe a)
Instance details Defined in Control.Lens.At type IxValue (Maybe a) = a
type ToT (Maybe a)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (Maybe a) = TOption (ToT a)
data Sing (b :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Instances data Sing (b :: Maybe a) where SNothing :: forall a (b :: Maybe a). Sing (Nothing :: Maybe a) SJust :: forall a (b :: Maybe a) (n :: a). Sing n -> Sing (Just n)
type Element (Maybe a)
Instance details Defined in Universum.Container.Class type Element (Maybe a) = ElementDefault (Maybe a)
type Mempty
Instance details Defined in Data.Singletons.Prelude.Monoid type Mempty = (Mempty_6989586621680329268Sym0 :: Maybe a)
type Demote (Maybe a)
Instance details Defined in Data.Singletons.Prelude.Instances type Demote (Maybe a) = Maybe (Demote a)
type Rep1 Maybe	Since: base-4.6.0.0
Instance details Defined in GHC.Generics type Rep1 Maybe = D1 (MetaData "Maybe" "GHC.Maybe" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Mconcat (arg :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Monoid type Mconcat (arg :: [Maybe a]) = Apply (Mconcat_6989586621680329218Sym0 :: TyFun [Maybe a] (Maybe a) -> Type) arg
type Show_ (arg :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Show type Show_ (arg :: Maybe a) = Apply (Show__6989586621680262717Sym0 :: TyFun (Maybe a) Symbol -> Type) arg
type Sconcat (arg :: NonEmpty (Maybe a))
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Sconcat (arg :: NonEmpty (Maybe a)) = Apply (Sconcat_6989586621679810989Sym0 :: TyFun (NonEmpty (Maybe a)) (Maybe a) -> Type) arg
type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Mappend_6989586621680329208Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type ShowList (arg1 :: [Maybe a]) arg2
Instance details Defined in Data.Singletons.Prelude.Show type ShowList (arg1 :: [Maybe a]) arg2 = Apply (Apply (ShowList_6989586621680262728Sym0 :: TyFun [Maybe a] (Symbol ~> Symbol) -> Type) arg1) arg2
type (a2 :: Maybe a1) <> (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type (a2 :: Maybe a1) <> (a3 :: Maybe a1) = Apply (Apply (TFHelper_6989586621679811161Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Maybe a1) -> Type) a2) a3
type Min (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Min (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Min_6989586621679380222Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type Max (arg1 :: Maybe a) (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type Max (arg1 :: Maybe a) (arg2 :: Maybe a) = Apply (Apply (Max_6989586621679380204Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) arg1) arg2
type (arg1 :: Maybe a) >= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) >= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679380186Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) > (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) > (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679380168Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) <= (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) <= (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679380150Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type (arg1 :: Maybe a) < (arg2 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Ord type (arg1 :: Maybe a) < (arg2 :: Maybe a) = Apply (Apply (TFHelper_6989586621679380132Sym0 :: TyFun (Maybe a) (Maybe a ~> Bool) -> Type) arg1) arg2
type Compare (a2 :: Maybe a1) (a3 :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Ord type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) = Apply (Apply (Compare_6989586621679390863Sym0 :: TyFun (Maybe a1) (Maybe a1 ~> Ordering) -> Type) a2) a3
type (x :: Maybe a) /= (y :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Eq type (x :: Maybe a) /= (y :: Maybe a) = Not (x == y)
type (a2 :: Maybe a1) == (b :: Maybe a1)
Instance details Defined in Data.Singletons.Prelude.Eq type (a2 :: Maybe a1) == (b :: Maybe a1) = Equals_6989586621679364702 a2 b
type HKD Maybe (a :: Type)
Instance details Defined in Data.Vinyl.XRec type HKD Maybe (a :: Type) = Maybe a
type ShowsPrec a2 (a3 :: Maybe a1) a4
Instance details Defined in Data.Singletons.Prelude.Show type ShowsPrec a2 (a3 :: Maybe a1) a4 = Apply (Apply (Apply (ShowsPrec_6989586621680280853Sym0 :: TyFun Nat (Maybe a1 ~> (Symbol ~> Symbol)) -> Type) a2) a3) a4
type Apply (Pure_6989586621679607829Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679607828 :: a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Pure_6989586621679607829Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679607828 :: a) = Pure_6989586621679607829 a6989586621679607828
type Apply (Fail_6989586621679608036Sym0 :: TyFun Symbol (Maybe a6989586621679544705) -> Type) (a6989586621679608035 :: Symbol)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fail_6989586621679608036Sym0 :: TyFun Symbol (Maybe a6989586621679544705) -> Type) (a6989586621679608035 :: Symbol) = (Fail_6989586621679608036 a6989586621679608035 :: Maybe a6989586621679544705)
type Apply (Let6989586621679608125LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216796072866989586621679608124 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621679608125LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216796072866989586621679608124 :: k1) = Let6989586621679608125L wild_69895866216796072866989586621679608124
type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679294580 :: a)
Instance details Defined in Data.Singletons.Prelude.Instances type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679294580 :: a) = Just t6989586621679294580
type Apply (Let6989586621680442518MSym1 x6989586621680442516 :: TyFun k (Maybe k1) -> Type) (y6989586621680442517 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442518MSym1 x6989586621680442516 :: TyFun k (Maybe k1) -> Type) (y6989586621680442517 :: k) = Let6989586621680442518M x6989586621680442516 y6989586621680442517
type Apply (Let6989586621680442518NSym1 x6989586621680442516 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680442517 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442518NSym1 x6989586621680442516 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680442517 :: k1) = Let6989586621680442518N x6989586621680442516 y6989586621680442517
type Apply (Let6989586621680442545MSym1 x6989586621680442543 :: TyFun k (Maybe k1) -> Type) (y6989586621680442544 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442545MSym1 x6989586621680442543 :: TyFun k (Maybe k1) -> Type) (y6989586621680442544 :: k) = Let6989586621680442545M x6989586621680442543 y6989586621680442544
type Apply (Let6989586621680442545NSym1 x6989586621680442543 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680442544 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442545NSym1 x6989586621680442543 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680442544 :: k1) = Let6989586621680442545N x6989586621680442543 y6989586621680442544
type Apply (Lambda_6989586621680338811Sym2 k6989586621680338810 a6989586621680338809 :: TyFun k1 (Maybe a) -> Type) (t6989586621680338822 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680338811Sym2 k6989586621680338810 a6989586621680338809 :: TyFun k1 (Maybe a) -> Type) (t6989586621680338822 :: k1) = Lambda_6989586621680338811 k6989586621680338810 a6989586621680338809 t6989586621680338822
type Apply (Lambda_6989586621680338899Sym2 k6989586621680338898 a6989586621680338897 :: TyFun k1 (Maybe a) -> Type) (t6989586621680338910 :: k1)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680338899Sym2 k6989586621680338898 a6989586621680338897 :: TyFun k1 (Maybe a) -> Type) (t6989586621680338910 :: k1) = Lambda_6989586621680338899 k6989586621680338898 a6989586621680338897 t6989586621680338910
type Apply (Let6989586621680451570MfSym3 a6989586621680451571 xs6989586621680451569 f6989586621680451568 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680451572 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451570MfSym3 a6989586621680451571 xs6989586621680451569 f6989586621680451568 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680451572 :: k3) = Let6989586621680451570Mf a6989586621680451571 xs6989586621680451569 f6989586621680451568 a6989586621680451572
type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679495325 :: [Maybe a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679495325 :: [Maybe a]) = CatMaybes a6989586621679495325
type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679495333 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679495333 :: Maybe a) = MaybeToList a6989586621679495333
type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679495330 :: [a])
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679495330 :: [a]) = ListToMaybe a6989586621679495330
type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621679820170 :: Option a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621679820170 :: Option a) = GetOption a6989586621679820170
type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680332716 :: First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680332716 :: First a) = GetFirst a6989586621680332716
type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680332737 :: Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680332737 :: Last a) = GetLast a6989586621680332737
type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621679820173 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621679820173 :: Maybe a) = Option t6989586621679820173
type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680332719 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680332719 :: Maybe a) = First t6989586621680332719
type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680332740 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680332740 :: Maybe a) = Last t6989586621680332740
type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680441739 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680441739 :: Maybe a) = MaxInternal t6989586621680441739
type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680441939 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680441939 :: Maybe a) = MinInternal t6989586621680441939
type Apply (StripPrefixSym1 a6989586621680078627 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680078628 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680078627 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680078628 :: [a]) = StripPrefix a6989586621680078627 a6989586621680078628
type Apply (FindIndexSym1 a6989586621679949619 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621679949620 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym1 a6989586621679949619 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621679949620 :: [a]) = FindIndex a6989586621679949619 a6989586621679949620
type Apply (ElemIndexSym1 a6989586621679949627 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621679949628 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym1 a6989586621679949627 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621679949628 :: [a]) = ElemIndex a6989586621679949627 a6989586621679949628
type Apply (TFHelper_6989586621679608129Sym1 a6989586621679608127 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679608128 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679608129Sym1 a6989586621679608127 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679608128 :: Maybe a) = TFHelper_6989586621679608129 a6989586621679608127 a6989586621679608128
type Apply (FindSym1 a6989586621679949259 :: TyFun [a] (Maybe a) -> Type) (a6989586621679949260 :: [a])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym1 a6989586621679949259 :: TyFun [a] (Maybe a) -> Type) (a6989586621679949260 :: [a]) = Find a6989586621679949259 a6989586621679949260
type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681199065 :: f a)
Instance details Defined in Data.Singletons.Prelude.Applicative type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681199065 :: f a) = Optional a6989586621681199065
type Apply (Fmap_6989586621679607680Sym1 a6989586621679607678 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679607679 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621679607680Sym1 a6989586621679607678 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679607679 :: Maybe a) = Fmap_6989586621679607680 a6989586621679607678 a6989586621679607679
type Apply (TFHelper_6989586621679607700Sym1 a6989586621679607698 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679607699 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679607700Sym1 a6989586621679607698 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679607699 :: Maybe b) = TFHelper_6989586621679607700 a6989586621679607698 a6989586621679607699
type Apply (TFHelper_6989586621679607841Sym1 a6989586621679607839 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679607840 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679607841Sym1 a6989586621679607839 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679607840 :: Maybe a) = TFHelper_6989586621679607841 a6989586621679607839 a6989586621679607840
type Apply (TFHelper_6989586621679607871Sym1 a6989586621679607869 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679607870 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679607871Sym1 a6989586621679607869 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679607870 :: Maybe b) = TFHelper_6989586621679607871 a6989586621679607869 a6989586621679607870
type Apply (TFHelper_6989586621679608029Sym1 a6989586621679608027 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679608028 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679608029Sym1 a6989586621679608027 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679608028 :: Maybe b) = TFHelper_6989586621679608029 a6989586621679608027 a6989586621679608028
type Apply (LookupSym1 a6989586621679949041 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679949042 :: [(a, b)])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym1 a6989586621679949041 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621679949042 :: [(a, b)]) = Lookup a6989586621679949041 a6989586621679949042
type Apply (FindSym1 a6989586621680451093 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680451094 :: t a)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym1 a6989586621680451093 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680451094 :: t a) = Find a6989586621680451093 a6989586621680451094
type Apply (Traverse_6989586621680754401Sym1 a6989586621680754399 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680754400 :: Maybe a)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680754401Sym1 a6989586621680754399 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680754400 :: Maybe a) = Traverse_6989586621680754401 a6989586621680754399 a6989586621680754400
type Apply (LiftA2_6989586621679607857Sym2 a6989586621679607855 a6989586621679607854 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679607856 :: Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621679607857Sym2 a6989586621679607855 a6989586621679607854 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679607856 :: Maybe b) = LiftA2_6989586621679607857 a6989586621679607855 a6989586621679607854 a6989586621679607856
type Apply (Let6989586621680451545MfSym3 a6989586621680451546 xs6989586621680451544 f6989586621680451543 :: TyFun (Maybe k2) (Maybe k3) -> Type) (a6989586621680451547 :: Maybe k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451545MfSym3 a6989586621680451546 xs6989586621680451544 f6989586621680451543 :: TyFun (Maybe k2) (Maybe k3) -> Type) (a6989586621680451547 :: Maybe k2) = Let6989586621680451545Mf a6989586621680451546 xs6989586621680451544 f6989586621680451543 a6989586621680451547
type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) = Eval ((Map (Cons a2) :: Maybe [a1] -> Maybe [a1] -> Type) =<< Init (b ': as))
type Eval (Init (a2 ': ([] :: [a1])) :: Maybe [a1] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init (a2 ': ([] :: [a1])) :: Maybe [a1] -> Type) = Just ([] :: [a1])
type Eval (Init ([] :: [a]) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Init ([] :: [a]) :: Maybe [a] -> Type) = (Nothing :: Maybe [a])
type Eval (Tail (_a ': as) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Tail (_a ': as) :: Maybe [a] -> Type) = Just as
type Eval (Tail ([] :: [a]) :: Maybe [a] -> Type)
Instance details Defined in Fcf.Data.List type Eval (Tail ([] :: [a]) :: Maybe [a] -> Type) = (Nothing :: Maybe [a])
type Eval (Head (a2 ': _as) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) = Just a2
type Eval (Head ([] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Head ([] :: [a]) :: Maybe a -> Type) = (Nothing :: Maybe a)
type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) = Eval (Last (b ': as))
type Eval (Last (a2 ': ([] :: [a1])) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last (a2 ': ([] :: [a1])) :: Maybe a1 -> Type) = Just a2
type Eval (Last ([] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Last ([] :: [a]) :: Maybe a -> Type) = (Nothing :: Maybe a)
type Apply (TFHelper_6989586621679608013Sym1 a6989586621679608011 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679608012 :: a ~> Maybe b)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679608013Sym1 a6989586621679608011 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679608012 :: a ~> Maybe b) = TFHelper_6989586621679608013 a6989586621679608011 a6989586621679608012
type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) = Eval (If (Eval (p a2)) (Pure (Just 0)) ((Map ((+) 1) :: Maybe Nat -> Maybe Nat -> Type) =<< FindIndex p as))
type Eval (FindIndex _p ([] :: [a]) :: Maybe Nat -> Type)
Instance details Defined in Fcf.Data.List type Eval (FindIndex _p ([] :: [a]) :: Maybe Nat -> Type) = (Nothing :: Maybe Nat)
type Eval (NumIter a s :: Maybe (k, Nat) -> Type)
Instance details Defined in Fcf.Data.List type Eval (NumIter a s :: Maybe (k, Nat) -> Type) = If (Eval (s > 0)) (Just ((,) a (s - 1))) (Nothing :: Maybe (k, Nat))
type Eval (Find p (a2 ': as) :: Maybe a1 -> Type)
Instance details Defined in Fcf.Data.List type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) = Eval (If (Eval (p a2)) (Pure (Just a2)) (Find p as))
type Eval (Find _p ([] :: [a]) :: Maybe a -> Type)
Instance details Defined in Fcf.Data.List type Eval (Find _p ([] :: [a]) :: Maybe a -> Type) = (Nothing :: Maybe a)
type Eval (Lookup a as :: Maybe b -> Type)
Instance details Defined in Fcf.Data.List type Eval (Lookup a as :: Maybe b -> Type) = Eval (Map (Snd :: (k, b) -> b -> Type) (Eval (Find ((TyEq a :: k -> Bool -> Type) <=< (Fst :: (k, b) -> k -> Type)) as)))
type Eval (Map f (Just a3) :: Maybe a2 -> Type)
Instance details Defined in Fcf.Classes type Eval (Map f (Just a3) :: Maybe a2 -> Type) = Just (Eval (f a3))
type Eval (Map f (Nothing :: Maybe a) :: Maybe b -> Type)
Instance details Defined in Fcf.Classes type Eval (Map f (Nothing :: Maybe a) :: Maybe b -> Type) = (Nothing :: Maybe b)
type Eval (Just x <\|> _ :: Maybe a -> Type)
Instance details Defined in Util.Fcf type Eval (Just x <\|> _ :: Maybe a -> Type) = Just x
type Eval ((Nothing :: Maybe a) <\|> m :: Maybe a -> Type)
Instance details Defined in Util.Fcf type Eval ((Nothing :: Maybe a) <\|> m :: Maybe a -> Type) = m
type Apply (ElemIndexSym0 :: TyFun a6989586621679939701 ([a6989586621679939701] ~> Maybe Nat) -> Type) (a6989586621679949627 :: a6989586621679939701)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621679939701 ([a6989586621679939701] ~> Maybe Nat) -> Type) (a6989586621679949627 :: a6989586621679939701) = ElemIndexSym1 a6989586621679949627
type Apply (ShowsPrec_6989586621680280853Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680280850 :: Nat)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680280853Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680280850 :: Nat) = (ShowsPrec_6989586621680280853Sym1 a6989586621680280850 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type)
type Apply (FromMaybeSym0 :: TyFun a6989586621679495144 (Maybe a6989586621679495144 ~> a6989586621679495144) -> Type) (a6989586621679495336 :: a6989586621679495144)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621679495144 (Maybe a6989586621679495144 ~> a6989586621679495144) -> Type) (a6989586621679495336 :: a6989586621679495144) = FromMaybeSym1 a6989586621679495336
type Apply (Let6989586621680442518MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680442516 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442518MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680442516 :: k1) = (Let6989586621680442518MSym1 x6989586621680442516 :: TyFun k (Maybe k1) -> Type)
type Apply (Let6989586621680442518NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680442516 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442518NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680442516 :: k) = (Let6989586621680442518NSym1 x6989586621680442516 :: TyFun k1 (Maybe k1) -> Type)
type Apply (Let6989586621680442545MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680442543 :: k1)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442545MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680442543 :: k1) = (Let6989586621680442545MSym1 x6989586621680442543 :: TyFun k (Maybe k1) -> Type)
type Apply (Let6989586621680442545NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680442543 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680442545NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680442543 :: k) = (Let6989586621680442545NSym1 x6989586621680442543 :: TyFun k1 (Maybe k1) -> Type)
type Apply (LookupSym0 :: TyFun a6989586621679939680 ([(a6989586621679939680, b6989586621679939681)] ~> Maybe b6989586621679939681) -> Type) (a6989586621679949041 :: a6989586621679939680)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621679939680 ([(a6989586621679939680, b6989586621679939681)] ~> Maybe b6989586621679939681) -> Type) (a6989586621679949041 :: a6989586621679939680) = (LookupSym1 a6989586621679949041 b6989586621679939681 :: TyFun [(a6989586621679939680, b6989586621679939681)] (Maybe b6989586621679939681) -> Type)
type Apply (TFHelper_6989586621679607700Sym0 :: TyFun a6989586621679544673 (Maybe b6989586621679544674 ~> Maybe a6989586621679544673) -> Type) (a6989586621679607698 :: a6989586621679544673)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679607700Sym0 :: TyFun a6989586621679544673 (Maybe b6989586621679544674 ~> Maybe a6989586621679544673) -> Type) (a6989586621679607698 :: a6989586621679544673) = (TFHelper_6989586621679607700Sym1 a6989586621679607698 b6989586621679544674 :: TyFun (Maybe b6989586621679544674) (Maybe a6989586621679544673) -> Type)
type Apply (Maybe_Sym0 :: TyFun b6989586621679493717 ((a6989586621679493718 ~> b6989586621679493717) ~> (Maybe a6989586621679493718 ~> b6989586621679493717)) -> Type) (a6989586621679493735 :: b6989586621679493717)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621679493717 ((a6989586621679493718 ~> b6989586621679493717) ~> (Maybe a6989586621679493718 ~> b6989586621679493717)) -> Type) (a6989586621679493735 :: b6989586621679493717) = (Maybe_Sym1 a6989586621679493735 a6989586621679493718 :: TyFun (a6989586621679493718 ~> b6989586621679493717) (Maybe a6989586621679493718 ~> b6989586621679493717) -> Type)
type Apply (Lambda_6989586621680338811Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680338809 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680338811Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680338809 :: k) = (Lambda_6989586621680338811Sym1 a6989586621680338809 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type)
type Apply (Lambda_6989586621680338899Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680338897 :: k)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680338899Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680338897 :: k) = (Lambda_6989586621680338899Sym1 a6989586621680338897 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type)
type Apply (Let6989586621680451570MfSym1 f6989586621680451568 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680451569 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451570MfSym1 f6989586621680451568 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680451569 :: k) = Let6989586621680451570MfSym2 f6989586621680451568 xs6989586621680451569
type Apply (Let6989586621680451545MfSym1 f6989586621680451543 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680451544 :: k)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451545MfSym1 f6989586621680451543 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680451544 :: k) = Let6989586621680451545MfSym2 f6989586621680451543 xs6989586621680451544
type Apply (Let6989586621680451545MfSym2 xs6989586621680451544 f6989586621680451543 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) (a6989586621680451546 :: k3)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451545MfSym2 xs6989586621680451544 f6989586621680451543 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) (a6989586621680451546 :: k3) = Let6989586621680451545MfSym3 xs6989586621680451544 f6989586621680451543 a6989586621680451546
type Apply (StripPrefixSym0 :: TyFun [a6989586621680065917] ([a6989586621680065917] ~> Maybe [a6989586621680065917]) -> Type) (a6989586621680078627 :: [a6989586621680065917])
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680065917] ([a6989586621680065917] ~> Maybe [a6989586621680065917]) -> Type) (a6989586621680078627 :: [a6989586621680065917]) = StripPrefixSym1 a6989586621680078627
type Apply (TFHelper_6989586621679608129Sym0 :: TyFun (Maybe a6989586621679544754) (Maybe a6989586621679544754 ~> Maybe a6989586621679544754) -> Type) (a6989586621679608127 :: Maybe a6989586621679544754)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679608129Sym0 :: TyFun (Maybe a6989586621679544754) (Maybe a6989586621679544754 ~> Maybe a6989586621679544754) -> Type) (a6989586621679608127 :: Maybe a6989586621679544754) = TFHelper_6989586621679608129Sym1 a6989586621679608127
type Apply (Compare_6989586621679390863Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679390861 :: Maybe a3530822107858468865)
Instance details Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679390863Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679390861 :: Maybe a3530822107858468865) = Compare_6989586621679390863Sym1 a6989586621679390861
type Apply (TFHelper_6989586621679607841Sym0 :: TyFun (Maybe (a6989586621679544677 ~> b6989586621679544678)) (Maybe a6989586621679544677 ~> Maybe b6989586621679544678) -> Type) (a6989586621679607839 :: Maybe (a6989586621679544677 ~> b6989586621679544678))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679607841Sym0 :: TyFun (Maybe (a6989586621679544677 ~> b6989586621679544678)) (Maybe a6989586621679544677 ~> Maybe b6989586621679544678) -> Type) (a6989586621679607839 :: Maybe (a6989586621679544677 ~> b6989586621679544678)) = TFHelper_6989586621679607841Sym1 a6989586621679607839
type Apply (TFHelper_6989586621679607871Sym0 :: TyFun (Maybe a6989586621679544682) (Maybe b6989586621679544683 ~> Maybe b6989586621679544683) -> Type) (a6989586621679607869 :: Maybe a6989586621679544682)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679607871Sym0 :: TyFun (Maybe a6989586621679544682) (Maybe b6989586621679544683 ~> Maybe b6989586621679544683) -> Type) (a6989586621679607869 :: Maybe a6989586621679544682) = (TFHelper_6989586621679607871Sym1 a6989586621679607869 b6989586621679544683 :: TyFun (Maybe b6989586621679544683) (Maybe b6989586621679544683) -> Type)
type Apply (TFHelper_6989586621679608029Sym0 :: TyFun (Maybe a6989586621679544702) (Maybe b6989586621679544703 ~> Maybe b6989586621679544703) -> Type) (a6989586621679608027 :: Maybe a6989586621679544702)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679608029Sym0 :: TyFun (Maybe a6989586621679544702) (Maybe b6989586621679544703 ~> Maybe b6989586621679544703) -> Type) (a6989586621679608027 :: Maybe a6989586621679544702) = (TFHelper_6989586621679608029Sym1 a6989586621679608027 b6989586621679544703 :: TyFun (Maybe b6989586621679544703) (Maybe b6989586621679544703) -> Type)
type Apply (ShowsPrec_6989586621680280853Sym1 a6989586621680280850 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680280851 :: Maybe a3530822107858468865)
Instance details Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680280853Sym1 a6989586621680280850 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680280851 :: Maybe a3530822107858468865) = ShowsPrec_6989586621680280853Sym2 a6989586621680280850 a6989586621680280851
type Apply (TFHelper_6989586621679608013Sym0 :: TyFun (Maybe a6989586621679544700) ((a6989586621679544700 ~> Maybe b6989586621679544701) ~> Maybe b6989586621679544701) -> Type) (a6989586621679608011 :: Maybe a6989586621679544700)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621679608013Sym0 :: TyFun (Maybe a6989586621679544700) ((a6989586621679544700 ~> Maybe b6989586621679544701) ~> Maybe b6989586621679544701) -> Type) (a6989586621679608011 :: Maybe a6989586621679544700) = (TFHelper_6989586621679608013Sym1 a6989586621679608011 b6989586621679544701 :: TyFun (a6989586621679544700 ~> Maybe b6989586621679544701) (Maybe b6989586621679544701) -> Type)
type Apply (LiftA2_6989586621679607857Sym1 a6989586621679607854 :: TyFun (Maybe a6989586621679544679) (Maybe b6989586621679544680 ~> Maybe c6989586621679544681) -> Type) (a6989586621679607855 :: Maybe a6989586621679544679)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621679607857Sym1 a6989586621679607854 :: TyFun (Maybe a6989586621679544679) (Maybe b6989586621679544680 ~> Maybe c6989586621679544681) -> Type) (a6989586621679607855 :: Maybe a6989586621679544679) = LiftA2_6989586621679607857Sym2 a6989586621679607854 a6989586621679607855
type Apply (Let6989586621680451570MfSym2 xs6989586621680451569 f6989586621680451568 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680451571 :: Maybe k2)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451570MfSym2 xs6989586621680451569 f6989586621680451568 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680451571 :: Maybe k2) = Let6989586621680451570MfSym3 xs6989586621680451569 f6989586621680451568 a6989586621680451571
type Apply (FindSym0 :: TyFun (a6989586621679939702 ~> Bool) ([a6989586621679939702] ~> Maybe a6989586621679939702) -> Type) (a6989586621679949259 :: a6989586621679939702 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindSym0 :: TyFun (a6989586621679939702 ~> Bool) ([a6989586621679939702] ~> Maybe a6989586621679939702) -> Type) (a6989586621679949259 :: a6989586621679939702 ~> Bool) = FindSym1 a6989586621679949259
type Apply (FindIndexSym0 :: TyFun (a6989586621679939699 ~> Bool) ([a6989586621679939699] ~> Maybe Nat) -> Type) (a6989586621679949619 :: a6989586621679939699 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym0 :: TyFun (a6989586621679939699 ~> Bool) ([a6989586621679939699] ~> Maybe Nat) -> Type) (a6989586621679949619 :: a6989586621679939699 ~> Bool) = FindIndexSym1 a6989586621679949619
type Apply (MapMaybeSym0 :: TyFun (a6989586621679495139 ~> Maybe b6989586621679495140) ([a6989586621679495139] ~> [b6989586621679495140]) -> Type) (a6989586621679495306 :: a6989586621679495139 ~> Maybe b6989586621679495140)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621679495139 ~> Maybe b6989586621679495140) ([a6989586621679495139] ~> [b6989586621679495140]) -> Type) (a6989586621679495306 :: a6989586621679495139 ~> Maybe b6989586621679495140) = MapMaybeSym1 a6989586621679495306
type Apply (Fmap_6989586621679607680Sym0 :: TyFun (a6989586621679544671 ~> b6989586621679544672) (Maybe a6989586621679544671 ~> Maybe b6989586621679544672) -> Type) (a6989586621679607678 :: a6989586621679544671 ~> b6989586621679544672)
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621679607680Sym0 :: TyFun (a6989586621679544671 ~> b6989586621679544672) (Maybe a6989586621679544671 ~> Maybe b6989586621679544672) -> Type) (a6989586621679607678 :: a6989586621679544671 ~> b6989586621679544672) = Fmap_6989586621679607680Sym1 a6989586621679607678
type Apply (UnfoldrSym0 :: TyFun (b6989586621679939758 ~> Maybe (a6989586621679939759, b6989586621679939758)) (b6989586621679939758 ~> [a6989586621679939759]) -> Type) (a6989586621679949692 :: b6989586621679939758 ~> Maybe (a6989586621679939759, b6989586621679939758))
Instance details Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621679939758 ~> Maybe (a6989586621679939759, b6989586621679939758)) (b6989586621679939758 ~> [a6989586621679939759]) -> Type) (a6989586621679949692 :: b6989586621679939758 ~> Maybe (a6989586621679939759, b6989586621679939758)) = UnfoldrSym1 a6989586621679949692
type Apply (FindSym0 :: TyFun (a6989586621680450636 ~> Bool) (t6989586621680450635 a6989586621680450636 ~> Maybe a6989586621680450636) -> Type) (a6989586621680451093 :: a6989586621680450636 ~> Bool)
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680450636 ~> Bool) (t6989586621680450635 a6989586621680450636 ~> Maybe a6989586621680450636) -> Type) (a6989586621680451093 :: a6989586621680450636 ~> Bool) = (FindSym1 a6989586621680451093 t6989586621680450635 :: TyFun (t6989586621680450635 a6989586621680450636) (Maybe a6989586621680450636) -> Type)
type Apply (Let6989586621679495313RsSym0 :: TyFun (a6989586621679495139 ~> Maybe k1) (TyFun k (TyFun [a6989586621679495139] [k1] -> Type) -> Type) -> Type) (f6989586621679495310 :: a6989586621679495139 ~> Maybe k1)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679495313RsSym0 :: TyFun (a6989586621679495139 ~> Maybe k1) (TyFun k (TyFun [a6989586621679495139] [k1] -> Type) -> Type) -> Type) (f6989586621679495310 :: a6989586621679495139 ~> Maybe k1) = (Let6989586621679495313RsSym1 f6989586621679495310 :: TyFun k (TyFun [a6989586621679495139] [k1] -> Type) -> Type)
type Apply (Let6989586621680451545MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680451543 :: k3 ~> (k2 ~> k3))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451545MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680451543 :: k3 ~> (k2 ~> k3)) = (Let6989586621680451545MfSym1 f6989586621680451543 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type)
type Apply (Let6989586621680451570MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680451568 :: k2 ~> (k3 ~> k3))
Instance details Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680451570MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680451568 :: k2 ~> (k3 ~> k3)) = (Let6989586621680451570MfSym1 f6989586621680451568 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type)
type Apply (Traverse_6989586621680754401Sym0 :: TyFun (a6989586621680748240 ~> f6989586621680748239 b6989586621680748241) (Maybe a6989586621680748240 ~> f6989586621680748239 (Maybe b6989586621680748241)) -> Type) (a6989586621680754399 :: a6989586621680748240 ~> f6989586621680748239 b6989586621680748241)
Instance details Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680754401Sym0 :: TyFun (a6989586621680748240 ~> f6989586621680748239 b6989586621680748241) (Maybe a6989586621680748240 ~> f6989586621680748239 (Maybe b6989586621680748241)) -> Type) (a6989586621680754399 :: a6989586621680748240 ~> f6989586621680748239 b6989586621680748241) = Traverse_6989586621680754401Sym1 a6989586621680754399
type Apply (LiftA2_6989586621679607857Sym0 :: TyFun (a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681)) (Maybe a6989586621679544679 ~> (Maybe b6989586621679544680 ~> Maybe c6989586621679544681)) -> Type) (a6989586621679607854 :: a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681))
Instance details Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621679607857Sym0 :: TyFun (a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681)) (Maybe a6989586621679544679 ~> (Maybe b6989586621679544680 ~> Maybe c6989586621679544681)) -> Type) (a6989586621679607854 :: a6989586621679544679 ~> (b6989586621679544680 ~> c6989586621679544681)) = LiftA2_6989586621679607857Sym1 a6989586621679607854
type Apply (Maybe_Sym1 a6989586621679493735 a6989586621679493718 :: TyFun (a6989586621679493718 ~> b6989586621679493717) (Maybe a6989586621679493718 ~> b6989586621679493717) -> Type) (a6989586621679493736 :: a6989586621679493718 ~> b6989586621679493717)
Instance details Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679493735 a6989586621679493718 :: TyFun (a6989586621679493718 ~> b6989586621679493717) (Maybe a6989586621679493718 ~> b6989586621679493717) -> Type) (a6989586621679493736 :: a6989586621679493718 ~> b6989586621679493717) = Maybe_Sym2 a6989586621679493735 a6989586621679493736
type Apply (Lambda_6989586621680338811Sym1 a6989586621680338809 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680338810 :: k1 ~> First a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680338811Sym1 a6989586621680338809 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680338810 :: k1 ~> First a) = Lambda_6989586621680338811Sym2 a6989586621680338809 k6989586621680338810
type Apply (Lambda_6989586621680338899Sym1 a6989586621680338897 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680338898 :: k1 ~> Last a)
Instance details Defined in Data.Singletons.Prelude.Monoid type Apply (Lambda_6989586621680338899Sym1 a6989586621680338897 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680338898 :: k1 ~> Last a) = Lambda_6989586621680338899Sym2 a6989586621680338897 k6989586621680338898
type Unwrapped (NamedF Maybe a name)
Instance details Defined in Util.Named type Unwrapped (NamedF Maybe a name) = Maybe a
type ToT (NamedF Maybe a name)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (NamedF Maybe a name) = ToT (Maybe a)

type List = [] Source #

data ContractRef arg #

Since Contract name is used to designate contract code, lets call analogy of TContract type as follows.

Note that type argument always designates an argument of entrypoint. If a contract has explicit default entrypoint (and no root entrypoint), ContractRef referring to it can never have the entire parameter as its type argument.

Constructors

ContractRef
Fields crAddress :: Address crEntryPoint :: SomeEntryPointCall arg

Instances

cp ~ cp' => FromContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> ContractRef cp' Source #
cp ~ cp' => ToContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Value Methods toContractRef :: ContractRef cp' -> ContractRef cp Source #
Eq (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Methods (==) :: ContractRef arg -> ContractRef arg -> Bool # (/=) :: ContractRef arg -> ContractRef arg -> Bool #
Show (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Methods showsPrec :: Int -> ContractRef arg -> ShowS # show :: ContractRef arg -> String # showList :: [ContractRef arg] -> ShowS #
Buildable (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Methods build :: ContractRef arg -> Builder #
PolyTypeHasDocC (cp ': ([] :: [Type])) => TypeHasDoc (ContractRef cp)
Instance details Defined in Michelson.Typed.Haskell.Doc Methods typeDocName :: Proxy (ContractRef cp) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (ContractRef cp) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (ContractRef cp) -> [SomeTypeWithDoc] # typeDocHaskellRep :: TypeDocHaskellRep (ContractRef cp) # typeDocMichelsonRep :: TypeDocMichelsonRep (ContractRef cp) #
IsoValue (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value Associated Types type ToT (ContractRef arg) :: T # Methods toVal :: ContractRef arg -> Value (ToT (ContractRef arg)) # fromVal :: Value (ToT (ContractRef arg)) -> ContractRef arg #
ToAddress (ContractRef cp) Source #
Instance details Defined in Lorentz.Value Methods toAddress :: ContractRef cp -> Address Source #
HasTypeAnn a => HasTypeAnn (ContractRef a) Source #
Instance details Defined in Lorentz.TypeAnns Methods getTypeAnn :: Notes (ToT (ContractRef a)) Source #
type ToT (ContractRef arg)
Instance details Defined in Michelson.Typed.Haskell.Value type ToT (ContractRef arg) = TContract (ToT arg)

newtype TAddress p Source #

Address which remembers the parameter type of the contract it refers to.

It differs from Michelson's contract type because it cannot contain entrypoint, and it always refers to entire contract parameter even if this contract has explicit default entrypoint.

Constructors

TAddress
Fields unTAddress :: Address

Instances

(FailWhen cond msg, cond ~ (CanHaveEntryPoints cp && Not (ParameterEntryPointsDerivation cp == EpdNone)), msg ~ ((((Text "Cannot apply `ToContractRef` to `TAddress`" :$$: Text "Consider using call(Def)TAddress first`") :$$: Text "(or if you know your parameter type is primitive,") :$$: Text " make sure typechecker also knows about that)") :$$: ((Text "For parameter `" :<>: ShowType cp) :<>: Text "`")), cp ~ arg, NiceParameter arg, NiceParameterFull cp, GetDefaultEntryPointArg cp ~ cp) => ToContractRef arg (TAddress cp) Source #
Instance details Defined in Lorentz.Value Methods toContractRef :: TAddress cp -> ContractRef arg Source #
cp ~ cp' => ToTAddress cp (TAddress cp') Source #
Instance details Defined in Lorentz.Value Methods toTAddress :: TAddress cp' -> TAddress cp Source #
CanCastTo Address (TAddress p :: Type) Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: () Source #
CanCastTo (TAddress p :: Type) Address Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: () Source #
Generic (TAddress p) Source #
Instance details Defined in Lorentz.Value Associated Types type Rep (TAddress p) :: Type -> Type # Methods from :: TAddress p -> Rep (TAddress p) x # to :: Rep (TAddress p) x -> TAddress p #
IsoValue (TAddress p) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (TAddress p) :: T # Methods toVal :: TAddress p -> Value (ToT (TAddress p)) # fromVal :: Value (ToT (TAddress p)) -> TAddress p #
ToAddress (TAddress cp) Source #
Instance details Defined in Lorentz.Value Methods toAddress :: TAddress cp -> Address Source #
type Rep (TAddress p) Source #
Instance details Defined in Lorentz.Value type Rep (TAddress p) = D1 (MetaData "TAddress" "Lorentz.Value" "lorentz-0.1.0-1IijY81BuYC4to9wXiBP3G" True) (C1 (MetaCons "TAddress" PrefixI True) (S1 (MetaSel (Just "unTAddress") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Address)))
type ToT (TAddress p) Source #
Instance details Defined in Lorentz.Value type ToT (TAddress p) = GValueType (Rep (TAddress p))

newtype FutureContract arg Source #

Address associated with value of contract arg type.

Places where ContractRef can appear are now severely limited, this type gives you type-safety of ContractRef but still can be used everywhere. This type is not a full-featured one rather a helper; in particular, once pushing it on stack, you cannot return it back to Haskell world.

Note that it refers to an entrypoint of the contract, not just the contract as a whole. In this sense this type differs from TAddress.

Unlike with ContractRef, having this type you still cannot be sure that the referred contract exists and need to perform a lookup before calling it.

Constructors

FutureContract
Fields unFutureContract :: ContractRef arg

Instances

cp ~ cp' => FromContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> FutureContract cp' Source #
(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Value Methods toContractRef :: FutureContract cp' -> ContractRef cp Source #
IsoValue (FutureContract arg) Source #
Instance details Defined in Lorentz.Value Associated Types type ToT (FutureContract arg) :: T # Methods toVal :: FutureContract arg -> Value (ToT (FutureContract arg)) # fromVal :: Value (ToT (FutureContract arg)) -> FutureContract arg #
ToAddress (FutureContract cp) Source #
Instance details Defined in Lorentz.Value Methods toAddress :: FutureContract cp -> Address Source #
CanCastTo (FutureContract p :: Type) EpAddress Source #
Instance details Defined in Lorentz.Coercions Methods castDummy :: () Source #
type ToT (FutureContract arg) Source #
Instance details Defined in Lorentz.Value type ToT (FutureContract arg) = ToT EpAddress

data EpName #

Entrypoint name.

Empty if this entrypoint is default one. Cannot be equal to "default", the reference implementation forbids that. Also, set of allowed characters should be the same as in annotations.

Instances

Eq EpName
Instance details Defined in Michelson.Untyped.EntryPoints Methods (==) :: EpName -> EpName -> Bool # (/=) :: EpName -> EpName -> Bool #
Ord EpName
Instance details Defined in Michelson.Untyped.EntryPoints Methods compare :: EpName -> EpName -> Ordering # (<) :: EpName -> EpName -> Bool # (<=) :: EpName -> EpName -> Bool # (>) :: EpName -> EpName -> Bool # (>=) :: EpName -> EpName -> Bool # max :: EpName -> EpName -> EpName # min :: EpName -> EpName -> EpName #
Show EpName
Instance details Defined in Michelson.Untyped.EntryPoints Methods showsPrec :: Int -> EpName -> ShowS # show :: EpName -> String # showList :: [EpName] -> ShowS #
Arbitrary FieldAnn => Arbitrary EpName
Instance details Defined in Michelson.Untyped.EntryPoints Methods arbitrary :: Gen EpName # shrink :: EpName -> [EpName] #
Default EpName
Instance details Defined in Michelson.Untyped.EntryPoints Methods def :: EpName #
Buildable EpName
Instance details Defined in Michelson.Untyped.EntryPoints Methods build :: EpName -> Builder #

pattern DefEpName :: EpName #

type EntryPointCall param arg = EntryPointCallT (ToT param) (ToT arg) #

type SomeEntryPointCall arg = SomeEntryPointCallT (ToT arg) #

Constructors

toMutez :: Word32 -> Mutez #

Safely create Mutez.

This is recommended way to create Mutez from a numeric literal; you can't construct all valid Mutez values using this function but for small values it works neat.

Warnings displayed when trying to construct invalid Natural or Word literal are hardcoded for these types in GHC implementation, so we can only exploit these existing rules.

mt :: QuasiQuoter #

QuasyQuoter for constructing Michelson strings.

Validity of result will be checked at compile time. Note:

slash must be escaped
newline character must appear as '\n'
use quotes as is
other special characters are not allowed.

timestampFromSeconds :: Integer -> Timestamp #

timestampFromUTCTime :: UTCTime -> Timestamp #

timestampQuote :: QuasiQuoter #

Quote a value of type Timestamp in yyyy-mm-ddThh:mm:ss[.sss]Z format.

>>> formatTimestamp [timestampQuote| 2019-02-21T16:54:12.2344523Z |]
"2019-02-21T16:54:12Z"

Inspired by 'time-quote' library.

Conversions

coerceContractRef :: ToT a ~ ToT b => ContractRef a -> ContractRef b #

Replace type argument of ContractAddr with isomorphic one.

callingTAddress :: forall cp mname. NiceParameterFull cp => TAddress cp -> EntryPointRef mname -> ContractRef (GetEntryPointArgCustom cp mname) Source #

Turn TAddress to ContractRef in Haskell world.

This is an analogy of address to contract convertion in Michelson world, thus you have to supply an entrypoint (or call the default one explicitly).

callingDefTAddress :: forall cp. NiceParameterFull cp => TAddress cp -> ContractRef (GetDefaultEntryPointArg cp) Source #

Specification of callTAddress to call the default entrypoint.

class ToAddress a where Source #

Convert something to Address in Haskell world.

Use this when you want to access state of the contract and are not interested in calling it.

Methods

toAddress :: a -> Address Source #

Instances

ToAddress EpAddress Source #
Instance details Defined in Lorentz.Value Methods toAddress :: EpAddress -> Address Source #
ToAddress Address Source #
Instance details Defined in Lorentz.Value Methods toAddress :: Address -> Address Source #
ToAddress (ContractRef cp) Source #
Instance details Defined in Lorentz.Value Methods toAddress :: ContractRef cp -> Address Source #
ToAddress (FutureContract cp) Source #
Instance details Defined in Lorentz.Value Methods toAddress :: FutureContract cp -> Address Source #
ToAddress (TAddress cp) Source #
Instance details Defined in Lorentz.Value Methods toAddress :: TAddress cp -> Address Source #

class ToTAddress (cp :: Type) (a :: Type) where Source #

Convert something referring to a contract (not specific entrypoint) to TAddress in Haskell world.

Methods

toTAddress :: a -> TAddress cp Source #

Instances

ToTAddress cp Address Source #
Instance details Defined in Lorentz.Value Methods toTAddress :: Address -> TAddress cp Source #
cp ~ cp' => ToTAddress cp (TAddress cp') Source #
Instance details Defined in Lorentz.Value Methods toTAddress :: TAddress cp' -> TAddress cp Source #

class ToContractRef (cp :: Type) (contract :: Type) where Source #

Convert something to ContractRef in Haskell world.

Methods

toContractRef :: HasCallStack => contract -> ContractRef cp Source #

Instances

(NiceParameter cp, cp ~ cp') => ToContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Value Methods toContractRef :: FutureContract cp' -> ContractRef cp Source #
cp ~ cp' => ToContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Value Methods toContractRef :: ContractRef cp' -> ContractRef cp Source #
(FailWhen cond msg, cond ~ (CanHaveEntryPoints cp && Not (ParameterEntryPointsDerivation cp == EpdNone)), msg ~ ((((Text "Cannot apply `ToContractRef` to `TAddress`" :$$: Text "Consider using call(Def)TAddress first`") :$$: Text "(or if you know your parameter type is primitive,") :$$: Text " make sure typechecker also knows about that)") :$$: ((Text "For parameter `" :<>: ShowType cp) :<>: Text "`")), cp ~ arg, NiceParameter arg, NiceParameterFull cp, GetDefaultEntryPointArg cp ~ cp) => ToContractRef arg (TAddress cp) Source #
Instance details Defined in Lorentz.Value Methods toContractRef :: TAddress cp -> ContractRef arg Source #

class FromContractRef (cp :: Type) (contract :: Type) where Source #

Convert something from ContractAddr in Haskell world.

Methods

fromContractRef :: ContractRef cp -> contract Source #

Instances

FromContractRef cp Address Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> Address Source #
FromContractRef cp EpAddress Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> EpAddress Source #
cp ~ cp' => FromContractRef cp (FutureContract cp') Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> FutureContract cp' Source #
cp ~ cp' => FromContractRef cp (ContractRef cp') Source #
Instance details Defined in Lorentz.Value Methods fromContractRef :: ContractRef cp -> ContractRef cp' Source #

convertContractRef :: forall cp contract2 contract1. (ToContractRef cp contract1, FromContractRef cp contract2) => contract1 -> contract2 Source #

Misc

class Default a where #

A class for types with a default value.

Minimal complete definition

Nothing

Methods

def :: a #

The default value for this type.

Instances

Default Double
Instance details Defined in Data.Default.Class Methods def :: Double #
Default Float
Instance details Defined in Data.Default.Class Methods def :: Float #
Default Int
Instance details Defined in Data.Default.Class Methods def :: Int #
Default Int8
Instance details Defined in Data.Default.Class Methods def :: Int8 #
Default Int16
Instance details Defined in Data.Default.Class Methods def :: Int16 #
Default Int32
Instance details Defined in Data.Default.Class Methods def :: Int32 #
Default Int64
Instance details Defined in Data.Default.Class Methods def :: Int64 #
Default Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
Default Ordering
Instance details Defined in Data.Default.Class Methods def :: Ordering #
Default Word
Instance details Defined in Data.Default.Class Methods def :: Word #
Default Word8
Instance details Defined in Data.Default.Class Methods def :: Word8 #
Default Word16
Instance details Defined in Data.Default.Class Methods def :: Word16 #
Default Word32
Instance details Defined in Data.Default.Class Methods def :: Word32 #
Default Word64
Instance details Defined in Data.Default.Class Methods def :: Word64 #
Default ()
Instance details Defined in Data.Default.Class Methods def :: () #
Default All
Instance details Defined in Data.Default.Class Methods def :: All #
Default Any
Instance details Defined in Data.Default.Class Methods def :: Any #
Default CShort
Instance details Defined in Data.Default.Class Methods def :: CShort #
Default CUShort
Instance details Defined in Data.Default.Class Methods def :: CUShort #
Default CInt
Instance details Defined in Data.Default.Class Methods def :: CInt #
Default CUInt
Instance details Defined in Data.Default.Class Methods def :: CUInt #
Default CLong
Instance details Defined in Data.Default.Class Methods def :: CLong #
Default CULong
Instance details Defined in Data.Default.Class Methods def :: CULong #
Default CLLong
Instance details Defined in Data.Default.Class Methods def :: CLLong #
Default CULLong
Instance details Defined in Data.Default.Class Methods def :: CULLong #
Default CFloat
Instance details Defined in Data.Default.Class Methods def :: CFloat #
Default CDouble
Instance details Defined in Data.Default.Class Methods def :: CDouble #
Default CPtrdiff
Instance details Defined in Data.Default.Class Methods def :: CPtrdiff #
Default CSize
Instance details Defined in Data.Default.Class Methods def :: CSize #
Default CSigAtomic
Instance details Defined in Data.Default.Class Methods def :: CSigAtomic #
Default CClock
Instance details Defined in Data.Default.Class Methods def :: CClock #
Default CTime
Instance details Defined in Data.Default.Class Methods def :: CTime #
Default CUSeconds
Instance details Defined in Data.Default.Class Methods def :: CUSeconds #
Default CSUSeconds
Instance details Defined in Data.Default.Class Methods def :: CSUSeconds #
Default CIntPtr
Instance details Defined in Data.Default.Class Methods def :: CIntPtr #
Default CUIntPtr
Instance details Defined in Data.Default.Class Methods def :: CUIntPtr #
Default CIntMax
Instance details Defined in Data.Default.Class Methods def :: CIntMax #
Default CUIntMax
Instance details Defined in Data.Default.Class Methods def :: CUIntMax #
Default MorleyLogs
Instance details Defined in Michelson.Interpret Methods def :: MorleyLogs #
Default OptimizerConf
Instance details Defined in Michelson.Optimizer Methods def :: OptimizerConf #
Default EpName
Instance details Defined in Michelson.Untyped.EntryPoints Methods def :: EpName #
Default Pos
Instance details Defined in Michelson.ErrorPos Methods def :: Pos #
Default SrcPos
Instance details Defined in Michelson.ErrorPos Methods def :: SrcPos #
Default InstrCallStack
Instance details Defined in Michelson.ErrorPos Methods def :: InstrCallStack #
Default [a]
Instance details Defined in Data.Default.Class Methods def :: [a] #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
Integral a => Default (Ratio a)
Instance details Defined in Data.Default.Class Methods def :: Ratio a #
Default a => Default (IO a)
Instance details Defined in Data.Default.Class Methods def :: IO a #
(Default a, RealFloat a) => Default (Complex a)
Instance details Defined in Data.Default.Class Methods def :: Complex a #
Default (First a)
Instance details Defined in Data.Default.Class Methods def :: First a #
Default (Last a)
Instance details Defined in Data.Default.Class Methods def :: Last a #
Default a => Default (Dual a)
Instance details Defined in Data.Default.Class Methods def :: Dual a #
Default (Endo a)
Instance details Defined in Data.Default.Class Methods def :: Endo a #
Num a => Default (Sum a)
Instance details Defined in Data.Default.Class Methods def :: Sum a #
Num a => Default (Product a)
Instance details Defined in Data.Default.Class Methods def :: Product a #
Default (DfsSettings x)
Instance details Defined in Michelson.Typed.Util Methods def :: DfsSettings x #
Default (UStore a) Source #
Instance details Defined in Lorentz.UStore.Types Methods def :: UStore a #
Default (Store a) Source #
Instance details Defined in Lorentz.Store Methods def :: Store a #
Default r => Default (e -> r)
Instance details Defined in Data.Default.Class Methods def :: e -> r #
(Default a, Default b) => Default (a, b)
Instance details Defined in Data.Default.Class Methods def :: (a, b) #
Default (BigMap k v)
Instance details Defined in Michelson.Typed.Haskell.Value Methods def :: BigMap k v #
Default (Annotation tag)
Instance details Defined in Michelson.Untyped.Annotation Methods def :: Annotation tag #
Default (k \|~> v) Source #
Instance details Defined in Lorentz.UStore.Types Methods def :: k \|~> v #
Default other => Default (StorageSkeleton storeTemplate other) Source #
Instance details Defined in Lorentz.Store Methods def :: StorageSkeleton storeTemplate other #
(Default a, Default b, Default c) => Default (a, b, c)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c) #
(Default a, Default b, Default c, Default d) => Default (a, b, c, d)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d) #
(Default a, Default b, Default c, Default d, Default e) => Default (a, b, c, d, e)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e) #
(Default a, Default b, Default c, Default d, Default e, Default f) => Default (a, b, c, d, e, f)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e, f) #
(Default a, Default b, Default c, Default d, Default e, Default f, Default g) => Default (a, b, c, d, e, f, g)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e, f, g) #

data Label (a :: Symbol) #

Proxy for label type

Constructors

Label

Instances

s ~ s' => IsLabel s (Label s')
Instance details Defined in Data.Vinyl.Derived Methods fromLabel :: Label s' #
Eq (Label a)
Instance details Defined in Data.Vinyl.Derived Methods (==) :: Label a -> Label a -> Bool # (/=) :: Label a -> Label a -> Bool #
Show (Label a)
Instance details Defined in Data.Vinyl.Derived Methods showsPrec :: Int -> Label a -> ShowS # show :: Label a -> String # showList :: [Label a] -> ShowS #