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-Inferred |
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
data Morphism
The datatype for morphisms in reduce logic as maps of sets
Eq Morphism | |
Data Morphism | |
Ord Morphism | |
Show Morphism | |
ShATermConvertible Morphism | |
Pretty Morphism | |
Typeable * Morphism | |
Category Sign Morphism | Instance of Category for CSL logic |
Sentences CSL CMD Sign Morphism Symbol | Instance of Sentences for reduce logic |
StaticAnalysis CSL BASIC_SPEC CMD SYMB_ITEMS SYMB_MAP_ITEMS Sign Morphism Symbol Symbol | Static Analysis for reduce logic |
Logic CSL () BASIC_SPEC CMD SYMB_ITEMS SYMB_MAP_ITEMS Sign Morphism Symbol Symbol [EXPRESSION] | Instance of Logic for reduce logc |
composeMor :: Morphism -> Morphism -> Result Morphism
calculates the composition of two morhpisms f:X->Y, g:Y->Z
inclusionMap :: Sign -> Sign -> Morphism
constructs the inclusion map for a given signature
mapSentence :: Morphism -> CMD -> Result CMD
sentence translation along signature morphism here just the renaming of formulae
mapSentenceH :: Morphism -> CMD -> CMD
applyMorphism :: Morphism -> Id -> Id
Application funtion for morphisms
morphismUnion :: Morphism -> Morphism -> Result Morphism