| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Proarrow.Category.Monoidal.StarAutonomous
Description
Star-autonomous categories: dialogue categories (Proarrow.Category.Monoidal.Dialogue) whose
dualizing functor Dual is an involution, so that double negation
(Dual (Dual a) ≅ adoubleNeg) and dual is bijective on hom-sets (dualInv). They are closed, with an internal
hom , and are the categorical semantics of multiplicative
linear logic.ExpSA a b = Dual (a ** Dual b)
Synopsis
- class (Dialogue k, Closed k) => StarAutonomous k where
- doubleNegDefault :: forall {k} (a :: k). (StarAutonomous k, Ob a) => Dual (Dual a) ~> a
- doubleNegIso :: forall {k} (a :: k) (a' :: k). (StarAutonomous k, Ob a, Ob a') => PIso a a' (Dual (Dual a)) (Dual (Dual a'))
- type ExpSA (a :: k) (b :: k) = Dual (a ** Dual b)
- currySA :: forall {k} (a :: k) (b :: k) (c :: k). (StarAutonomous k, Ob a, Ob b) => ((a ** b) ~> c) -> a ~> ExpSA b c
- applySA :: forall {k} (b :: k) (c :: k). (StarAutonomous k, Ob b, Ob c) => (ExpSA b c ** b) ~> c
- expSA :: forall {k} (a :: k) (b :: k) (x :: k) (y :: k). StarAutonomous k => (b ~> y) -> (x ~> a) -> ExpSA a b ~> ExpSA x y
- type StarAutonomousStructures = '[Monoidal, SymMonoidal, Closed, Dialogue, StarAutonomous]
Documentation
class (Dialogue k, Closed k) => StarAutonomous k where Source Github #
A *-autonomous category: a dialogue category whose dual is an involution, so that
Hom(a is symmetric in its three arguments.** b, Dual c)
Laws: those of Dialogue, and
dualanddualInvare mutually inverse bijections on hom-sets:anddualInv(dualf) = fdual(dualInvg) = gdoubleNeganddoubleNegInvare mutually inverse, soDual(Duala) ≅ a
Stated as code by the Laws instance for StarAutonomousStructures, and
checked by Proarrow.Testing.Laws.testStarAutonomous.
Minimal complete definition
Methods
dualInv :: forall (a :: k) (b :: k). (Ob a, Ob b) => (Dual a ~> Dual b) -> b ~> a Source Github #
Inverse to dual on hom-sets: recovers the undualized arrow.
doubleNeg :: forall (a :: k). Ob a => Dual (Dual a) ~> a Source Github #
Double-negation elimination. Defaults to doubleNegDefault; an instance whose double dual
is the object itself can say so directly.
Instances
| StarAutonomous Nat Source Github # | |
| StarAutonomous BOOL Source Github # | |
| StarAutonomous FINREL Source Github # | |
| StarAutonomous LINEAR Source Github # | |
| StarAutonomous DOT Source Github # | |
| StarAutonomous SVG Source Github # | |
| StarAutonomous () Source Github # | |
| TracedMonoidal k => StarAutonomous (INT k) Source Github # | |
| Num a => StarAutonomous (MatK a) Source Github # | |
| (HasPullbacks k, HasProducts k) => StarAutonomous (SPAN k) Source Github # | |
| Scalar e => StarAutonomous (TNET e) Source Github # | |
| (HasPushouts k, HasCoproducts k, Alternative f) => StarAutonomous (DECCOSPAN f) Source Github # | |
| StarAutonomous (KLEISLI (Cont r)) Source Github # | |
| CommutativeMonoid m => StarAutonomous (MONOID m) Source Github # | |
| (StarAutonomous j, StarAutonomous k) => StarAutonomous (j, k) Source Github # | |
| Elems StarAutonomousStructures cs => StarAutonomous (FREE cs p) Source Github # | |
doubleNegDefault :: forall {k} (a :: k). (StarAutonomous k, Ob a) => Dual (Dual a) ~> a Source Github #
doubleNeg from the rest of the structure: dualInv of doubleNegInv at the dual.
doubleNegIso :: forall {k} (a :: k) (a' :: k). (StarAutonomous k, Ob a, Ob a') => PIso a a' (Dual (Dual a)) (Dual (Dual a')) Source Github #
currySA :: forall {k} (a :: k) (b :: k) (c :: k). (StarAutonomous k, Ob a, Ob b) => ((a ** b) ~> c) -> a ~> ExpSA b c Source Github #
applySA :: forall {k} (b :: k) (c :: k). (StarAutonomous k, Ob b, Ob c) => (ExpSA b c ** b) ~> c Source Github #
expSA :: forall {k} (a :: k) (b :: k) (x :: k) (y :: k). StarAutonomous k => (b ~> y) -> (x ~> a) -> ExpSA a b ~> ExpSA x y Source Github #
type StarAutonomousStructures = '[Monoidal, SymMonoidal, Closed, Dialogue, StarAutonomous] Source Github #
The structures the free category needs for StarAutonomous, and those its laws are stated for.