Safe Haskell	Safe-Inferred
Language	Haskell2010

Language.REST.WQOConstraints.ADT

Synopsis

data ConstraintsADT a
- = Sat (WQO a)
- | Unsat
- | Union (ConstraintsADT a) (ConstraintsADT a)
- | Intersect (ConstraintsADT a) (ConstraintsADT a)
addConstraint :: (Ord a, Hashable a) => WQO a -> ConstraintsADT a -> ConstraintsADT a
adtOC :: (Handle, Handle) -> WQOConstraints ConstraintsADT IO
intersect :: (Eq a, Ord a, Hashable a) => ConstraintsADT a -> ConstraintsADT a -> ConstraintsADT a
union :: Eq a => ConstraintsADT a -> ConstraintsADT a -> ConstraintsADT a

Documentation

data ConstraintsADT a Source #

Represents constraints over a WQO on a

Constructors

Sat (WQO a)	`Sat wqo` represents satisfiable constraints: those that permit each relation in `wqo`.
Unsat
Union (ConstraintsADT a) (ConstraintsADT a)	`Union c1 c2` permits orderings of P1 and orderings of P2
Intersect (ConstraintsADT a) (ConstraintsADT a)	`Intersect c1 c2` permits orderings iff permitted by P1 and permitted by P2

Instances

Instances details

Generic (ConstraintsADT a) Source #
Instance details Defined in Language.REST.WQOConstraints.ADT Associated Types type Rep (ConstraintsADT a) :: Type -> Type # Methods from :: ConstraintsADT a -> Rep (ConstraintsADT a) x # to :: Rep (ConstraintsADT a) x -> ConstraintsADT a #
(Eq a, Hashable a, Show a) => Show (ConstraintsADT a) Source #
Instance details Defined in Language.REST.WQOConstraints.ADT Methods showsPrec :: Int -> ConstraintsADT a -> ShowS # show :: ConstraintsADT a -> String # showList :: [ConstraintsADT a] -> ShowS #
Eq a => Eq (ConstraintsADT a) Source #
Instance details Defined in Language.REST.WQOConstraints.ADT Methods (==) :: ConstraintsADT a -> ConstraintsADT a -> Bool # (/=) :: ConstraintsADT a -> ConstraintsADT a -> Bool #
Ord a => Ord (ConstraintsADT a) Source #
Instance details Defined in Language.REST.WQOConstraints.ADT Methods compare :: ConstraintsADT a -> ConstraintsADT a -> Ordering # (<) :: ConstraintsADT a -> ConstraintsADT a -> Bool # (<=) :: ConstraintsADT a -> ConstraintsADT a -> Bool # (>) :: ConstraintsADT a -> ConstraintsADT a -> Bool # (>=) :: ConstraintsADT a -> ConstraintsADT a -> Bool # max :: ConstraintsADT a -> ConstraintsADT a -> ConstraintsADT a # min :: ConstraintsADT a -> ConstraintsADT a -> ConstraintsADT a #
Hashable a => Hashable (ConstraintsADT a) Source #
Instance details Defined in Language.REST.WQOConstraints.ADT Methods hashWithSalt :: Int -> ConstraintsADT a -> Int # hash :: ConstraintsADT a -> Int #
ToSMTVar a Int => ToSMT (ConstraintsADT a) Bool Source #
Instance details Defined in Language.REST.WQOConstraints.ADT Methods toSMT :: ConstraintsADT a -> SMTExpr Bool Source #
type Rep (ConstraintsADT a) Source #
Instance details Defined in Language.REST.WQOConstraints.ADT type Rep (ConstraintsADT a)

addConstraint :: (Ord a, Hashable a) => WQO a -> ConstraintsADT a -> ConstraintsADT a Source #

addConstraint o c strengthes c to also contain every relation in o

adtOC :: (Handle, Handle) -> WQOConstraints ConstraintsADT IO Source #

See ConstraintsADT

intersect :: (Eq a, Ord a, Hashable a) => ConstraintsADT a -> ConstraintsADT a -> ConstraintsADT a Source #

intersect c1 c2 permits orderings iff permitted by P1 and permitted by P2

union :: Eq a => ConstraintsADT a -> ConstraintsADT a -> ConstraintsADT a Source #

union c1 c2 permits orderings of P1 and orderings of P2