pandora-0.4.6: Pandora/Paradigm/Primary/Transformer/Construction.hs
{-# LANGUAGE UndecidableInstances #-}
module Pandora.Paradigm.Primary.Transformer.Construction where
import Pandora.Core.Functor (type (:.), type (:=), type (:=>), type (~>))
import Pandora.Pattern.Semigroupoid ((.))
import Pandora.Pattern.Category (($), (#))
import Pandora.Pattern.Functor.Covariant (Covariant ((-<$>-)), (-<$$>-))
import Pandora.Pattern.Functor.Semimonoidal (Semimonoidal (multiply))
import Pandora.Pattern.Functor.Monoidal (Monoidal (unit))
import Pandora.Pattern.Functor.Traversable (Traversable ((<<-)), (-<<-<<-))
import Pandora.Pattern.Functor.Extendable (Extendable ((<<=)))
import Pandora.Pattern.Functor.Comonad (Comonad)
import Pandora.Pattern.Functor.Bivariant ((<->))
import Pandora.Pattern.Transformer.Lowerable (Lowerable (lower))
import Pandora.Pattern.Transformer.Hoistable (Hoistable ((/|\), hoist))
import Pandora.Pattern.Object.Setoid (Setoid ((==)))
import Pandora.Pattern.Object.Semigroup (Semigroup ((+)))
import Pandora.Pattern.Object.Ringoid ((*))
import Pandora.Pattern.Object.Monoid (Monoid (zero))
import Pandora.Paradigm.Primary.Algebraic ((-<*>-), extract)
import Pandora.Paradigm.Primary.Algebraic.Exponential (type (<--))
import Pandora.Paradigm.Primary.Algebraic.Product ((:*:) ((:*:)))
import Pandora.Paradigm.Primary.Transformer.Flip (Flip (Flip))
import Pandora.Paradigm.Controlflow.Effect.Interpreted (run)
import Pandora.Paradigm.Structure.Ability.Monotonic (Monotonic (reduce))
import Pandora.Paradigm.Schemes (type (<:.>))
infixr 7 .-+
data Construction t a = Construct a (t :. Construction t := a)
instance Covariant (->) (->) t => Covariant (->) (->) (Construction t) where
f -<$>- ~(Construct x xs) = Construct # f x # f -<$$>- xs
instance (Covariant (->) (->) t, Semimonoidal (->) (:*:) (:*:) t) => Semimonoidal (->) (:*:) (:*:) (Construction t) where
multiply (Construct x xs :*: Construct y ys) = Construct (x :*: y) (multiply @(->) @(:*:) -<$>- multiply (xs :*: ys))
instance (Covariant (->) (->) t, Semimonoidal (<--) (:*:) (:*:) t) => Semimonoidal (<--) (:*:) (:*:) (Construction t) where
multiply = Flip $ \(Construct (x :*: y) xys) ->
let Flip f = multiply @(<--) @(:*:) @(:*:) in
let Flip g = multiply @(<--) @(:*:) @(:*:) in
(Construct x <-> Construct y) $ f $ g -<$>- xys
instance (Covariant (->) (->) t, Semimonoidal (<--) (:*:) (:*:) t) => Monoidal (<--) (->) (:*:) (:*:) (Construction t) where
unit _ = Flip $ \(Construct x _) -> (\_ -> x)
instance Traversable (->) (->) t => Traversable (->) (->) (Construction t) where
f <<- ~(Construct x xs) = Construct -<$>- f x -<*>- f -<<-<<- xs
instance Covariant (->) (->) t => Extendable (->) (Construction t) where
f <<= x = Construct # f x # (f <<=) -<$>- deconstruct x
instance (Covariant (->) (->) t, Semimonoidal (<--) (:*:) (:*:) t) => Comonad (Construction t) (->) where
instance (forall u . Semimonoidal (<--) (:*:) (:*:) u) => Lowerable (->) Construction where
lower x = extract -<$>- deconstruct x
instance (forall u . Semimonoidal (<--) (:*:) (:*:) u) => Hoistable Construction where
f /|\ x = Construct # extract x $ f # hoist f -<$>- deconstruct x
instance (Setoid a, forall b . Setoid b => Setoid (t b), Covariant (->) (->) t, Semimonoidal (<--) (:*:) (:*:) t) => Setoid (Construction t a) where
x == y = (extract x == extract y) * (deconstruct x == deconstruct y)
instance (Semigroup a, forall b . Semigroup b => Semigroup (t b), Covariant (->) (->) t, Semimonoidal (<--) (:*:) (:*:) t) => Semigroup (Construction t a) where
x + y = Construct # extract x + extract y # deconstruct x + deconstruct y
instance (Monoid a, forall b . Semigroup b => Monoid (t b), Covariant (->) (->) t, Semimonoidal (<--) (:*:) (:*:) t) => Monoid (Construction t a) where
zero = Construct zero zero
instance Monotonic a (t :. Construction t := a) => Monotonic a (Construction t a) where
reduce f r ~(Construct x xs) = f x $ reduce f r xs
instance Monotonic a (t :. Construction t := a) => Monotonic a (t <:.> Construction t := a) where
reduce f r = reduce f r . run
deconstruct :: Construction t a -> t :. Construction t := a
deconstruct ~(Construct _ xs) = xs
-- Generate a construction from seed using effectful computation
(.-+) :: Covariant (->) (->) t => a :=> t -> a :=> Construction t
f .-+ x = Construct x $ (f .-+) -<$>- f x
section :: (Comonad t (->), Monoidal (<--) (->) (:*:) (:*:) t) => t ~> Construction t
section xs = Construct # extract xs $ section <<= xs