Causal.Kernel

newtype Cause x

data AreDisjoint x y

newtype Effect x

data IsPathOf p g

data Path a

Constructors

• MkPath a (List a) a

Instances

• (Eq a) => Eq (Path a)
• (Ord a) => Ord (Path a)
• Generic (Path a) _
• (Show a) => Show (Path a)
• Functor Path
• Foldable Path

data PathOf g

allDirectedPaths :: forall v k g. Ord k => { end :: k, start :: k } -> Named g (Graph k v) -> Set (Named (PathOf g) (Path k))

allUndirectedPaths :: forall v k g. Ord k => TwoSet k -> Named g (Graph k v) -> Set (Named (PathOf g) (Path k))

disjointnessCauseEffect :: forall a m n. Ord a => Named n { cause :: a, effect :: a } -> Named m (Set a) -> Maybe (Proof (AreDisjoint n m))

disjointnessTwoSet :: forall a m n. Ord a => Named n (TwoSet a) -> Named m (Set a) -> Maybe (Proof (AreDisjoint n m))

disjointnessSingleton :: forall a m n. Ord a => Named n a -> Named m (Set a) -> Maybe (Proof (AreDisjoint n m))

cause :: forall a n. Named n { cause :: a, effect :: a } -> Named (Cause n) a

cause_disjoint :: forall m n. Proof (AreDisjoint n m) -> Proof (AreDisjoint (Cause n) m)

effect :: forall a n. Named n { cause :: a, effect :: a } -> Named (Effect n) a

effect_disjoint :: forall m n. Proof (AreDisjoint n m) -> Proof (AreDisjoint (Effect n) m)

pathOf_isPathOf :: forall a g. Named (PathOf g) a -> Proof (IsPathOf (PathOf g) g)