smcdel-1.3.0: Symbolic Model Checking for Dynamic Epistemic Logic
Safe HaskellSafe-Inferred
LanguageHaskell2010

SMCDEL.Internal.Help

Synopsis

Documentation

alleq :: Eq a => [a] -> Bool Source #

alleqWith :: Eq b => (a -> b) -> [a] -> Bool Source #

anydiff :: Eq a => [a] -> Bool Source #

anydiffWith :: Eq b => (a -> b) -> [a] -> Bool Source #

alldiff :: Eq a => [a] -> Bool Source #

groupSortWith :: (Eq a, Ord b) => (a -> b) -> [a] -> [[a]] Source #

apply :: Show a => Show b => Eq a => Rel a b -> a -> b Source #

(!) :: Show a => Show b => Eq a => Rel a b -> a -> b Source #

set :: Eq a => Rel a b -> a -> b -> Rel a b Source #

applyPartial :: Eq a => [(a, a)] -> a -> a Source #

(!=) :: Eq a => [(a, a)] -> a -> a Source #

powerset :: [a] -> [[a]] Source #

restrict :: Ord a => [a] -> Erel a -> Erel a Source #

rtc :: (Ord a, Eq a) => Rel a a -> Rel a a Source #

tc :: (Ord a, Eq a) => Rel a a -> Rel a a Source #

type Erel a = [[a]] Source #

An equivalence relation given by equivalence classes, as a list of lists.

bl :: Eq a => Erel a -> a -> [a] Source #

fusion :: Ord a => [[a]] -> Erel a Source #

intersection :: Ord a => [a] -> [Erel a] -> Erel a Source #

seteq :: Ord a => [a] -> [a] -> Bool Source #

subseteq :: Eq a => [a] -> [a] -> Bool Source #

lfp :: Eq a => (a -> a) -> a -> a Source #