Hets - the Heterogeneous Tool Set
Copyright(c) Mihai Codescu and Uni Bremen 2002-2006
LicenseGPLv2 or higher, see LICENSE.txt
Safe HaskellNone



Heterogeneous version of weakly_amalgamable_cocones. Needs some improvements (see TO DO).



isConnected :: Gr a b -> Bool Source #

checks whether a graph is connected

isAcyclic :: Eq b => Gr a b -> Bool Source #

checks whether a graph is acyclic

isThin :: Gr a b -> Bool Source #

checks whether the graph is thin

removeIdentities :: Gr a b -> Gr a b Source #

auxiliary for removing the identity edges from a graph

hetWeakAmalgCocone :: (MonadFail m, LogicT t, MonadPlus (t m), MonadFail (t m)) => GDiagram -> Map Int [(Int, G_theory)] -> t m GDiagram Source #

backtracking function for heterogeneous weak amalgamable cocones

initDescList :: (Eq a, Eq b) => Gr a b -> Map Node [(Node, a)] Source #

dijkstra :: GDiagram -> Node -> Node -> Result GMorphism Source #

weakly_amalgamable_colimit :: StaticAnalysis lid basic_spec sentence symb_items symb_map_items sign morphism symbol raw_symbol => lid -> Gr sign (Int, morphism) -> Result (sign, Map Int morphism) Source #