Copyright | (c) Uni Bremen DFKI 2010 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | eugenk@informatik.uni-bremen.de |
Stability | experimental |
Portability | non-portable (via Logic.Logic) |
Safe Haskell | Safe-Inferred |
Morphism of Common Logic
- data Morphism = Morphism {}
- pretty :: Pretty a => a -> Doc
- idMor :: Sign -> Morphism
- isLegalMorphism :: Morphism -> Result ()
- composeMor :: Morphism -> Morphism -> Result Morphism
- inclusionMap :: Sign -> Sign -> Morphism
- mkMorphism :: Sign -> Sign -> Map Id Id -> Morphism
- mapSentence :: Morphism -> TEXT_META -> Result TEXT_META
- applyMap :: Map Id Id -> Id -> Id
- applyMorphism :: Morphism -> Id -> Id
- morphismUnion :: Morphism -> Morphism -> Result Morphism
Documentation
data Morphism
isLegalMorphism :: Morphism -> Result ()
Determines whether a morphism is valid
composeMor :: Morphism -> Morphism -> Result Morphism
Composition of morphisms in propositional Logic
inclusionMap :: Sign -> Sign -> Morphism
Inclusion map of a subsig into a supersig
mapSentence :: Morphism -> TEXT_META -> Result TEXT_META
sentence (text) translation along signature morphism here just the renaming of formulae
applyMorphism :: Morphism -> Id -> Id
Application funtion for morphisms
morphismUnion :: Morphism -> Morphism -> Result Morphism
Union of two morphisms.