{-# OPTIONS_GHC -Wno-orphans #-}

-- | The free promonad on a profunctor, with base morphisms as pure arrows.
module Proarrow.Promonad.Free where

import Proarrow.Category.Instance.Prof (Prof (..))
import Proarrow.Core (CAT, CategoryOf (..), Profunctor (..), Promonad (..), arr, lmap, rmap, tgt, (:~>))
import Proarrow.Functor (Functor (..))
import Proarrow.Profunctor.Free (HasFree (..), freeComp, freeMap)
import Proarrow.Profunctor.Instance.Composition ((:.:) (..))
import Proarrow.Profunctor.Instance.Star (Star, pattern Star)

-- | A chain of @p@s ending in a base morphism, interpreted into any promonad
-- by 'foldFreePromonad'.
type FreePromonad :: CAT k -> CAT k
data FreePromonad p a b where
  Unit :: (a ~> b) -> FreePromonad p a b
  Comp :: p a b -> FreePromonad p b c -> FreePromonad p a c

-- | Embed a generator as a one-step chain.
liftFreePromonad :: (Profunctor p) => p :~> FreePromonad p
liftFreePromonad :: forall {k} (p :: k +-> k). Profunctor p => p :~> FreePromonad p
liftFreePromonad p a b
p = p a b -> FreePromonad p b b -> FreePromonad p a b
forall {k} (p :: CAT k) (a :: k) (b :: k) (c :: k).
p a b -> FreePromonad p b c -> FreePromonad p a c
Comp p a b
p ((b ~> b) -> FreePromonad p b b
forall {k} (a :: k) (b :: k) (p :: CAT k).
(a ~> b) -> FreePromonad p a b
Unit (p a b -> b ~> b
forall {k1} {k2} (a :: k2) (b :: k1) (p :: k1 +-> k2).
Profunctor p =>
p a b -> Obj b
tgt p a b
p))

freePromonadAlg :: p :.: FreePromonad p :~> FreePromonad p
freePromonadAlg :: forall {k} (p :: k +-> k) (a :: k) (b :: k).
(:.:) p (FreePromonad p) a b -> FreePromonad p a b
freePromonadAlg (p a b
p :.: FreePromonad p b b
pp) = p a b -> FreePromonad p b b -> FreePromonad p a b
forall {k} (p :: CAT k) (a :: k) (b :: k) (c :: k).
p a b -> FreePromonad p b c -> FreePromonad p a c
Comp p a b
p FreePromonad p b b
pp

foldFreePromonad :: (Promonad q) => p :~> q -> FreePromonad p :~> q
foldFreePromonad :: forall {k1} (q :: CAT k1) (p :: CAT k1).
Promonad q =>
(p :~> q) -> FreePromonad p :~> q
foldFreePromonad p :~> q
_ (Unit a ~> b
f) = (a ~> b) -> q a b
forall {k} (p :: CAT k) (a :: k) (b :: k).
Promonad p =>
(a ~> b) -> p a b
arr a ~> b
f
foldFreePromonad p :~> q
n (Comp p a b
p (Unit b ~> b
f)) = (b ~> b) -> q a b -> q a b
forall (b :: k1) (d :: k1) (a :: k1). (b ~> d) -> q a b -> q a d
forall {j} {k} (p :: j +-> k) (b :: j) (d :: j) (a :: k).
Profunctor p =>
(b ~> d) -> p a b -> p a d
rmap b ~> b
f (p a b -> q a b
p :~> q
n p a b
p)
foldFreePromonad p :~> q
n (Comp p a b
p FreePromonad p b b
pp) = (p :~> q) -> FreePromonad p :~> q
forall {k1} (q :: CAT k1) (p :: CAT k1).
Promonad q =>
(p :~> q) -> FreePromonad p :~> q
foldFreePromonad p a b -> q a b
p :~> q
n FreePromonad p b b
pp q b b -> q a b -> q a b
forall (b :: k1) (c :: k1) (a :: k1). q b c -> q a b -> q a c
forall {k} (p :: CAT k) (b :: k) (c :: k) (a :: k).
Promonad p =>
p b c -> p a b -> p a c
. p a b -> q a b
p :~> q
n p a b
p

instance (Profunctor p) => Profunctor (FreePromonad p) where
  dimap :: forall (c :: j) (a :: j) (b :: j) (d :: j).
(c ~> a) -> (b ~> d) -> FreePromonad p a b -> FreePromonad p c d
dimap c ~> a
l b ~> d
r (Unit a ~> b
f) = (c ~> d) -> FreePromonad p c d
forall {k} (a :: k) (b :: k) (p :: CAT k).
(a ~> b) -> FreePromonad p a b
Unit (b ~> d
r (b ~> d) -> (c ~> b) -> c ~> d
forall (b :: j) (c :: j) (a :: j). (b ~> c) -> (a ~> b) -> a ~> c
forall {k} (p :: CAT k) (b :: k) (c :: k) (a :: k).
Promonad p =>
p b c -> p a b -> p a c
. a ~> b
f (a ~> b) -> (c ~> a) -> c ~> b
forall (b :: j) (c :: j) (a :: j). (b ~> c) -> (a ~> b) -> a ~> c
forall {k} (p :: CAT k) (b :: k) (c :: k) (a :: k).
Promonad p =>
p b c -> p a b -> p a c
. c ~> a
l)
  dimap c ~> a
l b ~> d
r (Comp p a b
p FreePromonad p b b
q) = p c b -> FreePromonad p b d -> FreePromonad p c d
forall {k} (p :: CAT k) (a :: k) (b :: k) (c :: k).
p a b -> FreePromonad p b c -> FreePromonad p a c
Comp ((c ~> a) -> p a b -> p c b
forall (c :: j) (a :: j) (b :: j). (c ~> a) -> p a b -> p c b
forall {j} {k} (p :: j +-> k) (c :: k) (a :: k) (b :: j).
Profunctor p =>
(c ~> a) -> p a b -> p c b
lmap c ~> a
l p a b
p) ((b ~> d) -> FreePromonad p b b -> FreePromonad p b d
forall (b :: j) (d :: j) (a :: j).
(b ~> d) -> FreePromonad p a b -> FreePromonad p a d
forall {j} {k} (p :: j +-> k) (b :: j) (d :: j) (a :: k).
Profunctor p =>
(b ~> d) -> p a b -> p a d
rmap b ~> d
r FreePromonad p b b
q)
  (Ob a, Ob b) => r
r \\ :: forall (a :: j) (b :: j) r.
((Ob a, Ob b) => r) -> FreePromonad p a b -> r
\\ (Unit a ~> b
f) = r
(Ob a, Ob b) => r
r ((Ob a, Ob b) => r) -> (a ~> b) -> r
forall (a :: j) (b :: j) r. ((Ob a, Ob b) => r) -> (a ~> b) -> r
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j) r.
Profunctor p =>
((Ob a, Ob b) => r) -> p a b -> r
\\ a ~> b
f
  (Ob a, Ob b) => r
r \\ Comp p a b
p FreePromonad p b b
q = r
(Ob a, Ob b) => r
(Ob a, Ob b) => r
r ((Ob a, Ob b) => r) -> p a b -> r
forall (a :: j) (b :: j) r. ((Ob a, Ob b) => r) -> p a b -> r
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j) r.
Profunctor p =>
((Ob a, Ob b) => r) -> p a b -> r
\\ p a b
p ((Ob b, Ob b) => r) -> FreePromonad p b b -> r
forall (a :: j) (b :: j) r.
((Ob a, Ob b) => r) -> FreePromonad p a b -> r
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j) r.
Profunctor p =>
((Ob a, Ob b) => r) -> p a b -> r
\\ FreePromonad p b b
q

instance (Profunctor p) => Promonad (FreePromonad p) where
  id :: forall (a :: k). Ob a => FreePromonad p a a
id = (a ~> a) -> FreePromonad p a a
forall {k} (a :: k) (b :: k) (p :: CAT k).
(a ~> b) -> FreePromonad p a b
Unit a ~> a
forall (a :: k). Ob a => a ~> a
forall {k} (p :: CAT k) (a :: k). (Promonad p, Ob a) => p a a
id
  FreePromonad p b c
p . :: forall (b :: k) (c :: k) (a :: k).
FreePromonad p b c -> FreePromonad p a b -> FreePromonad p a c
. Unit a ~> b
f = (a ~> b) -> FreePromonad p b c -> FreePromonad p a c
forall (c :: k) (a :: k) (b :: k).
(c ~> a) -> FreePromonad p a b -> FreePromonad p c b
forall {j} {k} (p :: j +-> k) (c :: k) (a :: k) (b :: j).
Profunctor p =>
(c ~> a) -> p a b -> p c b
lmap a ~> b
f FreePromonad p b c
p
  FreePromonad p b c
p . Comp p a b
r FreePromonad p b b
q = p a b -> FreePromonad p b c -> FreePromonad p a c
forall {k} (p :: CAT k) (a :: k) (b :: k) (c :: k).
p a b -> FreePromonad p b c -> FreePromonad p a c
Comp p a b
r (FreePromonad p b c
p FreePromonad p b c -> FreePromonad p b b -> FreePromonad p b c
forall (b :: k) (c :: k) (a :: k).
FreePromonad p b c -> FreePromonad p a b -> FreePromonad p a c
forall {k} (p :: CAT k) (b :: k) (c :: k) (a :: k).
Promonad p =>
p b c -> p a b -> p a c
. FreePromonad p b b
q)

instance Functor FreePromonad where
  map :: forall (a :: k -> k -> Type) (b :: k -> k -> Type).
(a ~> b) -> FreePromonad a ~> FreePromonad b
map = forall {k} (ob :: OB k) (a :: k) (b :: k).
HasFree ob =>
(a ~> b) -> Free ob a ~> Free ob b
forall (ob :: OB (k -> k -> Type)) (a :: k -> k -> Type)
       (b :: k -> k -> Type).
HasFree ob =>
(a ~> b) -> Free ob a ~> Free ob b
freeMap @Promonad

instance Promonad (Star FreePromonad) where
  id :: forall (a :: k -> k -> Type). Ob a => Star FreePromonad a a
id = (a ~> FreePromonad a) -> Star FreePromonad a a
forall {j} {k} (b :: j) (a :: k) (f :: j -> k).
Ob b =>
(a ~> f b) -> Star f a b
Star (forall {k} (ob :: OB k) (a :: k).
(HasFree ob, Ob a) =>
a ~> Free ob a
forall (ob :: OB (k -> k -> Type)) (a :: k -> k -> Type).
(HasFree ob, Ob a) =>
a ~> Free ob a
lift @Promonad)
  Star b ~> FreePromonad c
l . :: forall (b :: k -> k -> Type) (c :: k -> k -> Type)
       (a :: k -> k -> Type).
Star FreePromonad b c
-> Star FreePromonad a b -> Star FreePromonad a c
. Star a ~> FreePromonad b
r = (a ~> FreePromonad c) -> Star FreePromonad a c
forall {j} {k} (b :: j) (a :: k) (f :: j -> k).
Ob b =>
(a ~> f b) -> Star f a b
Star (forall {k} (ob :: OB k) (c :: k) (b :: k) (a :: k).
(HasFree ob, Ob c) =>
(b ~> Free ob c) -> (a ~> Free ob b) -> a ~> Free ob c
forall (ob :: OB (k -> k -> Type)) (c :: k -> k -> Type)
       (b :: k -> k -> Type) (a :: k -> k -> Type).
(HasFree ob, Ob c) =>
(b ~> Free ob c) -> (a ~> Free ob b) -> a ~> Free ob c
freeComp @Promonad b ~> Free Promonad c
b ~> FreePromonad c
l a ~> Free Promonad b
a ~> FreePromonad b
r)

instance HasFree Promonad where
  type Free Promonad p = FreePromonad p
  lift :: forall (a :: CAT k). Ob a => a ~> Free Promonad a
lift = (a :~> FreePromonad a) -> Prof a (FreePromonad a)
forall {j} {k} (p :: j +-> k) (q :: j +-> k).
(Profunctor p, Profunctor q) =>
(p :~> q) -> Prof p q
Prof a a b -> FreePromonad a a b
a :~> FreePromonad a
forall {k} (p :: k +-> k). Profunctor p => p :~> FreePromonad p
liftFreePromonad
  foldMap :: forall (b :: CAT k) (a :: CAT k).
Promonad b =>
(a ~> b) -> Free Promonad a ~> b
foldMap (Prof a :~> b
n) = (FreePromonad a :~> b) -> Prof (FreePromonad a) b
forall {j} {k} (p :: j +-> k) (q :: j +-> k).
(Profunctor p, Profunctor q) =>
(p :~> q) -> Prof p q
Prof ((a :~> b) -> FreePromonad a :~> b
forall {k1} (q :: CAT k1) (p :: CAT k1).
Promonad q =>
(p :~> q) -> FreePromonad p :~> q
foldFreePromonad a a b -> b a b
a :~> b
n)