{-# LANGUAGE GADTs #-}
module Control.Arrow.Free
(
Arr (..)
, A (..)
, fromA
, toA
, FreeAlgebra2 (..)
, wrapFree2
, foldFree2
, hoistFree2
, joinFree2
, bindFree2
) where
import Prelude hiding (id, (.))
import Control.Arrow (Arrow (..))
import Control.Category (Category (..))
import Control.Algebra.Free2
( AlgebraType0
, AlgebraType
, FreeAlgebra2 (..)
, proof
, wrapFree2
, foldFree2
, hoistFree2
, hoistFreeH2
, joinFree2
, bindFree2
)
data Arr f a b where
Id :: Arr f a a
(:.:) :: f b c -> Arr f a b -> Arr f a c
Arr :: (b -> c) -> Arr f a b -> Arr f a c
Prod :: Arr f a b -> Arr f a c -> Arr f a (b, c)
instance Category (Arr f) where
id = Id
Id . f = f
f . Id = f
(f :.: g) . h = f :.: (g . h)
(Arr f g) . h = Arr f (g . h)
(Prod f g) . h = Prod (f . h) (g . h)
instance Arrow (Arr f) where
arr f = Arr f Id
first bc = Prod (bc . arr fst) (arr snd)
second bc = Prod (arr fst) (bc . arr snd)
ab *** xy = Prod (ab . arr fst) (xy . arr snd)
(&&&) = Prod
type instance AlgebraType0 Arr f = ()
type instance AlgebraType Arr c = Arrow c
instance FreeAlgebra2 Arr where
liftFree2 = \fab -> fab :.: Id
{-# INLINE liftFree2 #-}
foldNatFree2 _ Id = id
foldNatFree2 fun (bc :.: ab) = fun bc . foldNatFree2 fun ab
foldNatFree2 fun (Arr f g) = arr f . foldNatFree2 fun g
foldNatFree2 fun (Prod f g) = foldNatFree2 fun f &&& foldNatFree2 fun g
{-# INLINE foldNatFree2 #-}
codom2 = proof
forget2 = proof
newtype A f a b
= A { runA :: forall r. Arrow r
=> (forall x y. f x y -> r x y)
-> r a b
}
toA :: Arr f a b -> A f a b
toA = hoistFreeH2
{-# INLINE toA #-}
fromA :: A f a b -> Arr f a b
fromA = hoistFreeH2
{-# INLINE fromA #-}
instance Category (A f) where
id = A (const id)
A f . A g = A $ \k -> f k . g k
instance Arrow (A f) where
arr f = A (const (arr f))
A f *** A g = A $ \k -> f k *** g k
first (A f) = A $ \k -> first (f k)
second (A f) = A $ \k -> second (f k)
type instance AlgebraType0 A f = ()
type instance AlgebraType A c = Arrow c
instance FreeAlgebra2 A where
liftFree2 = \fab -> A $ \k -> k fab
{-# INLINE liftFree2 #-}
foldNatFree2 fun (A f) = f fun
{-# INLINE foldNatFree2 #-}
codom2 = proof
forget2 = proof