LMonad.Label.DisjunctionCategory

Documentation

type Disjunction p = Set p

type Conjunction p = Set (Disjunction p)

data Ord p => DCLabel p

Disjunction category label of principals in conjunction normal form.

Constructors

DCLabel

Fields

• dcConfidentiality :: Conjunction p
• dcIntegrity :: Conjunction p

Instances

Ord p => Eq (DCLabel p)

Methods

(==) :: DCLabel p -> DCLabel p -> Bool

(/=) :: DCLabel p -> DCLabel p -> Bool

(Show p, Ord p) => Show (DCLabel p)

Methods

showsPrec :: Int -> DCLabel p -> ShowS

show :: DCLabel p -> String

showList :: [DCLabel p] -> ShowS

Ord p => Label (DCLabel p)

Methods

lub :: DCLabel p -> DCLabel p -> DCLabel p

glb :: DCLabel p -> DCLabel p -> DCLabel p

canFlowTo :: DCLabel p -> DCLabel p -> Bool

bottom :: DCLabel p

dcSingleton :: Ord p => p -> DCLabel p

Convenience function to convert a principal to confidentiality and integrity DCLabel.

dcConfidentialitySingleton :: Ord p => p -> DCLabel p

Convenience function to convert a principal to confidentiality DCLabel.

dcIntegritySingleton :: Ord p => p -> DCLabel p

Convenience function to convert a principal to integrity DCLabel.

forall :: (a -> Bool) -> Set a -> Bool

exists :: (a -> Bool) -> Set a -> Bool

subset :: Ord p => Disjunction p -> Disjunction p -> Bool

implies :: Ord p => Conjunction p -> Conjunction p -> Bool

Computes logical implies. Assumes CNF. O(n * m * (n' + m'))

conjunctionInsertDisjunction :: Ord p => Conjunction p -> Disjunction p -> Conjunction p

conjunctionAnd :: Ord p => Conjunction p -> Conjunction p -> Conjunction p

conjunctionOr :: Ord p => Conjunction p -> Conjunction p -> Conjunction p