| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Byron.Spec.Ledger.STS.UTXO
Description
UTXO transition system
Documentation
Instances
| Data UTXO Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UTXO -> c UTXO # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UTXO # dataTypeOf :: UTXO -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UTXO) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UTXO) # gmapT :: (forall b. Data b => b -> b) -> UTXO -> UTXO # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UTXO -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UTXO -> r # gmapQ :: (forall d. Data d => d -> u) -> UTXO -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UTXO -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UTXO -> m UTXO # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UTXO -> m UTXO # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UTXO -> m UTXO # | |
| STS UTXO Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO Associated Types type Environment UTXO Source # type BaseM UTXO :: Type -> Type Source # type PredicateFailure UTXO = (b :: Type) Source # Methods initialRules :: [InitialRule UTXO] Source # transitionRules :: [TransitionRule UTXO] Source # assertions :: [Assertion UTXO] Source # renderAssertionViolation :: AssertionViolation UTXO -> String Source # | |
| Embed UTXO UTXOW Source # | |
Defined in Byron.Spec.Ledger.STS.UTXOW Methods wrapFailed :: PredicateFailure UTXO -> PredicateFailure UTXOW Source # | |
| type PredicateFailure UTXO Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO | |
| type BaseM UTXO Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO | |
| type Environment UTXO Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO | |
| type Signal UTXO Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO | |
| type State UTXO Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO | |
Instances
| Eq UTxOEnv Source # | |
| Show UTxOEnv Source # | |
| Generic UTxOEnv Source # | |
| SeedGoblin UTxOEnv Source # | |
| NoThunks UTxOEnv Source # | |
| type Rep UTxOEnv Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO type Rep UTxOEnv = D1 ('MetaData "UTxOEnv" "Byron.Spec.Ledger.STS.UTXO" "byron-spec-ledger-0.1.0.0-Jv8hCFfyCTLBIAVZyJNMgt" 'False) (C1 ('MetaCons "UTxOEnv" 'PrefixI 'True) (S1 ('MetaSel ('Just "utxo0") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 UTxO) :*: S1 ('MetaSel ('Just "pps") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 PParams))) | |
Instances
| Eq UTxOState Source # | |
| Show UTxOState Source # | |
| Generic UTxOState Source # | |
| SeedGoblin UTxOState Source # | |
| NoThunks UTxOState Source # | |
| type Rep UTxOState Source # | |
Defined in Byron.Spec.Ledger.STS.UTXO type Rep UTxOState = D1 ('MetaData "UTxOState" "Byron.Spec.Ledger.STS.UTXO" "byron-spec-ledger-0.1.0.0-Jv8hCFfyCTLBIAVZyJNMgt" 'False) (C1 ('MetaCons "UTxOState" 'PrefixI 'True) (S1 ('MetaSel ('Just "utxo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 UTxO) :*: S1 ('MetaSel ('Just "reserves") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedStrict) (Rec0 Lovelace))) | |
data UtxoPredicateFailure Source #
These PredicateFailures are all "throwable". The disjunction of the
rules' preconditions is not True - the PredicateFailures represent
False cases.
Constructors
| EmptyTxInputs | |
| EmptyTxOutputs | |
| FeeTooLow | |
| IncreasedTotalBalance | |
| InputsNotInUTxO | |
| NonPositiveOutputs |
Instances
type family PredicateFailure a = (b :: Type) | b -> a Source #
Descriptive type for the possible failures which might cause a transition to fail.
As a convention, PredicateFailures which are "structural" (meaning that
they are not "throwable" in practice, and are used to pass control from
one transition rule to another) are prefixed with S_.
Structural PredicateFailures represent conditions between rules where
the disjunction of all rules' preconditions is equal to True. That is,
either one rule will throw a structural PredicateFailure and the other
will succeed, or vice-versa.