Copyright | Guillaume Sabbagh 2022 |
---|---|
License | GPL-3 |
Maintainer | guillaumesabbagh@protonmail.com |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Each Category
has an opposite one where morphisms are reversed.
Synopsis
- data OpMorphism m = OpMorphism m
- opOpMorphism :: OpMorphism m -> m
- data Op c = Op c
- opOp :: Op c -> c
Documentation
data OpMorphism m Source #
An OpMorphism
is a morphism where source and target are reversed.
Instances
opOpMorphism :: OpMorphism m -> m Source #
Return the original morphism given an OpMorphism
.
Op c |
Instances
PrettyPrint c => PrettyPrint (Op c) Source # | |
Defined in Math.Categories.Opposite | |
Simplifiable c => Simplifiable (Op c) Source # | |
Defined in Math.Categories.Opposite | |
Generic (Op c) Source # | |
Show c => Show (Op c) Source # | |
Eq c => Eq (Op c) Source # | |
(Category c m o, Morphism m o) => Category (Op c) (OpMorphism m) o Source # | |
Defined in Math.Categories.Opposite identity :: Op c -> o -> OpMorphism m Source # ar :: Op c -> o -> o -> Set (OpMorphism m) Source # genAr :: Op c -> o -> o -> Set (OpMorphism m) Source # decompose :: Op c -> OpMorphism m -> [OpMorphism m] Source # | |
(FiniteCategory c m o, Morphism m o) => FiniteCategory (Op c) (OpMorphism m) o Source # | |
type Rep (Op c) Source # | |
Defined in Math.Categories.Opposite type Rep (Op c) = D1 ('MetaData "Op" "Math.Categories.Opposite" "FiniteCategories-0.6.1.0-inplace" 'False) (C1 ('MetaCons "Op" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 c))) |