Safe Haskell | None |
---|---|
Language | Haskell98 |
Shelley.Spec.Ledger.STS.PoolReap
Synopsis
- data POOLREAP era
- data PoolreapState era = PoolreapState {}
- type family PredicateFailure a = (b :: Type) | b -> a
- data PoolreapPredicateFailure era
Documentation
Instances
data PoolreapState era Source #
Constructors
PoolreapState | |
Instances
ShelleyBased era => Show (PoolreapState era) Source # | |
Defined in Shelley.Spec.Ledger.STS.PoolReap Methods showsPrec :: Int -> PoolreapState era -> ShowS # show :: PoolreapState era -> String # showList :: [PoolreapState era] -> ShowS # |
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, PredicateFailure
s 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 PredicateFailure
s 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.
Instances
data PoolreapPredicateFailure era Source #