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
Portabilityportable
Safe HaskellSafe

Common.SetColimit

Description

Computes the colimit of an arbitrary diagram in Set: - the set is the disjoint union of all sets in the diagram (which we obtain by pairing elements with the node number) factored by the equivalence generated by the pairs (x, f_i(x)), with i an arrow in the diagram - structural morphisms are factorizations

Documentation

computeColimitSet :: Ord a => Gr (Set a) (Int, Map a a) -> (Set (a, Node), Map Node (Map a (a, Node))) Source #

addIntToSymbols :: SymbolName a => (Set (a, Node), Map Node (Map a (a, Node))) -> (Set a, Map Node (Map a a)) Source #

class (Eq a, Ord a) => SymbolName a where Source #

Minimal complete definition

addString

Methods

addString :: (a, String) -> a Source #

Instances

SymbolName Id Source # 

Methods

addString :: (Id, String) -> Id Source #

SymbolName IRI Source # 

Methods

addString :: (IRI, String) -> IRI Source #