{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
module Data.Comp.Annotation
(
(:&:) (..),
(:*:) (..),
DistAnn (..),
RemA (..),
liftA,
liftA',
stripA,
propAnn,
propAnnM,
ann,
project'
) where
import Control.Monad
import Data.Comp.Algebra
import Data.Comp.Ops
import Data.Comp.Term
liftA :: (RemA s s') => (s' a -> t) -> s a -> t
liftA :: (s' a -> t) -> s a -> t
liftA s' a -> t
f s a
v = s' a -> t
f (s a -> s' a
forall k (s :: k -> *) (s' :: k -> *) (a :: k).
RemA s s' =>
s a -> s' a
remA s a
v)
liftA' :: (DistAnn s' p s, Functor s')
=> (s' a -> Cxt h s' a) -> s a -> Cxt h s a
liftA' :: (s' a -> Cxt h s' a) -> s a -> Cxt h s a
liftA' s' a -> Cxt h s' a
f s a
v = let (s' a
v',p
p) = s a -> (s' a, p)
forall k (s :: k -> *) p (s' :: k -> *) (a :: k).
DistAnn s p s' =>
s' a -> (s a, p)
projectA s a
v
in p -> Cxt h s' a -> Cxt h s a
forall (f :: * -> *) p (g :: * -> *).
(DistAnn f p g, Functor f) =>
p -> CxtFun f g
ann p
p (s' a -> Cxt h s' a
f s' a
v')
stripA :: (RemA g f, Functor g) => CxtFun g f
stripA :: CxtFun g f
stripA = SigFun g f -> CxtFun g f
forall (f :: * -> *) (g :: * -> *).
Functor f =>
SigFun f g -> CxtFun f g
appSigFun SigFun g f
forall k (s :: k -> *) (s' :: k -> *) (a :: k).
RemA s s' =>
s a -> s' a
remA
propAnn :: (DistAnn f p f', DistAnn g p g', Functor g)
=> Hom f g -> Hom f' g'
propAnn :: Hom f g -> Hom f' g'
propAnn Hom f g
hom f' a
f' = p -> Cxt Hole g a -> Cxt Hole g' a
forall (f :: * -> *) p (g :: * -> *).
(DistAnn f p g, Functor f) =>
p -> CxtFun f g
ann p
p (f a -> Cxt Hole g a
Hom f g
hom f a
f)
where (f a
f,p
p) = f' a -> (f a, p)
forall k (s :: k -> *) p (s' :: k -> *) (a :: k).
DistAnn s p s' =>
s' a -> (s a, p)
projectA f' a
f'
propAnnM :: (DistAnn f p f', DistAnn g p g', Functor g, Monad m)
=> HomM m f g -> HomM m f' g'
propAnnM :: HomM m f g -> HomM m f' g'
propAnnM HomM m f g
hom f' a
f' = (Cxt Hole g a -> Cxt Hole g' a)
-> m (Cxt Hole g a) -> m (Cxt Hole g' a)
forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM (p -> CxtFun g g'
forall (f :: * -> *) p (g :: * -> *).
(DistAnn f p g, Functor f) =>
p -> CxtFun f g
ann p
p) (f a -> m (Cxt Hole g a)
HomM m f g
hom f a
f)
where (f a
f,p
p) = f' a -> (f a, p)
forall k (s :: k -> *) p (s' :: k -> *) (a :: k).
DistAnn s p s' =>
s' a -> (s a, p)
projectA f' a
f'
ann :: (DistAnn f p g, Functor f) => p -> CxtFun f g
ann :: p -> CxtFun f g
ann p
c = SigFun f g -> CxtFun f g
forall (f :: * -> *) (g :: * -> *).
Functor f =>
SigFun f g -> CxtFun f g
appSigFun (p -> f a -> g a
forall k (s :: k -> *) p (s' :: k -> *) (a :: k).
DistAnn s p s' =>
p -> s a -> s' a
injectA p
c)
project' :: (RemA f f', s :<: f') => Cxt h f a -> Maybe (s (Cxt h f a))
project' :: Cxt h f a -> Maybe (s (Cxt h f a))
project' (Term f (Cxt h f a)
x) = f' (Cxt h f a) -> Maybe (s (Cxt h f a))
forall (f :: * -> *) (g :: * -> *) a.
(f :<: g) =>
g a -> Maybe (f a)
proj (f' (Cxt h f a) -> Maybe (s (Cxt h f a)))
-> f' (Cxt h f a) -> Maybe (s (Cxt h f a))
forall a b. (a -> b) -> a -> b
$ f (Cxt h f a) -> f' (Cxt h f a)
forall k (s :: k -> *) (s' :: k -> *) (a :: k).
RemA s s' =>
s a -> s' a
remA f (Cxt h f a)
x
project' Cxt h f a
_ = Maybe (s (Cxt h f a))
forall a. Maybe a
Nothing