-- algorithm often creates overlapping or even undecidable
-- instance-search problems
-instance Arrow a => GArrow a (,) where
+type Id a = a
+
+instance Arrow a => GArrow a (,) () where
ga_first = first
ga_second = second
ga_cancell = arr (\((),x) -> x)
ga_assoc = arr (\((x,y),z) -> (x,(y,z)))
ga_unassoc = arr (\(x,(y,z)) -> ((x,y),z))
-instance Arrow a => GArrowDrop a (,) where
+instance Arrow a => GArrowDrop a (,) () where
ga_drop = arr (\x -> ())
-instance Arrow a => GArrowCopy a (,) where
+instance Arrow a => GArrowCopy a (,) () where
ga_copy = arr (\x -> (x,x))
-instance Arrow a => GArrowSwap a (,) where
+instance Arrow a => GArrowSwap a (,) () where
ga_swap = arr (\(x,y) -> (y,x))
-instance Arrow a => GArrowLiteral a (,) b where
- ga_literal x = arr (\() -> x)
+instance Arrow a => GArrowConstant a (,) () t t where
+ ga_constant x = arr (\() -> x)
-instance Arrow a => GArrowReify a (,) where
+instance Arrow a => GArrowReify a (,) () x y x y where
ga_reify = arr
-instance ArrowLoop a => GArrowLoop a (,) where
- ga_loop = loop
+instance ArrowLoop a => GArrowLoop a (,) () where
+ ga_loopl = loop
+ ga_loopr f = loop (ga_swap >>> f >>> ga_swap)
+instance ArrowApply a => GArrowApply a (,) () a where
+ ga_applyl = ga_swap >>> app
+ ga_applyr = app