logic-classes-1.5.3: Framework for propositional and first order logic, theorem proving
Data.Logic.Harrison.Lib
tests :: Test Source
setAny :: forall a. Ord a => (a -> Bool) -> Set a -> Bool Source
setAll :: forall a. Ord a => (a -> Bool) -> Set a -> Bool Source
tryfind :: (t -> Failing a) -> [t] -> Failing a Source
settryfind :: (t -> Failing a) -> Set t -> Failing a Source
(|=>) :: Ord k => k -> a -> Map k a Source
(|->) :: Ord k => k -> a -> Map k a -> Map k a Source
fpf :: Ord a => Map a b -> a -> Maybe b Source
defined :: Ord t => Map t a -> t -> Bool Source
apply :: Ord k => Map k a -> k -> Maybe a Source
exists :: (a -> Bool) -> [a] -> Bool Source
tryApplyD :: Ord k => Map k a -> k -> a -> a Source
allpairs :: forall a b c. Ord c => (a -> b -> c) -> Set a -> Set b -> Set c Source
distrib' :: Ord a => Set (Set a) -> Set (Set a) -> Set (Set a) Source
image :: (Ord b, Ord a) => (a -> b) -> Set a -> Set b Source
optimize :: forall a b. (b -> b -> Bool) -> (a -> b) -> [a] -> Maybe a Source
minimize :: forall a b. Ord b => (a -> b) -> [a] -> Maybe a Source
maximize :: forall a b. Ord b => (a -> b) -> [a] -> Maybe a Source
optimize' :: forall a b. (b -> b -> Bool) -> (a -> b) -> Set a -> Maybe a Source
minimize' :: forall a b. Ord b => (a -> b) -> Set a -> Maybe a Source
maximize' :: forall a b. Ord b => (a -> b) -> Set a -> Maybe a Source
can :: (t -> Failing a) -> t -> Bool Source
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 b Source
(∅) :: Set a Source