[introduce abbreviations for ConT ''SomeType
Helmut Grohne <grohne@cs.uni-bonn.de>**20150309120412
 Ignore-this: 64a67504fd0dcf02ce0b8c1ef97f933d
 
  * Allows using these constructors in modules that do not enable TH.
  * Simplifies refactoring of the ConT constructor (e.g. adding kinds).
] hunk ./src/Igor2/Config.hs 62
-    
-defaultPredicates = 
-    [('(==), forallT ["a"] [(''Eq,"a")] $ arrowT [varT "a", varT "a", conT ''Bool]) 
---    , '(/=), forallT ["a"] [(''Eq,"a")] $ arrowT [varT "a", varT "a", conT ''Bool]) 
-    ,('(<), forallT ["a"] [(''Ord,"a")] $ arrowT [varT "a", varT "a", conT ''Bool]) 
---    ,('(>=), forallT ["a"] [(''Ord,"a")] $ arrowT [varT "a", varT "a", conT ''Bool]) 
-    ,('(>), forallT ["a"] [(''Ord,"a")] $ arrowT [varT "a", varT "a", conT ''Bool]) 
---    ,('(<=), forallT ["a"] [(''Ord,"a")] $ arrowT [varT "a", varT "a", conT ''Bool]) 
+
+defaultPredicates =
+    [('(==), forallT ["a"] [(''Eq, "a")] $ arrowT [varT "a", varT "a", boolCon])
+--    , '(/=), forallT ["a"] [(''Eq, "a")] $ arrowT [varT "a", varT "a", boolCon])
+    ,('(<), forallT ["a"] [(''Ord, "a")] $ arrowT [varT "a", varT "a", boolCon])
+--    ,('(>=), forallT ["a"] [(''Ord, "a")] $ arrowT [varT "a", varT "a", boolCon])
+    ,('(>), forallT ["a"] [(''Ord, "a")] $ arrowT [varT "a", varT "a", boolCon])
+--    ,('(<=), forallT ["a"] [(''Ord, "a")] $ arrowT [varT "a", varT "a", boolCon])
hunk ./src/Igor2/RuleDevelopment/Cata.hs 142
-            ety = foldAppT (conT ''Either) $ map (head . unArrowT) [lty,rty]
-        in  tInfixE l (tConE '(\/) [lty,rty,ety,last . unArrowT $ lty]) r 
-     mkInfxs (l:rs)= 
+            ety = foldAppT eitherCon $ map (head . unArrowT) [lty,rty]
+        in  tInfixE l (tConE '(\/) [lty, rty, ety, last . unArrowT $ lty]) r
+     mkInfxs (l:rs) =
hunk ./src/Igor2/RuleDevelopment/Cata.hs 146
-            ety = foldAppT (conT ''Either)$ map (head . unArrowT) [lty,rty]
-        in  tInfixE l (tConE '(\/) [lty,rty,ety,last . unArrowT $ rty]) r             
-            
-            
+            ety = foldAppT eitherCon $ map (head . unArrowT) [lty, rty]
+        in  tInfixE l (tConE '(\/) [lty, rty, ety, last . unArrowT $ rty]) r
+
+
hunk ./src/Igor2/RuleDevelopment/ListCata.hs 111
-    where  
-    mkFIO = map . (\b r -> let n = if b then 'True else 'False 
-                           in rule (init . lhs $ r)(tConE n [ConT ''Bool]))
+    where
+    mkFIO = map . (\b r -> let n = if b then 'True else 'False
+                           in rule (init . lhs $ r)(tConE n [boolCon]))
hunk ./src/Syntax/Context.hs 13
+    boolCon, eitherCon, intCon, maybeCon,
+
hunk ./src/Syntax/Context.hs 111
+boolCon = conT ''Bool
+eitherCon = conT ''Either
+maybeCon = conT ''Maybe
+intCon = conT ''Int
+
hunk ./src/Syntax/Context.hs 118
-    [('(==), arrowT [varT "a", varT "a", conT ''Bool])
+    [('(==), arrowT [varT "a", varT "a", boolCon])
hunk ./src/Syntax/Context.hs 120
---    , '(/=), arrowT [varT "a", varT "a", conT ''Bool])
-    ,('(<), arrowT [varT "a", varT "a", conT ''Bool])
---    ,('(>=), arrowT [varT "a", varT "a", conT ''Bool])
-    ,('(>), arrowT [varT "a", varT "a", conT ''Bool])
---    ,('(<=), arrowT [varT "a", varT "a", conT ''Bool])
+--    , '(/=), arrowT [varT "a", varT "a", boolCon])
+    ,('(<), arrowT [varT "a", varT "a", boolCon])
+--    ,('(>=), arrowT [varT "a", varT "a", boolCon])
+    ,('(>), arrowT [varT "a", varT "a", boolCon])
+--    ,('(<=), arrowT [varT "a", varT "a", boolCon])
hunk ./src/Syntax/Context.hs 127
-    ,('True,    conT ''Bool )
-    ,('False,   conT ''Bool )
-    ,('Just,    arrowT [varT "a", appT (conT ''Maybe) (varT "a")])
-    ,('Nothing, appT (conT ''Maybe) (varT "a") )
-    ,('Left,    arrowT [varT "a", foldAppT (conT ''Either) [varT "a", varT "b"]])
-    ,('Right,   arrowT [varT "b", foldAppT (conT ''Either) [varT "a", varT "b"]])
+    ,('True,    boolCon)
+    ,('False,   boolCon)
+    ,('Just,    arrowT [varT "a", appT maybeCon (varT "a")])
+    ,('Nothing, appT maybeCon (varT "a") )
+    ,('Left,    arrowT [varT "a", foldAppT eitherCon [varT "a", varT "b"]])
+    ,('Right,   arrowT [varT "b", foldAppT eitherCon [varT "a", varT "b"]])
hunk ./src/Syntax/Context.hs 157
-    [(''Eq, [ conT ''Bool
-            , conT ''Int
+    [(''Eq, [ boolCon
+            , intCon
hunk ./src/Syntax/Context.hs 160
-            , forallT ["a"][(''Eq,"a")] $ appT (conT ''Maybe) (varT "a")
-            ]) 
-    ,(''Ord, [ conT ''Bool
-             , conT ''Int
+            , forallT ["a"][(''Eq,"a")] $ appT maybeCon (varT "a")
+            ])
+    ,(''Ord, [ boolCon
+             , intCon
hunk ./src/Syntax/Context.hs 165
-             , forallT ["a"][(''Ord,"a")] $ appT (conT ''Maybe) (varT "a")
+             , forallT ["a"][(''Ord,"a")] $ appT maybeCon (varT "a")
hunk ./src/Syntax/Type.hs 24
-    appT, arrowT, varT, conT, forallT, listT, tupT, infixT, sectionType, 
+    appT, arrowCon, arrowT, varT, conT, forallT, listCon, listT, tupleCon, tupT, infixT, sectionType,
hunk ./src/Syntax/Type.hs 142
+listCon = ConT ''[]
hunk ./src/Syntax/Type.hs 144
-listT = AppT (ConT ''[])
+listT = AppT listCon
hunk ./src/Syntax/Type.hs 146
+tupleCon = ConT . tupleDataName
hunk ./src/Syntax/Type.hs 148
-tupT l = foldAppT (ConT (tupleDataName (length l))) l
+tupT l = foldAppT (tupleCon $ length l) l