+class GArrow g (**) u => GArrowConstant g (**) u t r where
+ ga_constant :: t -> g u r
+
+
+
+------------------------------------------------------------------------
+-- Reify and Reflect, which are "curried" versions
+
+-- If you have this for R the identity map on types, you're basically
+-- a Control.Arrow; you can also define essentially all the other
+-- methods of GArrow, GArrowDrop, GArrowCopy, etc in terms of this.
+class GArrow g (**) u => GArrowReify g (**) u x y r q where
+ ga_reify :: (x -> y) -> g r q
+
+class GArrow g (**) u => GArrowReflect g (**) u r q x y where
+ ga_reflect :: g r q -> (x -> y)
+
+
+
+
+------------------------------------------------------------------------
+-- Apply and Curry
+
+class GArrow g (**) u => GArrowApply g (**) u (~>) where
+ ga_applyl :: g (x**(x~>y) ) y
+ ga_applyr :: g ( (x~>y)**x) y
+
+class GArrow g (**) u => GArrowCurry g (**) u (~>) where
+ ga_curryl :: g (x**y) z -> g x (y~>z)
+ ga_curryr :: g (x**y) z -> g y (x~>z)
+
+
+
+
+------------------------------------------------------------------------
+-- Commonly Implemented Collections of Classes
+
+--
+-- The simply typed KAPPA calculus; see Hasegawa, __Decomposing Typed
+-- Lambda Calculus into a Couple of Categorical Programming
+-- Languages__, http://dx.doi.org/10.1007/3-540-60164-3_28
+--
+class (GArrowDrop g (**) u,
+ GArrowCopy g (**) u,
+ GArrowSwap g (**) u) =>
+ GArrowSTKC g (**) u