tamarin-prover-utils-1.2.2: Utility library for the tamarin prover.

Copyright(c) 2010 Benedikt Schmidt
LicenseGPL v3 (see LICENSE)
MaintainerBenedikt Schmidt <beschmi@gmail.com>
PortabilityGHC only
Safe HaskellNone
LanguageHaskell98

Logic.Connectives

Description

Types and instances to handle series of disjunctions and conjunctions.

Synopsis

Documentation

newtype Conj a #

A conjunction of atoms of type a.

Constructors

Conj 

Fields

Instances

Monad Conj # 

Methods

(>>=) :: Conj a -> (a -> Conj b) -> Conj b #

(>>) :: Conj a -> Conj b -> Conj b #

return :: a -> Conj a #

fail :: String -> Conj a #

Functor Conj # 

Methods

fmap :: (a -> b) -> Conj a -> Conj b #

(<$) :: a -> Conj b -> Conj a #

Applicative Conj # 

Methods

pure :: a -> Conj a #

(<*>) :: Conj (a -> b) -> Conj a -> Conj b #

(*>) :: Conj a -> Conj b -> Conj b #

(<*) :: Conj a -> Conj b -> Conj a #

Foldable Conj # 

Methods

fold :: Monoid m => Conj m -> m #

foldMap :: Monoid m => (a -> m) -> Conj a -> m #

foldr :: (a -> b -> b) -> b -> Conj a -> b #

foldr' :: (a -> b -> b) -> b -> Conj a -> b #

foldl :: (b -> a -> b) -> b -> Conj a -> b #

foldl' :: (b -> a -> b) -> b -> Conj a -> b #

foldr1 :: (a -> a -> a) -> Conj a -> a #

foldl1 :: (a -> a -> a) -> Conj a -> a #

toList :: Conj a -> [a] #

null :: Conj a -> Bool #

length :: Conj a -> Int #

elem :: Eq a => a -> Conj a -> Bool #

maximum :: Ord a => Conj a -> a #

minimum :: Ord a => Conj a -> a #

sum :: Num a => Conj a -> a #

product :: Num a => Conj a -> a #

Traversable Conj # 

Methods

traverse :: Applicative f => (a -> f b) -> Conj a -> f (Conj b) #

sequenceA :: Applicative f => Conj (f a) -> f (Conj a) #

mapM :: Monad m => (a -> m b) -> Conj a -> m (Conj b) #

sequence :: Monad m => Conj (m a) -> m (Conj a) #

Alternative Conj # 

Methods

empty :: Conj a #

(<|>) :: Conj a -> Conj a -> Conj a #

some :: Conj a -> Conj [a] #

many :: Conj a -> Conj [a] #

MonadPlus Conj # 

Methods

mzero :: Conj a #

mplus :: Conj a -> Conj a -> Conj a #

Eq a => Eq (Conj a) # 

Methods

(==) :: Conj a -> Conj a -> Bool #

(/=) :: Conj a -> Conj a -> Bool #

Data a => Data (Conj a) # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Conj a -> c (Conj a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Conj a) #

toConstr :: Conj a -> Constr #

dataTypeOf :: Conj a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Conj a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Conj a)) #

gmapT :: (forall b. Data b => b -> b) -> Conj a -> Conj a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Conj a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Conj a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Conj a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Conj a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Conj a -> m (Conj a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Conj a -> m (Conj a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Conj a -> m (Conj a) #

Ord a => Ord (Conj a) # 

Methods

compare :: Conj a -> Conj a -> Ordering #

(<) :: Conj a -> Conj a -> Bool #

(<=) :: Conj a -> Conj a -> Bool #

(>) :: Conj a -> Conj a -> Bool #

(>=) :: Conj a -> Conj a -> Bool #

max :: Conj a -> Conj a -> Conj a #

min :: Conj a -> Conj a -> Conj a #

Show a => Show (Conj a) # 

Methods

showsPrec :: Int -> Conj a -> ShowS #

show :: Conj a -> String #

showList :: [Conj a] -> ShowS #

Monoid (Conj a) # 

Methods

mempty :: Conj a #

mappend :: Conj a -> Conj a -> Conj a #

mconcat :: [Conj a] -> Conj a #

Binary a => Binary (Conj a) # 

Methods

put :: Conj a -> Put #

get :: Get (Conj a) #

putList :: [Conj a] -> Put #

NFData a => NFData (Conj a) # 

Methods

rnf :: Conj a -> () #

newtype Disj a #

A disjunction of atoms of type a.

Constructors

Disj 

Fields

Instances

Monad Disj # 

Methods

(>>=) :: Disj a -> (a -> Disj b) -> Disj b #

(>>) :: Disj a -> Disj b -> Disj b #

return :: a -> Disj a #

fail :: String -> Disj a #

Functor Disj # 

Methods

fmap :: (a -> b) -> Disj a -> Disj b #

(<$) :: a -> Disj b -> Disj a #

Applicative Disj # 

Methods

pure :: a -> Disj a #

(<*>) :: Disj (a -> b) -> Disj a -> Disj b #

(*>) :: Disj a -> Disj b -> Disj b #

(<*) :: Disj a -> Disj b -> Disj a #

Foldable Disj # 

Methods

fold :: Monoid m => Disj m -> m #

foldMap :: Monoid m => (a -> m) -> Disj a -> m #

foldr :: (a -> b -> b) -> b -> Disj a -> b #

foldr' :: (a -> b -> b) -> b -> Disj a -> b #

foldl :: (b -> a -> b) -> b -> Disj a -> b #

foldl' :: (b -> a -> b) -> b -> Disj a -> b #

foldr1 :: (a -> a -> a) -> Disj a -> a #

foldl1 :: (a -> a -> a) -> Disj a -> a #

toList :: Disj a -> [a] #

null :: Disj a -> Bool #

length :: Disj a -> Int #

elem :: Eq a => a -> Disj a -> Bool #

maximum :: Ord a => Disj a -> a #

minimum :: Ord a => Disj a -> a #

sum :: Num a => Disj a -> a #

product :: Num a => Disj a -> a #

Traversable Disj # 

Methods

traverse :: Applicative f => (a -> f b) -> Disj a -> f (Disj b) #

sequenceA :: Applicative f => Disj (f a) -> f (Disj a) #

mapM :: Monad m => (a -> m b) -> Disj a -> m (Disj b) #

sequence :: Monad m => Disj (m a) -> m (Disj a) #

Alternative Disj # 

Methods

empty :: Disj a #

(<|>) :: Disj a -> Disj a -> Disj a #

some :: Disj a -> Disj [a] #

many :: Disj a -> Disj [a] #

MonadPlus Disj # 

Methods

mzero :: Disj a #

mplus :: Disj a -> Disj a -> Disj a #

MonadDisj Disj # 
Eq a => Eq (Disj a) # 

Methods

(==) :: Disj a -> Disj a -> Bool #

(/=) :: Disj a -> Disj a -> Bool #

Data a => Data (Disj a) # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Disj a -> c (Disj a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Disj a) #

toConstr :: Disj a -> Constr #

dataTypeOf :: Disj a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Disj a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Disj a)) #

gmapT :: (forall b. Data b => b -> b) -> Disj a -> Disj a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Disj a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Disj a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Disj a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Disj a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Disj a -> m (Disj a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Disj a -> m (Disj a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Disj a -> m (Disj a) #

Ord a => Ord (Disj a) # 

Methods

compare :: Disj a -> Disj a -> Ordering #

(<) :: Disj a -> Disj a -> Bool #

(<=) :: Disj a -> Disj a -> Bool #

(>) :: Disj a -> Disj a -> Bool #

(>=) :: Disj a -> Disj a -> Bool #

max :: Disj a -> Disj a -> Disj a #

min :: Disj a -> Disj a -> Disj a #

Show a => Show (Disj a) # 

Methods

showsPrec :: Int -> Disj a -> ShowS #

show :: Disj a -> String #

showList :: [Disj a] -> ShowS #

Monoid (Disj a) # 

Methods

mempty :: Disj a #

mappend :: Disj a -> Disj a -> Disj a #

mconcat :: [Disj a] -> Disj a #

Binary a => Binary (Disj a) # 

Methods

put :: Disj a -> Put #

get :: Get (Disj a) #

putList :: [Disj a] -> Put #

NFData a => NFData (Disj a) # 

Methods

rnf :: Disj a -> () #