Copyright | (c) Dominik Dietrich DFKI Bremen 2010 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | dominik.dietrich@dfki.de |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
CSL.Morphism
Description
this file defines morhpisms for the reduce logic. A morphism is a mapping of operator symbols
- data Morphism = Morphism {}
- pretty :: Pretty a => a -> Doc
- idMor :: Sign -> Morphism
- composeMor :: Morphism -> Morphism -> Result Morphism
- inclusionMap :: Sign -> Sign -> Morphism
- mapSentence :: Morphism -> CMD -> Result CMD
- mapSentenceH :: Morphism -> CMD -> CMD
- applyMap :: Map Id Id -> Id -> Id
- applyMorphism :: Morphism -> Id -> Id
- morphismUnion :: Morphism -> Morphism -> Result Morphism
Documentation
The datatype for morphisms in reduce logic as maps of sets
Instances
Eq Morphism Source # | |
Data Morphism Source # | |
Ord Morphism Source # | |
Show Morphism Source # | |
Pretty Morphism Source # | |
Sentences CSL CMD Sign Morphism Symbol Source # | Instance of Sentences for reduce logic |
StaticAnalysis CSL BASIC_SPEC CMD SYMB_ITEMS SYMB_MAP_ITEMS Sign Morphism Symbol Symbol Source # | Static Analysis for reduce logic |
Logic CSL () BASIC_SPEC CMD SYMB_ITEMS SYMB_MAP_ITEMS Sign Morphism Symbol Symbol [EXPRESSION] Source # | Instance of Logic for reduce logc |
composeMor :: Morphism -> Morphism -> Result Morphism Source #
calculates the composition of two morhpisms f:X->Y, g:Y->Z