Looping CCC optimization

[conal]

The following optimization in LambdaCCC.CCC occasionally leads to non-terminating construction:

  Apply     . (decompL -> g :. f)  = (Apply :. g) . f

A triggering example in test/TreeTest.hs:

main = go "dot1" (dot :: Tree N1 (Int,Int) -> Int)