Copyright | Heng Jiang Uni Bremen 2004-2006 |
---|---|

License | GPLv2 or higher, see LICENSE.txt |

Maintainer | Christian.Maeder@dfki.de |

Stability | provisional |

Portability | non-portable(Logic) |

Safe Haskell | None |

Translation of development graphs along comorphisms Follows Sect. IV:4.3 of the CASL Reference Manual.

- libEnv_translation :: LibEnv -> AnyComorphism -> Result LibEnv
- dg_translation :: LibEnv -> LibName -> DGraph -> AnyComorphism -> Result DGraph
- getDGLogic :: LibEnv -> Result G_sublogics

# Documentation

libEnv_translation :: LibEnv -> AnyComorphism -> Result LibEnv Source #

translation of a LibEnv (a map of globalcontext)

dg_translation :: LibEnv -> LibName -> DGraph -> AnyComorphism -> Result DGraph Source #

getDGLogic :: LibEnv -> Result G_sublogics Source #

get the maximal sublogic of a graph. each DGraph and each node will be tested, in order to find the maximal sublogic of th Graph. All edges and nodes will be searched also in the meantime, so as to test, whether the GMorphism of edges is homogeneous, and the logics of nodes are equal.