| Copyright | (c) Mihai Codescu and Uni Bremen 2002-2006 |
|---|---|
| License | GPLv2 or higher, see LICENSE.txt |
| Maintainer | mcodescu@informatik.uni-bremen.de |
| Stability | provisional |
| Portability | non-portable |
| Safe Haskell | None |
Static.WACocone
Description
Heterogeneous version of weakly_amalgamable_cocones. Needs some improvements (see TO DO).
Synopsis
- isConnected :: Gr a b -> Bool
- isAcyclic :: Eq b => Gr a b -> Bool
- isThin :: Gr a b -> Bool
- removeIdentities :: Gr a b -> Gr a b
- hetWeakAmalgCocone :: (MonadFail m, LogicT t, MonadPlus (t m), MonadFail (t m)) => GDiagram -> Map Int [(Int, G_theory)] -> t m GDiagram
- initDescList :: (Eq a, Eq b) => Gr a b -> Map Node [(Node, a)]
- dijkstra :: GDiagram -> Node -> Node -> Result GMorphism
- buildStrMorphisms :: GDiagram -> GDiagram -> Result (G_theory, Map Node GMorphism)
- 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)
Documentation
isConnected :: Gr a b -> Bool Source #
checks whether a graph is connected
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 #
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 #