{-# OPTIONS --safe --no-require-unique-meta-solutions #-}
 
module CategoricalCrypto.Channel.Category where
 
open import CategoricalCrypto.Channel.Core
open import Categories.Category.Core
open import Categories.Category.Cocartesian
open import Categories.Category.Helper
open import Categories.Category.Monoidal
open import Categories.Category.Monoidal.Braided
open import Categories.Category.Monoidal.Symmetric
open import Categories.Object.Coproduct
open import Categories.Functor
open import Categories.Functor.Monoidal
open import Categories.Functor.Bifunctor
open import Relation.Binary.PropositionalEquality
open import abstract-set-theory.Prelude hiding (_⊗_ ; Functor ; Bifunctor)
 
opaque
  unfolding _⊗_
 
  channel-category                       : Category (sucˡ zeroˡ) zeroˡ zeroˡ
 
  ⊗-bifunctor                           : Bifunctor channel-category channel-category channel-category
 
  ⊗-binary-coproducts                   : BinaryCoproducts channel-category
  ⊗-cocartesian                         : Cocartesian channel-category
 
  channel-⊗-monoidal                    : Monoidal  channel-category
  channel-⊗-braided                     : Braided   channel-⊗-monoidal
  channel-⊗-symmetric                   : Symmetric channel-⊗-monoidal
 
  channel-⊗-monoidal-category           : MonoidalCategory          (sucˡ zeroˡ) zeroˡ zeroˡ
  channel-⊗-braided-monoidal-category   : BraidedMonoidalCategory   (sucˡ zeroˡ) zeroˡ zeroˡ
  channel-⊗-symmetric-monoidal-category : SymmetricMonoidalCategory (sucˡ zeroˡ) zeroˡ zeroˡ
 
  ᵀ-endofunctor                          : Endofunctor channel-category
 
  ᵀ-monoidal-functor                     : MonoidalFunctor       channel-⊗-monoidal-category channel-⊗-monoidal-category
  ᵀ-strong-monoidal-functor              : StrongMonoidalFunctor channel-⊗-monoidal-category channel-⊗-monoidal-category
 
  channel-category = categoryHelper record
    { Obj = Channel
    ; _⇒_ = λ A B → ∀ {m} → A [ m ]⇒[ m ] B
    ; _≈_ = λ A⇒B₀ A⇒B₁ → ∀ {m} v → A⇒B₀ {m} v ≡ A⇒B₁ v
    ; id = ⇒-refl
    ; _∘_ = λ A⇒B B⇒C → B⇒C ⇒ₜ A⇒B
    ; assoc = λ _ → refl
    ; identityˡ = λ _ → refl
    ; identityʳ = λ _ → refl
    ; equiv = record
        { refl = λ _ → refl
        ; sym = λ A⇒B₀≈A⇒B₁ → sym ∘ A⇒B₀≈A⇒B₁
        ; trans = λ A⇒B₀≈A⇒B₁ A⇒B₁≈A⇒B₂ _ → trans (A⇒B₀≈A⇒B₁ _) (A⇒B₁≈A⇒B₂ _)
        }
    ; ∘-resp-≈ = λ where
        {h = B⇒C} {A⇒B} f≈B⇒C A⇒B≈i _ → trans (f≈B⇒C ∘ A⇒B $ _) (cong B⇒C ∘ A⇒B≈i $ _)
    }
 
  ⊗-binary-coproducts = record
    { coproduct = λ {A} {B} → record
        { A+B = A ⊗ B
        ; i₁ = ⊗-right-intro
        ; i₂ = ⊗-left-intro
        ; [_,_] = λ A⇒C B⇒C → ⊗-combine A⇒C B⇒C ⇒ₜ ⊗-fusion
        ; inject₁ = λ where
            {m = Out} _ → refl
            {m = In } _ → refl
        ; inject₂ = λ where
            {m = Out} _ → refl
            {m = In } _ → refl
        ; unique = λ where
            f _ {Out} (inj₁ i) → sym (f i)
            _ g {Out} (inj₂ o) → sym (g o)
            f _ {In } (inj₁ i) → sym (f i)
            _ g {In } (inj₂ o) → sym (g o)
        }
    }
 
  ⊗-cocartesian = record
    { initial = record
        { ⊥ = I
        ; ⊥-is-initial = record
            { ! = λ where
                {m = Out} ()
                {m = In } ()
            ; !-unique = λ where
                _ {Out} ()
                _ {In } ()
            }
        }
    ; coproducts = ⊗-binary-coproducts
    }
 
  ⊗-bifunctor = BinaryCoproducts.-+- ⊗-binary-coproducts
 
  channel-⊗-monoidal = CocartesianMonoidal.+-monoidal channel-category ⊗-cocartesian
 
  channel-⊗-symmetric = CocartesianSymmetricMonoidal.+-symmetric channel-category ⊗-cocartesian
 
  channel-⊗-braided = Symmetric.braided channel-⊗-symmetric
 
  channel-⊗-symmetric-monoidal-category = record
    { U = channel-category
    ; monoidal = channel-⊗-monoidal
    ; symmetric = channel-⊗-symmetric
    }
 
  channel-⊗-monoidal-category = SymmetricMonoidalCategory.monoidalCategory channel-⊗-symmetric-monoidal-category
 
  channel-⊗-braided-monoidal-category = SymmetricMonoidalCategory.braidedMonoidalCategory channel-⊗-symmetric-monoidal-category
 
  ᵀ-endofunctor = record
    { F₀ = _ᵀ
    ; F₁ = λ A⇒B → ⇒-transpose-left-negate-right ⇒ₜ A⇒B ⇒ₜ ⇒-negate-left-transpose-right
    ; identity = λ where
        {m = Out} _ → refl
        {m = In } _ → refl
    ; homomorphism = λ where
        {m = Out} _ → refl
        {m = In } _ → refl
    ; F-resp-≈ = λ where
        f≈g {Out} → f≈g ∘ ⇒-transpose-left-negate-right
        f≈g {In } → f≈g ∘ ⇒-transpose-left-negate-right
    }
 
  ᵀ-strong-monoidal-functor = record
    { F = ᵀ-endofunctor
    ; isStrongMonoidal = record
        { ε = record
            { from = ⇒-refl' ᵀ-identity
            ; to = ⇒-refl' ᵀ-identity
            ; iso = record
                { isoˡ = λ _ → refl
                ; isoʳ = λ _ → refl
                }
            }
        ; ⊗-homo = record
            { F⇒G = record
                { η = λ _ → ⊗-ᵀ-factor
                ; commute = λ where
                    _ {Out} (inj₁ _) → refl
                    _ {Out} (inj₂ _) → refl
                    _ {In } (inj₁ _) → refl
                    _ {In } (inj₂ _) → refl
                ; sym-commute = λ where
                    _ {Out} (inj₁ _) → refl
                    _ {Out} (inj₂ _) → refl
                    _ {In } (inj₁ _) → refl
                    _ {In } (inj₂ _) → refl
                }
            ; F⇐G = record
                { η = λ _ → ⊗-ᵀ-distrib
                ; commute = λ where
                    _ {Out} (inj₁ _) → refl
                    _ {Out} (inj₂ _) → refl
                    _ {In } (inj₁ _) → refl
                    _ {In } (inj₂ _) → refl
                ; sym-commute = λ where
                    _ {Out} (inj₁ _) → refl
                    _ {Out} (inj₂ _) → refl
                    _ {In } (inj₁ _) → refl
                    _ {In } (inj₂ _) → refl
                }
            ; iso = λ _ → record
                { isoˡ = λ where
                    {m = Out} (inj₁ _) → refl
                    {m = Out} (inj₂ _) → refl
                    {m = In } (inj₁ _) → refl
                    {m = In } (inj₂ _) → refl
                ; isoʳ = λ where
                    {m = Out} (inj₁ _) → refl
                    {m = Out} (inj₂ _) → refl
                    {m = In } (inj₁ _) → refl
                    {m = In } (inj₂ _) → refl
                }
            }
        ; associativity = λ where
            {m = Out} (inj₁ (inj₁ _)) → refl
            {m = Out} (inj₁ (inj₂ _)) → refl
            {m = Out} (inj₂ _       ) → refl
            {m = In } (inj₁ (inj₁ _)) → refl
            {m = In } (inj₁ (inj₂ _)) → refl
            {m = In } (inj₂ _       ) → refl
        ; unitaryˡ = λ where
            {m = Out} (inj₂ _) → refl
            {m = In } (inj₂ _) → refl
        ; unitaryʳ = λ where
            {m = Out} (inj₁ _) → refl
            {m = In } (inj₁ _) → refl
        }
    }
 
  ᵀ-monoidal-functor = StrongMonoidalFunctor.monoidalFunctor ᵀ-strong-monoidal-functor