Remove default-extensions from the cabal file

Add show-extensions haddock option.

free-category.cabal

@@ -31,24 +31,6 @@ library
       Paths_free_category
   hs-source-dirs:
       src
-  default-extensions:
-      ConstraintKinds
-      DataKinds
-      DeriveFunctor
-      EmptyDataDecls
-      FlexibleInstances
-      FlexibleContexts
-      GADTs
-      KindSignatures
-      InstanceSigs
-      MultiParamTypeClasses
-      OverloadedStrings
-      PolyKinds
-      RankNTypes
-      ScopedTypeVariables
-      TupleSections
-      TypeApplications
-      TypeFamilies
   build-depends:
       base          >= 4.9 && <5
     , free-algebras >= 0.0.7.0

src/Control/Arrow/Free.hs

@@ -1,4 +1,12 @@
-{-# LANGUAGE GADTs #-}
+{-# LANGUAGE GADTs               #-}
+{-# LANGUAGE InstanceSigs        #-}
+{-# LANGUAGE PolyKinds           #-}
+{-# LANGUAGE RankNTypes          #-}
+{-# LANGUAGE ScopedTypeVariables #-}
+{-# LANGUAGE TypeFamilies        #-}
+
+{-# OPTIONS_HADDOCK show-extensions #-}
+
 module Control.Arrow.Free
   ( -- * Free arrow
     Arr (..)

src/Control/Category/Free.hs

@@ -1,10 +1,16 @@
 {-# LANGUAGE BangPatterns       #-}
 {-# LANGUAGE CPP                #-}
+{-# LANGUAGE GADTs              #-}
+{-# LANGUAGE FlexibleInstances  #-}
 {-# LANGUAGE PatternSynonyms    #-}
-{-# LANGUAGE StandaloneDeriving #-}
+{-# LANGUAGE PolyKinds          #-}
+{-# LANGUAGE RankNTypes         #-}
 {-# LANGUAGE TypeOperators      #-}
+{-# LANGUAGE TypeFamilies       #-}
 {-# LANGUAGE ViewPatterns       #-}
 
+{-# OPTIONS_HADDOCK show-extensions #-}
+
 #if __GLASGOW_HASKELL__ <= 802
 -- ghc802 does not infer that 'cons' is used when using a bidirectional
 -- pattern
@@ -55,176 +61,12 @@ import           Data.Monoid (Monoid (..))
 import           Data.Semigroup (Semigroup (..))
 #endif
 
--- | Oposite categoy in which arrows from @a@ to @b@ are represented by arrows
--- from @b@ to @a@ in the original category.
---
-newtype Op (f :: k -> k -> *) (a :: k) (b :: k) = Op { runOp :: f b a }
-
-instance Category f => Category (Op f) where
-    id = Op id
-    Op f . Op g = Op (g . f)
-
--- |
--- Free category encoded as a recursive data type, in a simlar way as
--- @'Control.Monad.Free.Free'@.  You can use @'FreeAlgebra2'@ class instance:
---
--- prop> liftFree2    @Cat :: f a b -> Cat f ab
--- prop> foldNatFree2 @Cat :: Category d => (forall x y. f x y -> d x y) -> Cat f a b -> d a b
---
--- The same performance concerns that apply to @'Control.Monad.Free.Free'@
--- apply to this encoding of a free category.
---
-data ListTr :: (k -> k -> *) -> k -> k -> * where
-  NilTr :: ListTr f a a
-  (:.:)   :: f b c -> ListTr f a b -> ListTr f a c
-
-instance Category (ListTr f) where
-  id = NilTr
-  NilTr    . ys = ys
-  (x :.: xs) . ys = x :.: (xs . ys)
-
-infixr 9 :.:
-
-instance Arrow f => Arrow (ListTr f) where
-  arr ab                          = arr ab :.: NilTr
-
-  (fxb :.: cax) *** (fyb :.: cay) = (fxb *** fyb) :.: (cax *** cay)
-  (fxb :.: cax) *** NilTr         = (fxb *** arr id) :.: (cax *** NilTr)
-  NilTr *** (fxb :.: cax)         = (arr id *** fxb) :.: (NilTr *** cax)
-  NilTr *** NilTr                 = NilTr
-
-instance ArrowZero f => ArrowZero (ListTr f) where
-  zeroArrow = zeroArrow :.: NilTr
-
-instance ArrowChoice f => ArrowChoice (ListTr f) where
-  (fxb :.: cax) +++ (fyb :.: cay) = (fxb +++ fyb) :.: (cax +++ cay)
-  (fxb :.: cax) +++ NilTr         = (fxb +++ arr id) :.: (cax +++ NilTr)
-  NilTr +++ (fxb :.: cax)         = (arr id +++ fxb) :.: (NilTr +++ cax)
-  NilTr +++ NilTr                 = NilTr
-
-instance Semigroup (ListTr f o o) where
-  f <> g = g . f
-
-instance Monoid (ListTr f o o) where
-  mempty = NilTr
-#if __GLASGOW_HASKELL__ < 804
-  mappend = (<>)
-#endif
-
-type instance AlgebraType0 ListTr f = ()
-type instance AlgebraType  ListTr c = Category c
-
-instance FreeAlgebra2 ListTr where
-  liftFree2 = \fab -> fab :.: NilTr
-  {-# INLINE liftFree2 #-}
-
-  foldNatFree2 _   NilTr     = id
-  foldNatFree2 fun (bc :.: ab) = fun bc . foldNatFree2 fun ab
-  {-# INLINE foldNatFree2 #-}
-
-  codom2  = proof
-  forget2 = proof
-
-
+import           Control.Category.Free.Internal
 --
 -- Free categories based on real time queues; Ideas after E.Kmett's guanxi
 -- project.
 --
 
--- | Type alligned real time queues; Based on `Purely Functinal Data Structures`
--- C.Okasaki.
---
--- Upper bounds of `cons`, `snoc`, `uncons` are @O\(1\)@ (worst case).
---
--- Invariant: sum of lengths of two last least is equal the length of the first
--- one.
---
-data Queue (f :: k -> k -> *) (a :: k) (b :: k) where
-    Queue :: forall f a c b x.
-             !(ListTr f b c)
-          -> !(ListTr (Op f) b a)
-          -> !(ListTr f b x)
-          -> Queue f a c
-
-emptyQ :: Queue (f :: k -> k -> *) a a
-emptyQ = Queue NilTr NilTr NilTr
-
-cons :: forall (f :: k -> k -> *) a b c.
-        f b c
-     -> Queue f a b
-     -> Queue f a c
-cons fbc (Queue f r s) = Queue (fbc :.: f) r (undefined :.: s)
-
-data ViewL f a b where
-    EmptyL :: ViewL f a a
-    (:<)   :: f b c -> Queue f a b -> ViewL f a c
-
--- | 'uncons' a 'Queue', complexity: @O\(1\)@
---
-uncons :: Queue f a b
-       -> ViewL f a b
-uncons (Queue NilTr NilTr _)          = EmptyL
-uncons (Queue (tr :.: f) r (_ :.: s)) = tr :< exec f r s
-uncons _                              = error "Queue.uncons: invariant violation"
-
-snoc :: forall (f :: k -> k -> *) a b c.
-        Queue f b c
-     -> f a b
-     -> Queue f a c
-snoc (Queue f r s) g = exec f (Op g :.: r) s
-
-pattern ConsQ :: f b c -> Queue f a b -> Queue f a c
-pattern ConsQ a as <- (uncons -> a :< as) where
-    ConsQ = cons
-
-pattern NilQ :: () => a ~ b => Queue f a b
-pattern NilQ <- (uncons -> EmptyL) where
-    NilQ = emptyQ
-
-#if __GLASGOW_HASKELL__ > 802
-{-# complete NilQ, ConsQ #-}
-#endif
-
--- | Efficient fold of a queue into a category.
---
--- /complexity/ @O\(n\)@
---
-foldQ :: forall (f :: k -> k -> *) c a b.
-         Category c
-      => (forall x y. f x y -> c x y)
-      -> Queue f a b
-      -> c a b
-foldQ nat queue = case queue of
-    NilQ            -> id
-    ConsQ tr queue' -> nat tr . foldQ nat queue'
-
-zipWithQ :: forall f g a b a' b'.
-        Arrow f
-     => (forall x y x' y'. f x y -> f x' y' -> f (g x x') (g y y'))
-     -> Queue f a  b
-     -> Queue f a' b'
-     -> Queue f (g a a') (g b b')
-zipWithQ fn queueA queueB = case (queueA, queueB) of
-    (NilQ, NilQ) -> NilQ
-    (NilQ, ConsQ trB' queueB') -> ConsQ (id   `fn` trB') (zipWithQ fn NilQ    queueB')
-    (ConsQ trA' queueA', NilQ) -> ConsQ (trA' `fn` id)   (zipWithQ fn queueA' NilQ)
-    (ConsQ trA' queueA', ConsQ trB' queueB')
-                               -> ConsQ (trA' `fn` trB') (zipWithQ fn queueA' queueB')
-
-
-
-exec :: ListTr f b c -> ListTr (Op f) b a -> ListTr f b x -> Queue f a c
-exec xs ys (_ :.: t) = Queue xs ys t
-exec xs ys NilTr     = Queue xs' NilTr xs'
-  where
-    xs' = rotate xs ys NilTr
-
-rotate :: ListTr f c d -> ListTr (Op f) c b -> ListTr f a b -> ListTr f a d
-rotate NilTr      (Op f :.: NilTr) a = f :.: a
-rotate (f :.: fs) (Op g :.: gs)    a = f :.: rotate fs gs (g :.: a)
-rotate _          _                  _ = error "Queue.rotate: impossible happend"
-
-
 -- | Efficient encoding of a category for which morphism composition has
 -- @O\(1\)@ complexity and fold is linear in the number of transitions.
 -- 

src/Control/Category/Free/Internal.hs

@@ -1,6 +1,11 @@
-{-# LANGUAGE CPP             #-}
-{-# LANGUAGE PatternSynonyms #-}
-{-# LANGUAGE ViewPatterns    #-}
+{-# LANGUAGE CPP               #-}
+{-# LANGUAGE GADTs             #-}
+{-# LANGUAGE FlexibleInstances #-}
+{-# LANGUAGE PatternSynonyms   #-}
+{-# LANGUAGE PolyKinds         #-}
+{-# LANGUAGE RankNTypes        #-}
+{-# LANGUAGE TypeFamilies      #-}
+{-# LANGUAGE ViewPatterns      #-}
 
 {-# OPTIONS_HADDOCK show-extensions #-}
 
@@ -12,6 +17,10 @@
 {-# OPTIONS_GHC -Wno-incomplete-patterns #-}
 #endif
 
+
+-- | Internal module, contains implementation of type aligned real time queues
+-- (C.Okasaki 'Purely Functional Data Structures').
+--
 module Control.Category.Free.Internal
   ( Op (..)
   , ListTr (..)
@@ -48,6 +57,15 @@ instance Category f => Category (Op f) where
     id = Op id
     Op f . Op g = Op (g . f)
 
+instance Category f => Semigroup (Op f o o) where
+    (<>) = (.)
+
+instance Category f => Monoid (Op f o o) where
+    mempty = id
+#if __GLASGOW_HASKELL__ < 804
+    mappend = (<>)
+#endif
+
 -- |
 -- Free category encoded as a recursive data type, in a simlar way as
 -- @'Control.Monad.Free.Free'@.  You can use @'FreeAlgebra2'@ class instance:

src/Control/Category/FreeEff.hs

@@ -1,4 +1,12 @@
+{-# LANGUAGE GADTs                  #-}
+{-# LANGUAGE FlexibleInstances      #-}
 {-# LANGUAGE FunctionalDependencies #-}
+{-# LANGUAGE PolyKinds              #-}
+{-# LANGUAGE RankNTypes             #-}
+{-# LANGUAGE TypeFamilies           #-}
+
+{-# OPTIONS_HADDOCK show-extensions #-}
+
 module Control.Category.FreeEff
   ( EffCategory (..)
   , FreeEffCat (..)