{-# LANGUAGE ConstraintKinds        #-}
{-# LANGUAGE DataKinds              #-}
{-# LANGUAGE FlexibleContexts       #-}
{-# LANGUAGE FlexibleInstances      #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE GADTs                  #-}
{-# LANGUAGE MultiParamTypeClasses  #-}
{-# LANGUAGE PolyKinds              #-}
{-# LANGUAGE ScopedTypeVariables    #-}
{-# LANGUAGE TypeFamilies           #-}
{-# LANGUAGE TypeOperators          #-}
{-# LANGUAGE TypeSynonymInstances   #-}
{-# LANGUAGE UndecidableInstances   #-}

--------------------------------------------------------------------------------
-- |
-- Module      :  Data.Comp.Ops
-- Copyright   :  (c) 2010-2011 Patrick Bahr, Tom Hvitved
-- License     :  BSD3
-- Maintainer  :  Patrick Bahr <paba@diku.dk>
-- Stability   :  experimental
-- Portability :  non-portable (GHC Extensions)
--
-- This module provides operators on functors.
--
--------------------------------------------------------------------------------

module Data.Comp.Ops where

import Data.Foldable
import Data.Traversable
import Data.Kind

import Control.Applicative
import Control.Monad hiding (mapM, sequence)
import Data.Comp.SubsumeCommon


import Prelude hiding (foldl, foldl1, foldr, foldr1, mapM, sequence)


-- Sums

infixr 6 :+:


-- |Formal sum of signatures (functors).
data (f :+: g) e = Inl (f e)
                 | Inr (g e)

fromInl :: (f :+: g) e -> Maybe (f e)
fromInl :: forall {k} (f :: k -> *) (g :: k -> *) (e :: k).
(:+:) f g e -> Maybe (f e)
fromInl = forall {k} (f :: k -> *) (a :: k) b (g :: k -> *).
(f a -> b) -> (g a -> b) -> (:+:) f g a -> b
caseF forall a. a -> Maybe a
Just (forall a b. a -> b -> a
const forall a. Maybe a
Nothing)

fromInr :: (f :+: g) e -> Maybe (g e)
fromInr :: forall {k} (f :: k -> *) (g :: k -> *) (e :: k).
(:+:) f g e -> Maybe (g e)
fromInr = forall {k} (f :: k -> *) (a :: k) b (g :: k -> *).
(f a -> b) -> (g a -> b) -> (:+:) f g a -> b
caseF (forall a b. a -> b -> a
const forall a. Maybe a
Nothing) forall a. a -> Maybe a
Just

{-| Utility function to case on a functor sum, without exposing the internal
  representation of sums. -}
caseF :: (f a -> b) -> (g a -> b) -> (f :+: g) a -> b
{-# INLINE caseF #-}
caseF :: forall {k} (f :: k -> *) (a :: k) b (g :: k -> *).
(f a -> b) -> (g a -> b) -> (:+:) f g a -> b
caseF f a -> b
f g a -> b
g (:+:) f g a
x = case (:+:) f g a
x of
                Inl f a
x -> f a -> b
f f a
x
                Inr g a
x -> g a -> b
g g a
x

instance (Functor f, Functor g) => Functor (f :+: g) where
    fmap :: forall a b. (a -> b) -> (:+:) f g a -> (:+:) f g b
fmap a -> b
f (Inl f a
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
f f a
e)
    fmap a -> b
f (Inr g a
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
f g a
e)

instance (Foldable f, Foldable g) => Foldable (f :+: g) where
    fold :: forall m. Monoid m => (:+:) f g m -> m
fold (Inl f m
e) = forall (t :: * -> *) m. (Foldable t, Monoid m) => t m -> m
fold f m
e
    fold (Inr g m
e) = forall (t :: * -> *) m. (Foldable t, Monoid m) => t m -> m
fold g m
e
    foldMap :: forall m a. Monoid m => (a -> m) -> (:+:) f g a -> m
foldMap a -> m
f (Inl f a
e) = forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap a -> m
f f a
e
    foldMap a -> m
f (Inr g a
e) = forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap a -> m
f g a
e
    foldr :: forall a b. (a -> b -> b) -> b -> (:+:) f g a -> b
foldr a -> b -> b
f b
b (Inl f a
e) = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr a -> b -> b
f b
b f a
e
    foldr a -> b -> b
f b
b (Inr g a
e) = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr a -> b -> b
f b
b g a
e
    foldl :: forall b a. (b -> a -> b) -> b -> (:+:) f g a -> b
foldl b -> a -> b
f b
b (Inl f a
e) = forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl b -> a -> b
f b
b f a
e
    foldl b -> a -> b
f b
b (Inr g a
e) = forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl b -> a -> b
f b
b g a
e
    foldr1 :: forall a. (a -> a -> a) -> (:+:) f g a -> a
foldr1 a -> a -> a
f (Inl f a
e) = forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldr1 a -> a -> a
f f a
e
    foldr1 a -> a -> a
f (Inr g a
e) = forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldr1 a -> a -> a
f g a
e
    foldl1 :: forall a. (a -> a -> a) -> (:+:) f g a -> a
foldl1 a -> a -> a
f (Inl f a
e) = forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldl1 a -> a -> a
f f a
e
    foldl1 a -> a -> a
f (Inr g a
e) = forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldl1 a -> a -> a
f g a
e

instance (Traversable f, Traversable g) => Traversable (f :+: g) where
    traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> (:+:) f g a -> f ((:+:) f g b)
traverse a -> f b
f (Inl f a
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse a -> f b
f f a
e
    traverse a -> f b
f (Inr g a
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse a -> f b
f g a
e
    sequenceA :: forall (f :: * -> *) a.
Applicative f =>
(:+:) f g (f a) -> f ((:+:) f g a)
sequenceA (Inl f (f a)
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA f (f a)
e
    sequenceA (Inr g (f a)
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA g (f a)
e
    mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> (:+:) f g a -> m ((:+:) f g b)
mapM a -> m b
f (Inl f a
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
`liftM` forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM a -> m b
f f a
e
    mapM a -> m b
f (Inr g a
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
`liftM` forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM a -> m b
f g a
e
    sequence :: forall (m :: * -> *) a.
Monad m =>
(:+:) f g (m a) -> m ((:+:) f g a)
sequence (Inl f (m a)
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
`liftM` forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
sequence f (m a)
e
    sequence (Inr g (m a)
e) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
`liftM` forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
sequence g (m a)
e

infixl 5 :<:
infixl 5 :=:

type family Elem (f :: Type -> Type) (g :: Type -> Type) :: Emb where
    Elem f f = Found Here
    Elem (f1 :+: f2) g =  Sum' (Elem f1 g) (Elem f2 g)
    Elem f (g1 :+: g2) = Choose (Elem f g1) (Elem f g2)
    Elem f g = NotFound

class Subsume (e :: Emb) (f :: Type -> Type) (g :: Type -> Type) where
  inj'  :: Proxy e -> f a -> g a
  prj'  :: Proxy e -> g a -> Maybe (f a)

instance Subsume (Found Here) f f where
    inj' :: forall a. Proxy ('Found 'Here) -> f a -> f a
inj' Proxy ('Found 'Here)
_ = forall a. a -> a
id

    prj' :: forall a. Proxy ('Found 'Here) -> f a -> Maybe (f a)
prj' Proxy ('Found 'Here)
_ = forall a. a -> Maybe a
Just

instance Subsume (Found p) f g => Subsume (Found (Le p)) f (g :+: g') where
    inj' :: forall a. Proxy ('Found ('Le p)) -> f a -> (:+:) g g' a
inj' Proxy ('Found ('Le p))
_ = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> f a -> g a
inj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p))

    prj' :: forall a. Proxy ('Found ('Le p)) -> (:+:) g g' a -> Maybe (f a)
prj' Proxy ('Found ('Le p))
_ (Inl g a
x) = forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> g a -> Maybe (f a)
prj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p)) g a
x
    prj' Proxy ('Found ('Le p))
_ (:+:) g g' a
_       = forall a. Maybe a
Nothing

instance Subsume (Found p) f g => Subsume (Found (Ri p)) f (g' :+: g) where
    inj' :: forall a. Proxy ('Found ('Ri p)) -> f a -> (:+:) g' g a
inj' Proxy ('Found ('Ri p))
_ = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> f a -> g a
inj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p))

    prj' :: forall a. Proxy ('Found ('Ri p)) -> (:+:) g' g a -> Maybe (f a)
prj' Proxy ('Found ('Ri p))
_ (Inr g a
x) = forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> g a -> Maybe (f a)
prj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p)) g a
x
    prj' Proxy ('Found ('Ri p))
_ (:+:) g' g a
_       = forall a. Maybe a
Nothing

instance (Subsume (Found p1) f1 g, Subsume (Found p2) f2 g)
    => Subsume (Found (Sum p1 p2)) (f1 :+: f2) g where
    inj' :: forall a. Proxy ('Found ('Sum p1 p2)) -> (:+:) f1 f2 a -> g a
inj' Proxy ('Found ('Sum p1 p2))
_ (Inl f1 a
x) = forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> f a -> g a
inj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p1)) f1 a
x
    inj' Proxy ('Found ('Sum p1 p2))
_ (Inr f2 a
x) = forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> f a -> g a
inj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p2)) f2 a
x

    prj' :: forall a.
Proxy ('Found ('Sum p1 p2)) -> g a -> Maybe ((:+:) f1 f2 a)
prj' Proxy ('Found ('Sum p1 p2))
_ g a
x = case forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> g a -> Maybe (f a)
prj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p1)) g a
x of
                 Just f1 a
y -> forall a. a -> Maybe a
Just (forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl f1 a
y)
                 Maybe (f1 a)
_      -> case forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> g a -> Maybe (f a)
prj' (forall {k} (a :: k). Proxy a
P :: Proxy (Found p2)) g a
x of
                             Just f2 a
y -> forall a. a -> Maybe a
Just (forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr f2 a
y)
                             Maybe (f2 a)
_      -> forall a. Maybe a
Nothing



-- | A constraint @f :<: g@ expresses that the signature @f@ is
-- subsumed by @g@, i.e. @f@ can be used to construct elements in @g@.
type f :<: g = (Subsume (ComprEmb (Elem f g)) f g)

inj :: forall f g a . (f :<: g) => f a -> g a
inj :: forall (f :: * -> *) (g :: * -> *) a. (f :<: g) => f a -> g a
inj = forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> f a -> g a
inj' (forall {k} (a :: k). Proxy a
P :: Proxy (ComprEmb (Elem f g)))

proj :: forall f g a . (f :<: g) => g a -> Maybe (f a)
proj :: forall (f :: * -> *) (g :: * -> *) a.
(f :<: g) =>
g a -> Maybe (f a)
proj = forall (e :: Emb) (f :: * -> *) (g :: * -> *) a.
Subsume e f g =>
Proxy e -> g a -> Maybe (f a)
prj' (forall {k} (a :: k). Proxy a
P :: Proxy (ComprEmb (Elem f g)))

type f :=: g = (f :<: g, g :<: f)



spl :: (f :=: f1 :+: f2) => (f1 a -> b) -> (f2 a -> b) -> f a -> b
spl :: forall (f :: * -> *) (f1 :: * -> *) (f2 :: * -> *) a b.
(f :=: (f1 :+: f2)) =>
(f1 a -> b) -> (f2 a -> b) -> f a -> b
spl f1 a -> b
f1 f2 a -> b
f2 f a
x = case forall (f :: * -> *) (g :: * -> *) a. (f :<: g) => f a -> g a
inj f a
x of
            Inl f1 a
y -> f1 a -> b
f1 f1 a
y
            Inr f2 a
y -> f2 a -> b
f2 f2 a
y



-- Products

infixr 8 :*:

-- |Formal product of signatures (functors).
data (f :*: g) a = f a :*: g a


ffst :: (f :*: g) a -> f a
ffst :: forall {k} (f :: k -> *) (g :: k -> *) (a :: k). (:*:) f g a -> f a
ffst (f a
x :*: g a
_) = f a
x

fsnd :: (f :*: g) a -> g a
fsnd :: forall {k} (f :: k -> *) (g :: k -> *) (a :: k). (:*:) f g a -> g a
fsnd (f a
_ :*: g a
x) = g a
x

instance (Functor f, Functor g) => Functor (f :*: g) where
    fmap :: forall a b. (a -> b) -> (:*:) f g a -> (:*:) f g b
fmap a -> b
h (f a
f :*: g a
g) = (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
h f a
f forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> (:*:) f g a
:*: forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
h g a
g)


instance (Foldable f, Foldable g) => Foldable (f :*: g) where
    foldr :: forall a b. (a -> b -> b) -> b -> (:*:) f g a -> b
foldr a -> b -> b
f b
e (f a
x :*: g a
y) = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr a -> b -> b
f (forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr a -> b -> b
f b
e g a
y) f a
x
    foldl :: forall b a. (b -> a -> b) -> b -> (:*:) f g a -> b
foldl b -> a -> b
f b
e (f a
x :*: g a
y) = forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl b -> a -> b
f (forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl b -> a -> b
f b
e f a
x) g a
y


instance (Traversable f, Traversable g) => Traversable (f :*: g) where
    traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> (:*:) f g a -> f ((:*:) f g b)
traverse a -> f b
f (f a
x :*: g a
y) = forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> (:*:) f g a
(:*:) (forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse a -> f b
f f a
x) (forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse a -> f b
f g a
y)
    sequenceA :: forall (f :: * -> *) a.
Applicative f =>
(:*:) f g (f a) -> f ((:*:) f g a)
sequenceA (f (f a)
x :*: g (f a)
y) = forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> (:*:) f g a
(:*:)(forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA f (f a)
x) (forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA g (f a)
y)
    mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> (:*:) f g a -> m ((:*:) f g b)
mapM a -> m b
f (f a
x :*: g a
y) = forall (m :: * -> *) a1 a2 r.
Monad m =>
(a1 -> a2 -> r) -> m a1 -> m a2 -> m r
liftM2 forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> (:*:) f g a
(:*:) (forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM a -> m b
f f a
x) (forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM a -> m b
f g a
y)
    sequence :: forall (m :: * -> *) a.
Monad m =>
(:*:) f g (m a) -> m ((:*:) f g a)
sequence (f (m a)
x :*: g (m a)
y) = forall (m :: * -> *) a1 a2 r.
Monad m =>
(a1 -> a2 -> r) -> m a1 -> m a2 -> m r
liftM2 forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> (:*:) f g a
(:*:) (forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
sequence f (m a)
x) (forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
sequence g (m a)
y)

-- Constant Products

infixr 7 :&:

{-| This data type adds a constant product (annotation) to a signature. -}
data (f :&: a) e = f e :&: a


instance (Functor f) => Functor (f :&: a) where
    fmap :: forall a b. (a -> b) -> (:&:) f a a -> (:&:) f a b
fmap a -> b
f (f a
v :&: a
c) = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
f f a
v forall {k} (f :: k -> *) a (e :: k). f e -> a -> (:&:) f a e
:&: a
c

instance (Foldable f) => Foldable (f :&: a) where
    fold :: forall m. Monoid m => (:&:) f a m -> m
fold (f m
v :&: a
_) = forall (t :: * -> *) m. (Foldable t, Monoid m) => t m -> m
fold f m
v
    foldMap :: forall m a. Monoid m => (a -> m) -> (:&:) f a a -> m
foldMap a -> m
f (f a
v :&: a
_) = forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap a -> m
f f a
v
    foldr :: forall a b. (a -> b -> b) -> b -> (:&:) f a a -> b
foldr a -> b -> b
f b
e (f a
v :&: a
_) = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr a -> b -> b
f b
e f a
v
    foldl :: forall b a. (b -> a -> b) -> b -> (:&:) f a a -> b
foldl b -> a -> b
f b
e (f a
v :&: a
_) = forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl b -> a -> b
f b
e f a
v
    foldr1 :: forall a. (a -> a -> a) -> (:&:) f a a -> a
foldr1 a -> a -> a
f (f a
v :&: a
_) = forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldr1 a -> a -> a
f f a
v
    foldl1 :: forall a. (a -> a -> a) -> (:&:) f a a -> a
foldl1 a -> a -> a
f (f a
v :&: a
_) = forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldl1 a -> a -> a
f f a
v

instance (Traversable f) => Traversable (f :&: a) where
    traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> (:&:) f a a -> f ((:&:) f a b)
traverse a -> f b
f (f a
v :&: a
c) = forall (f :: * -> *) a b. Applicative f => (a -> b) -> f a -> f b
liftA (forall {k} (f :: k -> *) a (e :: k). f e -> a -> (:&:) f a e
:&: a
c) (forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse a -> f b
f f a
v)
    sequenceA :: forall (f :: * -> *) a.
Applicative f =>
(:&:) f a (f a) -> f ((:&:) f a a)
sequenceA (f (f a)
v :&: a
c) = forall (f :: * -> *) a b. Applicative f => (a -> b) -> f a -> f b
liftA (forall {k} (f :: k -> *) a (e :: k). f e -> a -> (:&:) f a e
:&: a
c)(forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA f (f a)
v)
    mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> (:&:) f a a -> m ((:&:) f a b)
mapM a -> m b
f (f a
v :&: a
c) = forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM (forall {k} (f :: k -> *) a (e :: k). f e -> a -> (:&:) f a e
:&: a
c) (forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM a -> m b
f f a
v)
    sequence :: forall (m :: * -> *) a.
Monad m =>
(:&:) f a (m a) -> m ((:&:) f a a)
sequence (f (m a)
v :&: a
c) = forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM (forall {k} (f :: k -> *) a (e :: k). f e -> a -> (:&:) f a e
:&: a
c) (forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
sequence f (m a)
v)

{-| This class defines how to distribute an annotation over a sum of
signatures. -}
class DistAnn s p s' | s' -> s, s' -> p where
    {-| Inject an annotation over a signature. -}
    injectA :: p -> s a -> s' a
    {-| Project an annotation from a signature. -}
    projectA :: s' a -> (s a, p)


class RemA s s' | s -> s'  where
    {-| Remove annotations from a signature. -}
    remA :: s a -> s' a

instance (RemA s s') => RemA (f :&: p :+: s) (f :+: s') where
    remA :: forall (a :: k). (:+:) (f :&: p) s a -> (:+:) f s' a
remA (Inl (f a
v :&: p
_)) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl f a
v
    remA (Inr s a
v) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k -> *) (s' :: k -> *) (a :: k).
RemA s s' =>
s a -> s' a
remA s a
v


instance RemA (f :&: p) f where
    remA :: forall (a :: k). (:&:) f p a -> f a
remA (f a
v :&: p
_) = f a
v


instance DistAnn f p (f :&: p) where

    injectA :: forall (a :: k). p -> f a -> (:&:) f p a
injectA p
c f a
v = f a
v forall {k} (f :: k -> *) a (e :: k). f e -> a -> (:&:) f a e
:&: p
c

    projectA :: forall (a :: k). (:&:) f p a -> (f a, p)
projectA (f a
v :&: p
p) = (f a
v,p
p)


instance (DistAnn s p s') => DistAnn (f :+: s) p ((f :&: p) :+: s') where


    injectA :: forall (a :: k). p -> (:+:) f s a -> (:+:) (f :&: p) s' a
injectA p
c (Inl f a
v) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl (f a
v forall {k} (f :: k -> *) a (e :: k). f e -> a -> (:&:) f a e
:&: p
c)
    injectA p
c (Inr s a
v) = forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k -> *) p (s' :: k -> *) (a :: k).
DistAnn s p s' =>
p -> s a -> s' a
injectA p
c s a
v

    projectA :: forall (a :: k). (:+:) (f :&: p) s' a -> ((:+:) f s a, p)
projectA (Inl (f a
v :&: p
p)) = (forall {k} (f :: k -> *) (g :: k -> *) (e :: k). f e -> (:+:) f g e
Inl f a
v,p
p)
    projectA (Inr s' a
v) = let (s a
v',p
p) = forall {k} (s :: k -> *) p (s' :: k -> *) (a :: k).
DistAnn s p s' =>
s' a -> (s a, p)
projectA s' a
v
                       in  (forall {k} (f :: k -> *) (g :: k -> *) (e :: k). g e -> (:+:) f g e
Inr s a
v',p
p)