aboutsummaryrefslogtreecommitdiff
path: root/Data/Vector/Endofunctor.agda
blob: a9b2905bdeb6bc5b89dc592e24c8014ef0e54018 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
{-# OPTIONS --without-K --safe #-}

open import Data.Nat using ()
open import Level using (Level; _⊔_)

-- The endofunctor in setoids sending A to Vector A n for a fixed n
module Data.Vector.Endofunctor (n : ) {c  : Level} where

import Data.Vec as Vec

open import Categories.Category.Instance.Setoids using (Setoids)
open import Categories.Functor using (Functor)
open import Data.Vec.Properties using (map-id; map-∘)
open import Data.Vec.Relation.Binary.Pointwise.Inductive using (map⁺)
open import Data.Vector.Core as Core using (Vector; Vectorₛ; module ≊)
open import Function using (Func; _⟶ₛ_; _⟨$⟩_)
open import Function.Construct.Composition using () renaming (function to compose)
open import Function.Construct.Identity using () renaming (function to Id)
open import Relation.Binary using (Setoid)

open Func

opaque
  unfolding Vector
  map : {c  : Level} {A B : Setoid c }  A ⟶ₛ B  Vectorₛ A n ⟶ₛ Vectorₛ B n
  map f .to = Vec.map (to f)
  map f .cong = map⁺ (cong f)

abstract opaque

  unfolding map

  identity
      : {A : Setoid c }
        {V : Vector A n}
        (open Core A using (_≊_))
       map (Id A) ⟨$⟩ V  V
  identity {A} {V} = ≊.reflexive A (map-id V)

  homomorphism
      : {X Y Z : Setoid c }
        {f : X ⟶ₛ Y}
        {g : Y ⟶ₛ Z}
        {V : Vector X n}
        (open Core Z using (_≊_))
       map (compose f g) ⟨$⟩ V  map g ⟨$⟩ (map f ⟨$⟩ V)
  homomorphism {_} {_} {Z} {f} {g} {V} = ≊.reflexive Z (map-∘ (to g) (to f) V)

  F-resp-≈
      : {A B : Setoid c }
        {f g : A ⟶ₛ B}
       ({x : Setoid.Carrier A}  (B Setoid.≈ to f x) (to g x))
       {V : Vector A n}
        (open Core B using (_≊_))
       map f ⟨$⟩ V  map g ⟨$⟩ V
  F-resp-≈ {A} {B} {_} {g} f≈g {V} = map⁺ (λ x≈y  B.trans f≈g (cong g x≈y)) (≊.refl A)
    where
      module B = Setoid B

-- only a true endofunctor when c ≤ ℓ
Vec : Functor (Setoids c ) (Setoids c (c  ))
Vec = record
    { F₀ = λ A  Vectorₛ A n
    ; F₁ = map
    ; identity = identity
    ; homomorphism = homomorphism
    ; F-resp-≈ = F-resp-≈
    }