Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- newtype DNF a = DNF (Set (Disjunct a))
- newtype Disjunct a = Disjunct (Set a)
- pattern SingleDisjunct :: Ord a => Disjunct a -> DNF a
- pattern TopDNF :: DNF a
- pattern BottomDNF :: DNF a
- pattern LiteralDNF :: Ord a => a -> DNF a
- foldDNF :: BoundedLattice l => (a -> l) -> DNF a -> l
- forDNF :: (BoundedLattice l, Applicative f) => (a -> f l) -> DNF a -> f l
Documentation
A boolean formula (without "not") represented as a Disjunctive Normal Form: the formula is a disjunction of a set of clauses, each of which is a conjunction of a set of some elementary formulas. Invariant: no two disjuncts imply eachother
Instances
Eq a => Eq (DNF a) Source # | |
Ord a => Ord (DNF a) Source # | |
Show a => Show (DNF a) Source # | |
Ord a => Lattice (DNF a) Source # | |
Ord a => BoundedJoinSemiLattice (DNF a) Source # | |
Defined in Data.OpenApi.Compare.Validate.Schema.DNF | |
Ord a => BoundedMeetSemiLattice (DNF a) Source # | |
Defined in Data.OpenApi.Compare.Validate.Schema.DNF |
Instances
Eq a => Eq (Disjunct a) Source # | |
Ord a => Ord (Disjunct a) Source # | |
Defined in Data.OpenApi.Compare.Validate.Schema.DNF | |
Show a => Show (Disjunct a) Source # | |
pattern LiteralDNF :: Ord a => a -> DNF a Source #
foldDNF :: BoundedLattice l => (a -> l) -> DNF a -> l Source #
forDNF :: (BoundedLattice l, Applicative f) => (a -> f l) -> DNF a -> f l Source #