Hets - the Heterogeneous Tool Set

Copyright(c) Mihai Codescu and Uni Bremen 2002-2006
LicenseGPLv2 or higher, see LICENSE.txt
Maintainermcodescu@informatik.uni-bremen.de
Stabilityprovisional
Portabilitynon-portable
Safe HaskellNone

Proofs.ComputeColimit

Description

Computes the colimit and displays the graph after its insertion. Improvements:

  • error messages when the algorithm fails to compute
  • insert edges just from a subset of nodes in the original graph

Synopsis

Documentation

makeDiagram :: DGraph -> [Node] -> [LEdge DGLinkLab] -> GDiagram Source #

creates an GDiagram with the signatures of the given nodes as nodes and the morphisms of the given edges as edges

makeDiagramAux :: GDiagram -> DGraph -> [Node] -> [LEdge DGLinkLab] -> GDiagram Source #

auxiliary method for makeDiagram: first translates all nodes then all edges, the descriptors of the nodes are kept in order to make retranslation easier

gWeaklyAmalgamableCocone :: GDiagram -> Result (G_theory, Map Int GMorphism) Source #

weakly amalgamable cocones