logic-classes-1.4.7: Framework for propositional and first order logic, theorem proving
Data.Logic.Harrison.Lib
tests :: TestSource
setAny :: forall a. Ord a => (a -> Bool) -> Set a -> BoolSource
setAll :: forall a. Ord a => (a -> Bool) -> Set a -> BoolSource
tryfind :: (t -> Failing a) -> [t] -> Failing aSource
settryfind :: (t -> Failing a) -> Set t -> Failing aSource
(|=>) :: Ord k => k -> a -> Map k aSource
(|->) :: Ord k => k -> a -> Map k a -> Map k aSource
fpf :: Ord a => Map a b -> a -> Maybe bSource
defined :: Ord t => Map t a -> t -> BoolSource
apply :: Ord k => Map k a -> k -> Maybe aSource
exists :: (a -> Bool) -> [a] -> BoolSource
tryApplyD :: Ord k => Map k a -> k -> a -> aSource
allpairs :: forall a b c. Ord c => (a -> b -> c) -> Set a -> Set b -> Set cSource
distrib' :: Ord a => Set (Set a) -> Set (Set a) -> Set (Set a)Source
image :: (Ord b, Ord a) => (a -> b) -> Set a -> Set bSource
optimize :: forall a b. (b -> b -> Bool) -> (a -> b) -> [a] -> Maybe aSource
minimize :: forall a b. Ord b => (a -> b) -> [a] -> Maybe aSource
maximize :: forall a b. Ord b => (a -> b) -> [a] -> Maybe aSource
optimize' :: forall a b. (b -> b -> Bool) -> (a -> b) -> Set a -> Maybe aSource
minimize' :: forall a b. Ord b => (a -> b) -> Set a -> Maybe aSource
maximize' :: forall a b. Ord b => (a -> b) -> Set a -> Maybe aSource
can :: (t -> Failing a) -> t -> BoolSource
allsets :: forall a b. (Num a, Eq a, Ord b) => a -> Set b -> Set (Set b)Source
allsubsets :: forall a. Ord a => Set a -> Set (Set a)Source
allnonemptysubsets :: forall a. Ord a => Set a -> Set (Set a)Source
mapfilter :: (a -> Failing b) -> [a] -> [b]Source
setmapfilter :: Ord b => (a -> Failing b) -> Set a -> Set bSource
(∅) :: Set aSource