Copyright | (c) Masahiro Sakai 2016 |
---|---|
License | BSD-style |
Maintainer | masahiro.sakai@gmail.com |
Stability | experimental |
Portability | portable |
Safe Haskell | None |
Language | Haskell2010 |
Reference:
- Albert Oliveras and Enric Rodriguez-Carbonell. “General overview of a T-Solver for Difference Logic”. https://www.cs.upc.edu/~oliveras/TDV/dl.pdf
Documentation
data SimpleAtom v b Source #
a :- b :<= k
represents a - b ≤ k
Instances
(Eq v, Eq b) => Eq (SimpleAtom v b) Source # | |
Defined in ToySolver.Arith.DifferenceLogic (==) :: SimpleAtom v b -> SimpleAtom v b -> Bool # (/=) :: SimpleAtom v b -> SimpleAtom v b -> Bool # | |
(Ord v, Ord b) => Ord (SimpleAtom v b) Source # | |
Defined in ToySolver.Arith.DifferenceLogic compare :: SimpleAtom v b -> SimpleAtom v b -> Ordering # (<) :: SimpleAtom v b -> SimpleAtom v b -> Bool # (<=) :: SimpleAtom v b -> SimpleAtom v b -> Bool # (>) :: SimpleAtom v b -> SimpleAtom v b -> Bool # (>=) :: SimpleAtom v b -> SimpleAtom v b -> Bool # max :: SimpleAtom v b -> SimpleAtom v b -> SimpleAtom v b # min :: SimpleAtom v b -> SimpleAtom v b -> SimpleAtom v b # | |
(Show v, Show b) => Show (SimpleAtom v b) Source # | |
Defined in ToySolver.Arith.DifferenceLogic showsPrec :: Int -> SimpleAtom v b -> ShowS # show :: SimpleAtom v b -> String # showList :: [SimpleAtom v b] -> ShowS # |